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

About the Execution of Marcie+red for UtahNoC-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6274.287 129695.00 140378.00 958.60 TFFFTFFTFTTTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912709300951.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 UtahNoC-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709300951
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K 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 UtahNoC-PT-none-ReachabilityFireability-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679358587068

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:29:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 00:29:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:29:48] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-21 00:29:48] [INFO ] Transformed 216 places.
[2023-03-21 00:29:48] [INFO ] Transformed 977 transitions.
[2023-03-21 00:29:48] [INFO ] Found NUPN structural information;
[2023-03-21 00:29:48] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 16) seen :6
FORMULA UtahNoC-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 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 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 00:29:49] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-21 00:29:49] [INFO ] Computed 8 place invariants in 47 ms
[2023-03-21 00:29:49] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 00:29:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-21 00:29:50] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-21 00:29:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-21 00:29:50] [INFO ] After 174ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-21 00:29:50] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-21 00:29:50] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA UtahNoC-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA UtahNoC-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA UtahNoC-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 64 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 199 edges and 216 vertex of which 39 / 216 are part of one of the 11 SCC in 3 ms
Free SCC test removed 28 places
Drop transitions removed 168 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 189 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 188 transition count 638
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 186 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 184 transition count 636
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 184 transition count 635
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 183 transition count 635
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 36 place count 158 transition count 550
Iterating global reduction 3 with 25 rules applied. Total rules applied 61 place count 158 transition count 550
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 91 place count 158 transition count 520
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 155 transition count 511
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 155 transition count 511
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 155 transition count 507
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 105 place count 153 transition count 505
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 109 place count 153 transition count 501
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 110 place count 152 transition count 499
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 152 transition count 499
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 112 place count 151 transition count 497
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 151 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 151 transition count 496
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 118 place count 149 transition count 513
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 126 place count 149 transition count 505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 127 place count 148 transition count 504
Iterating global reduction 7 with 1 rules applied. Total rules applied 128 place count 148 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 148 transition count 503
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 131 place count 148 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 133 place count 146 transition count 501
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 134 place count 146 transition count 500
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 136 place count 146 transition count 507
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 139 place count 144 transition count 506
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 142 place count 144 transition count 503
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 144 place count 144 transition count 503
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 145 place count 144 transition count 503
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 146 place count 143 transition count 502
Iterating global reduction 10 with 1 rules applied. Total rules applied 147 place count 143 transition count 502
Applied a total of 147 rules in 220 ms. Remains 143 /216 variables (removed 73) and now considering 502/829 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 143/216 places, 502/829 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 00:29:51] [INFO ] Flow matrix only has 288 transitions (discarded 214 similar events)
// Phase 1: matrix 288 rows 143 cols
[2023-03-21 00:29:51] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-21 00:29:51] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 00:29:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-21 00:29:51] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 00:29:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 00:29:51] [INFO ] After 92ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 00:29:51] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-21 00:29:52] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 12 ms.
Support contains 47 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 502/502 transitions.
Graph (trivial) has 48 edges and 143 vertex of which 7 / 143 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 135 transition count 482
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 135 transition count 482
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 15 place count 135 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 134 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 134 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 134 transition count 472
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 134 transition count 468
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 134 transition count 466
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 29 place count 132 transition count 463
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 132 transition count 463
Applied a total of 30 rules in 40 ms. Remains 132 /143 variables (removed 11) and now considering 463/502 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 132/143 places, 463/502 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :2
FORMULA UtahNoC-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-04 TRUE 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 00:29:52] [INFO ] Flow matrix only has 256 transitions (discarded 207 similar events)
// Phase 1: matrix 256 rows 132 cols
[2023-03-21 00:29:52] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-21 00:29:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 00:29:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-21 00:29:52] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 00:29:52] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-21 00:29:52] [INFO ] After 64ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 00:29:52] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-21 00:29:52] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 45 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 463/463 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 456
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 130 transition count 453
Applied a total of 7 rules in 14 ms. Remains 130 /132 variables (removed 2) and now considering 453/463 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 130/132 places, 453/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-21 00:29:52] [INFO ] Flow matrix only has 249 transitions (discarded 204 similar events)
// Phase 1: matrix 249 rows 130 cols
[2023-03-21 00:29:52] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-21 00:29:52] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 00:29:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-21 00:29:53] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 00:29:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-21 00:29:53] [INFO ] After 53ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 00:29:53] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-21 00:29:53] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 43 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 453/453 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 449
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 129 transition count 443
Applied a total of 8 rules in 17 ms. Remains 129 /130 variables (removed 1) and now considering 443/453 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 129/130 places, 443/453 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 362815 steps, run visited all 1 properties in 745 ms. (steps per millisecond=487 )
Probabilistic random walk after 362815 steps, saw 218427 distinct states, run finished after 745 ms. (steps per millisecond=487 ) properties seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 5479 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: UtahNoC_PT_none
(NrP: 216 NrTr: 977 NrArc: 2905)

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

net check time: 0m 0.000sec

init dd package: 0m 2.746sec


RS generation: 0m43.405sec


-> reachability set: #nodes 11093 (1.1e+04) #states 4,759,924,249 (9)



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

checking: EF [IS_FIREABLE [t296]]
normalized: E [true U IS_FIREABLE [t296]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.441sec

checking: EF [IS_FIREABLE [t30]]
normalized: E [true U IS_FIREABLE [t30]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.453sec

checking: EF [IS_FIREABLE [t517]]
normalized: E [true U IS_FIREABLE [t517]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.940sec

checking: EF [IS_FIREABLE [t935]]
normalized: E [true U IS_FIREABLE [t935]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.528sec

checking: AG [~ [[IS_FIREABLE [t745] | IS_FIREABLE [t881]]]]
normalized: ~ [E [true U [IS_FIREABLE [t745] | IS_FIREABLE [t881]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.995sec

checking: AG [~ [[IS_FIREABLE [t529] & IS_FIREABLE [t590]]]]
normalized: ~ [E [true U [IS_FIREABLE [t529] & IS_FIREABLE [t590]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.587sec

checking: AG [~ [[IS_FIREABLE [t573] & [~ [[~ [[IS_FIREABLE [t218] | IS_FIREABLE [t475]]] | [[IS_FIREABLE [t627] | IS_FIREABLE [t49]] & IS_FIREABLE [t210]]]] & IS_FIREABLE [t447]]]]]
normalized: ~ [E [true U [[~ [[~ [[IS_FIREABLE [t218] | IS_FIREABLE [t475]]] | [[IS_FIREABLE [t627] | IS_FIREABLE [t49]] & IS_FIREABLE [t210]]]] & IS_FIREABLE [t447]] & IS_FIREABLE [t573]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.963sec

checking: EF [[~ [[[[IS_FIREABLE [t20] | IS_FIREABLE [t192]] | [[~ [[IS_FIREABLE [t537] | IS_FIREABLE [t560]]] & [[~ [IS_FIREABLE [t288]] | IS_FIREABLE [t542]] | [~ [IS_FIREABLE [t516]] & [IS_FIREABLE [t909] & IS_FIREABLE [t364]]]]] & IS_FIREABLE [t386]]] | ~ [IS_FIREABLE [t10]]]] | IS_FIREABLE [t390]]]
normalized: E [true U [~ [[~ [IS_FIREABLE [t10]] | [[IS_FIREABLE [t20] | IS_FIREABLE [t192]] | [IS_FIREABLE [t386] & [[[~ [IS_FIREABLE [t516]] & [IS_FIREABLE [t909] & IS_FIREABLE [t364]]] | [~ [IS_FIREABLE [t288]] | IS_FIREABLE [t542]]] & ~ [[IS_FIREABLE [t537] | IS_FIREABLE [t560]]]]]]]] | IS_FIREABLE [t390]]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.230sec

checking: EF [[[[[[~ [[[[IS_FIREABLE [t821] & IS_FIREABLE [t811]] & ~ [IS_FIREABLE [t870]]] & [IS_FIREABLE [t130] | ~ [IS_FIREABLE [t460]]]]] & IS_FIREABLE [t28]] | ~ [[IS_FIREABLE [t74] | ~ [[IS_FIREABLE [t897] & ~ [IS_FIREABLE [t513]]]]]]] | IS_FIREABLE [t818]] & IS_FIREABLE [t92]] & [IS_FIREABLE [t417] | IS_FIREABLE [t904]]]]
normalized: E [true U [[[[[~ [[[~ [IS_FIREABLE [t460]] | IS_FIREABLE [t130]] & [[IS_FIREABLE [t821] & IS_FIREABLE [t811]] & ~ [IS_FIREABLE [t870]]]]] & IS_FIREABLE [t28]] | ~ [[~ [[~ [IS_FIREABLE [t513]] & IS_FIREABLE [t897]]] | IS_FIREABLE [t74]]]] | IS_FIREABLE [t818]] & IS_FIREABLE [t92]] & [IS_FIREABLE [t417] | IS_FIREABLE [t904]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AG [~ [[IS_FIREABLE [t1] & [~ [[[~ [IS_FIREABLE [t849]] | ~ [IS_FIREABLE [t684]]] & ~ [[~ [[IS_FIREABLE [t829] | IS_FIREABLE [t74]]] | [IS_FIREABLE [t762] | IS_FIREABLE [t198]]]]]] & ~ [[~ [IS_FIREABLE [t786]] & [~ [[[IS_FIREABLE [t20] & IS_FIREABLE [t938]] & [IS_FIREABLE [t926] | IS_FIREABLE [t563]]]] | [[IS_FIREABLE [t466] & ~ [IS_FIREABLE [t554]]] | IS_FIREABLE [t556]]]]]]]]]
normalized: ~ [E [true U [[~ [[~ [[~ [[IS_FIREABLE [t829] | IS_FIREABLE [t74]]] | [IS_FIREABLE [t762] | IS_FIREABLE [t198]]]] & [~ [IS_FIREABLE [t684]] | ~ [IS_FIREABLE [t849]]]]] & ~ [[[[[~ [IS_FIREABLE [t554]] & IS_FIREABLE [t466]] | IS_FIREABLE [t556]] | ~ [[[IS_FIREABLE [t20] & IS_FIREABLE [t938]] & [IS_FIREABLE [t926] | IS_FIREABLE [t563]]]]] & ~ [IS_FIREABLE [t786]]]]] & IS_FIREABLE [t1]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.343sec

checking: AG [[~ [[~ [[[~ [[~ [IS_FIREABLE [t265]] & [IS_FIREABLE [t691] & IS_FIREABLE [t577]]]] | [[~ [IS_FIREABLE [t103]] & ~ [IS_FIREABLE [t145]]] | [[IS_FIREABLE [t898] & IS_FIREABLE [t165]] | [IS_FIREABLE [t240] | IS_FIREABLE [t813]]]]] | ~ [[[IS_FIREABLE [t408] | IS_FIREABLE [t878]] | IS_FIREABLE [t777]]]]] & IS_FIREABLE [t444]]] & [[[~ [IS_FIREABLE [t737]] & ~ [IS_FIREABLE [t707]]] & IS_FIREABLE [t354]] | ~ [IS_FIREABLE [t663]]]]]
normalized: ~ [E [true U ~ [[[~ [IS_FIREABLE [t663]] | [[~ [IS_FIREABLE [t707]] & ~ [IS_FIREABLE [t737]]] & IS_FIREABLE [t354]]] & ~ [[~ [[~ [[[IS_FIREABLE [t408] | IS_FIREABLE [t878]] | IS_FIREABLE [t777]]] | [[[[IS_FIREABLE [t240] | IS_FIREABLE [t813]] | [IS_FIREABLE [t898] & IS_FIREABLE [t165]]] | [~ [IS_FIREABLE [t145]] & ~ [IS_FIREABLE [t103]]]] | ~ [[[IS_FIREABLE [t691] & IS_FIREABLE [t577]] & ~ [IS_FIREABLE [t265]]]]]]] & IS_FIREABLE [t444]]]]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.879sec

checking: AG [~ [[[[[[[~ [[IS_FIREABLE [t642] | IS_FIREABLE [t555]]] & IS_FIREABLE [t69]] | IS_FIREABLE [t487]] | [[[[IS_FIREABLE [t331] | IS_FIREABLE [t224]] | ~ [IS_FIREABLE [t897]]] | IS_FIREABLE [t261]] | ~ [[~ [IS_FIREABLE [t621]] | ~ [IS_FIREABLE [t881]]]]]] | [~ [[[[IS_FIREABLE [t940] & IS_FIREABLE [t967]] & ~ [IS_FIREABLE [t703]]] & IS_FIREABLE [t198]]] & ~ [[[[IS_FIREABLE [t551] & IS_FIREABLE [t811]] & ~ [IS_FIREABLE [t234]]] & [~ [IS_FIREABLE [t333]] | IS_FIREABLE [t769]]]]]] | IS_FIREABLE [t384]] & [[[~ [IS_FIREABLE [t451]] & [[[IS_FIREABLE [t74] | [IS_FIREABLE [t840] | IS_FIREABLE [t971]]] | ~ [[IS_FIREABLE [t400] & IS_FIREABLE [t541]]]] & [[~ [IS_FIREABLE [t568]] | [IS_FIREABLE [t702] | IS_FIREABLE [t97]]] & ~ [[IS_FIREABLE [t232] | IS_FIREABLE [t237]]]]]] & IS_FIREABLE [t616]] & [IS_FIREABLE [t380] & IS_FIREABLE [t700]]]]]]
normalized: ~ [E [true U [[[IS_FIREABLE [t380] & IS_FIREABLE [t700]] & [[[[~ [[IS_FIREABLE [t232] | IS_FIREABLE [t237]]] & [[IS_FIREABLE [t702] | IS_FIREABLE [t97]] | ~ [IS_FIREABLE [t568]]]] & [~ [[IS_FIREABLE [t400] & IS_FIREABLE [t541]]] | [[IS_FIREABLE [t840] | IS_FIREABLE [t971]] | IS_FIREABLE [t74]]]] & ~ [IS_FIREABLE [t451]]] & IS_FIREABLE [t616]]] & [[[~ [[[~ [IS_FIREABLE [t333]] | IS_FIREABLE [t769]] & [~ [IS_FIREABLE [t234]] & [IS_FIREABLE [t551] & IS_FIREABLE [t811]]]]] & ~ [[[~ [IS_FIREABLE [t703]] & [IS_FIREABLE [t940] & IS_FIREABLE [t967]]] & IS_FIREABLE [t198]]]] | [[~ [[~ [IS_FIREABLE [t881]] | ~ [IS_FIREABLE [t621]]]] | [[~ [IS_FIREABLE [t897]] | [IS_FIREABLE [t331] | IS_FIREABLE [t224]]] | IS_FIREABLE [t261]]] | [[~ [[IS_FIREABLE [t642] | IS_FIREABLE [t555]]] & IS_FIREABLE [t69]] | IS_FIREABLE [t487]]]] | IS_FIREABLE [t384]]]]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: AG [[[[[[[IS_FIREABLE [t867] | [[[IS_FIREABLE [t704] | IS_FIREABLE [t400]] | [IS_FIREABLE [t643] | IS_FIREABLE [t493]]] & IS_FIREABLE [t586]]] | IS_FIREABLE [t798]] | IS_FIREABLE [t269]] & ~ [IS_FIREABLE [t537]]] | ~ [[~ [[~ [[~ [IS_FIREABLE [t518]] | IS_FIREABLE [t26]]] & [[~ [IS_FIREABLE [t73]] | IS_FIREABLE [t925]] & IS_FIREABLE [t290]]]] & [[IS_FIREABLE [t728] & [IS_FIREABLE [t92] | [~ [IS_FIREABLE [t947]] | IS_FIREABLE [t618]]]] & ~ [[~ [[IS_FIREABLE [t779] & IS_FIREABLE [t662]]] & [[IS_FIREABLE [t971] | IS_FIREABLE [t622]] | ~ [IS_FIREABLE [t573]]]]]]]]] | [[~ [[[[[[IS_FIREABLE [t945] & IS_FIREABLE [t435]] | ~ [IS_FIREABLE [t895]]] | [~ [IS_FIREABLE [t760]] | [IS_FIREABLE [t285] & IS_FIREABLE [t578]]]] & IS_FIREABLE [t494]] | IS_FIREABLE [t751]]] | ~ [[IS_FIREABLE [t39] | IS_FIREABLE [t488]]]] & ~ [IS_FIREABLE [t897]]]]]
normalized: ~ [E [true U ~ [[[~ [IS_FIREABLE [t897]] & [~ [[IS_FIREABLE [t39] | IS_FIREABLE [t488]]] | ~ [[[[[[IS_FIREABLE [t285] & IS_FIREABLE [t578]] | ~ [IS_FIREABLE [t760]]] | [~ [IS_FIREABLE [t895]] | [IS_FIREABLE [t945] & IS_FIREABLE [t435]]]] & IS_FIREABLE [t494]] | IS_FIREABLE [t751]]]]] | [~ [[[~ [[[~ [IS_FIREABLE [t573]] | [IS_FIREABLE [t971] | IS_FIREABLE [t622]]] & ~ [[IS_FIREABLE [t779] & IS_FIREABLE [t662]]]]] & [[[~ [IS_FIREABLE [t947]] | IS_FIREABLE [t618]] | IS_FIREABLE [t92]] & IS_FIREABLE [t728]]] & ~ [[[[~ [IS_FIREABLE [t73]] | IS_FIREABLE [t925]] & IS_FIREABLE [t290]] & ~ [[~ [IS_FIREABLE [t518]] | IS_FIREABLE [t26]]]]]]] | [~ [IS_FIREABLE [t537]] & [[[[[[IS_FIREABLE [t643] | IS_FIREABLE [t493]] | [IS_FIREABLE [t704] | IS_FIREABLE [t400]]] & IS_FIREABLE [t586]] | IS_FIREABLE [t867]] | IS_FIREABLE [t798]] | IS_FIREABLE [t269]]]]]]]]

-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.174sec

checking: AG [[[~ [[~ [[~ [[IS_FIREABLE [t798] & IS_FIREABLE [t333]]] | [~ [IS_FIREABLE [t40]] | [[IS_FIREABLE [t209] & IS_FIREABLE [t618]] | ~ [IS_FIREABLE [t264]]]]]] & IS_FIREABLE [t130]]] & [[IS_FIREABLE [t742] | IS_FIREABLE [t498]] & [~ [IS_FIREABLE [t832]] | [~ [[[~ [IS_FIREABLE [t265]] & ~ [IS_FIREABLE [t197]]] & IS_FIREABLE [t266]]] & IS_FIREABLE [t960]]]]] | [~ [IS_FIREABLE [t479]] | [[~ [[[[IS_FIREABLE [t141] & [IS_FIREABLE [t324] & IS_FIREABLE [t564]]] & [~ [IS_FIREABLE [t33]] & ~ [IS_FIREABLE [t820]]]] | ~ [[[IS_FIREABLE [t930] & IS_FIREABLE [t799]] & [IS_FIREABLE [t969] | IS_FIREABLE [t688]]]]]] & IS_FIREABLE [t902]] | ~ [[[~ [IS_FIREABLE [t803]] | [IS_FIREABLE [t687] & [~ [IS_FIREABLE [t124]] & [IS_FIREABLE [t30] & IS_FIREABLE [t843]]]]] & [~ [IS_FIREABLE [t352]] & [~ [IS_FIREABLE [t336]] & [IS_FIREABLE [t769] & [IS_FIREABLE [t914] | IS_FIREABLE [t732]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[[[[[IS_FIREABLE [t914] | IS_FIREABLE [t732]] & IS_FIREABLE [t769]] & ~ [IS_FIREABLE [t336]]] & ~ [IS_FIREABLE [t352]]] & [[[[IS_FIREABLE [t30] & IS_FIREABLE [t843]] & ~ [IS_FIREABLE [t124]]] & IS_FIREABLE [t687]] | ~ [IS_FIREABLE [t803]]]]] | [~ [[~ [[[IS_FIREABLE [t969] | IS_FIREABLE [t688]] & [IS_FIREABLE [t930] & IS_FIREABLE [t799]]]] | [[~ [IS_FIREABLE [t820]] & ~ [IS_FIREABLE [t33]]] & [[IS_FIREABLE [t324] & IS_FIREABLE [t564]] & IS_FIREABLE [t141]]]]] & IS_FIREABLE [t902]]] | ~ [IS_FIREABLE [t479]]] | [[[[~ [[[~ [IS_FIREABLE [t197]] & ~ [IS_FIREABLE [t265]]] & IS_FIREABLE [t266]]] & IS_FIREABLE [t960]] | ~ [IS_FIREABLE [t832]]] & [IS_FIREABLE [t742] | IS_FIREABLE [t498]]] & ~ [[~ [[[[~ [IS_FIREABLE [t264]] | [IS_FIREABLE [t209] & IS_FIREABLE [t618]]] | ~ [IS_FIREABLE [t40]]] | ~ [[IS_FIREABLE [t798] & IS_FIREABLE [t333]]]]] & IS_FIREABLE [t130]]]]]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.317sec

checking: AG [[[[[IS_FIREABLE [t149] | ~ [[[[[IS_FIREABLE [t403] & IS_FIREABLE [t286]] | IS_FIREABLE [t341]] & ~ [[IS_FIREABLE [t235] & IS_FIREABLE [t502]]]] | IS_FIREABLE [t31]]]] & ~ [[[[~ [[IS_FIREABLE [t227] | IS_FIREABLE [t531]]] | [[IS_FIREABLE [t479] & IS_FIREABLE [t126]] & [IS_FIREABLE [t729] | IS_FIREABLE [t119]]]] & [[~ [IS_FIREABLE [t37]] & [IS_FIREABLE [t117] & IS_FIREABLE [t669]]] | [[IS_FIREABLE [t305] | IS_FIREABLE [t467]] | ~ [IS_FIREABLE [t381]]]]] | [IS_FIREABLE [t869] & [IS_FIREABLE [t482] & IS_FIREABLE [t834]]]]]] | [[[[~ [IS_FIREABLE [t347]] | ~ [[IS_FIREABLE [t406] & IS_FIREABLE [t207]]]] | [[[IS_FIREABLE [t495] & IS_FIREABLE [t417]] | ~ [[IS_FIREABLE [t310] & IS_FIREABLE [t144]]]] | IS_FIREABLE [t348]]] | ~ [[~ [IS_FIREABLE [t362]] | [~ [IS_FIREABLE [t47]] & ~ [IS_FIREABLE [t873]]]]]] | IS_FIREABLE [t207]]] & ~ [IS_FIREABLE [t892]]]]
normalized: ~ [E [true U ~ [[~ [IS_FIREABLE [t892]] & [[[~ [[[~ [IS_FIREABLE [t873]] & ~ [IS_FIREABLE [t47]]] | ~ [IS_FIREABLE [t362]]]] | [[[~ [[IS_FIREABLE [t310] & IS_FIREABLE [t144]]] | [IS_FIREABLE [t495] & IS_FIREABLE [t417]]] | IS_FIREABLE [t348]] | [~ [[IS_FIREABLE [t406] & IS_FIREABLE [t207]]] | ~ [IS_FIREABLE [t347]]]]] | IS_FIREABLE [t207]] | [~ [[[[IS_FIREABLE [t482] & IS_FIREABLE [t834]] & IS_FIREABLE [t869]] | [[[~ [IS_FIREABLE [t381]] | [IS_FIREABLE [t305] | IS_FIREABLE [t467]]] | [[IS_FIREABLE [t117] & IS_FIREABLE [t669]] & ~ [IS_FIREABLE [t37]]]] & [[[IS_FIREABLE [t729] | IS_FIREABLE [t119]] & [IS_FIREABLE [t479] & IS_FIREABLE [t126]]] | ~ [[IS_FIREABLE [t227] | IS_FIREABLE [t531]]]]]]] & [~ [[[~ [[IS_FIREABLE [t235] & IS_FIREABLE [t502]]] & [[IS_FIREABLE [t403] & IS_FIREABLE [t286]] | IS_FIREABLE [t341]]] | IS_FIREABLE [t31]]] | IS_FIREABLE [t149]]]]]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.663sec

checking: AG [~ [[[[[~ [IS_FIREABLE [t72]] & [~ [[[IS_FIREABLE [t206] & IS_FIREABLE [t135]] | [IS_FIREABLE [t798] & IS_FIREABLE [t875]]]] | IS_FIREABLE [t759]]] & [IS_FIREABLE [t201] & IS_FIREABLE [t130]]] | [[[[IS_FIREABLE [t108] & ~ [IS_FIREABLE [t15]]] & ~ [[[IS_FIREABLE [t629] & IS_FIREABLE [t584]] | [IS_FIREABLE [t538] | IS_FIREABLE [t461]]]]] | [IS_FIREABLE [t379] & IS_FIREABLE [t769]]] & [IS_FIREABLE [t755] | [~ [[~ [IS_FIREABLE [t97]] & IS_FIREABLE [t82]]] & [IS_FIREABLE [t50] & ~ [[IS_FIREABLE [t583] & IS_FIREABLE [t705]]]]]]]] | ~ [[~ [[[~ [IS_FIREABLE [t213]] | ~ [[IS_FIREABLE [t67] | IS_FIREABLE [t375]]]] | ~ [[IS_FIREABLE [t95] & [IS_FIREABLE [t662] | IS_FIREABLE [t548]]]]]] | [[[[[IS_FIREABLE [t455] & IS_FIREABLE [t21]] & [IS_FIREABLE [t925] | IS_FIREABLE [t440]]] | ~ [[IS_FIREABLE [t255] | IS_FIREABLE [t499]]]] & IS_FIREABLE [t579]] | [[IS_FIREABLE [t109] | [[IS_FIREABLE [t189] & IS_FIREABLE [t360]] | ~ [IS_FIREABLE [t549]]]] | [[~ [IS_FIREABLE [t550]] & ~ [IS_FIREABLE [t585]]] | [~ [IS_FIREABLE [t218]] & IS_FIREABLE [t294]]]]]]]]]]
normalized: ~ [E [true U [~ [[[[[[~ [IS_FIREABLE [t218]] & IS_FIREABLE [t294]] | [~ [IS_FIREABLE [t585]] & ~ [IS_FIREABLE [t550]]]] | [[~ [IS_FIREABLE [t549]] | [IS_FIREABLE [t189] & IS_FIREABLE [t360]]] | IS_FIREABLE [t109]]] | [[~ [[IS_FIREABLE [t255] | IS_FIREABLE [t499]]] | [[IS_FIREABLE [t925] | IS_FIREABLE [t440]] & [IS_FIREABLE [t455] & IS_FIREABLE [t21]]]] & IS_FIREABLE [t579]]] | ~ [[~ [[[IS_FIREABLE [t662] | IS_FIREABLE [t548]] & IS_FIREABLE [t95]]] | [~ [[IS_FIREABLE [t67] | IS_FIREABLE [t375]]] | ~ [IS_FIREABLE [t213]]]]]]] | [[[[[~ [[IS_FIREABLE [t583] & IS_FIREABLE [t705]]] & IS_FIREABLE [t50]] & ~ [[~ [IS_FIREABLE [t97]] & IS_FIREABLE [t82]]]] | IS_FIREABLE [t755]] & [[IS_FIREABLE [t379] & IS_FIREABLE [t769]] | [~ [[[IS_FIREABLE [t538] | IS_FIREABLE [t461]] | [IS_FIREABLE [t629] & IS_FIREABLE [t584]]]] & [~ [IS_FIREABLE [t15]] & IS_FIREABLE [t108]]]]] | [[IS_FIREABLE [t201] & IS_FIREABLE [t130]] & [[~ [[[IS_FIREABLE [t798] & IS_FIREABLE [t875]] | [IS_FIREABLE [t206] & IS_FIREABLE [t135]]]] | IS_FIREABLE [t759]] & ~ [IS_FIREABLE [t72]]]]]]]]

-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.403sec

totally nodes used: 11830044 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 181730990 454487469 636218459
used/not used/entry size/cache size: 67028005 80859 16 1024MB
basic ops cache: hits/miss/sum: 5243518 11834123 17077641
used/not used/entry size/cache size: 10390343 6386873 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 5573 11094 16667
used/not used/entry size/cache size: 11090 8377518 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 57364030
1 8039426
2 1385452
3 268271
4 44508
5 6319
6 751
7 91
8 13
9 3
>= 10 0

Total processing time: 2m 1.913sec


BK_STOP 1679358716763

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

1882 4344 7300 10366 10546 11120 11050 12406 11073 11509 7873 8366 8106 11158 11572 12625 10898 8951 9778 9727 10435 10186 14231 15619 14530 16285
iterations count:2659652 (2722), effective:29063 (29)

initing FirstDep: 0m 0.003sec


iterations count:32442 (33), effective:673 (0)

iterations count:17928 (18), effective:351 (0)

iterations count:17637 (18), effective:360 (0)

iterations count:13931 (14), effective:272 (0)

iterations count:69511 (71), effective:1646 (1)

iterations count:26006 (26), effective:498 (0)

iterations count:7307 (7), effective:127 (0)

iterations count:21987 (22), effective:500 (0)

iterations count:29833 (30), effective:661 (0)

iterations count:19019 (19), effective:392 (0)

iterations count:43144 (44), effective:950 (0)

iterations count:12586 (12), effective:232 (0)

iterations count:52802 (54), effective:1246 (1)

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="UtahNoC-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is UtahNoC-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912709300951"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;