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.r489-tall-167912707500950.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 ltsminxred
Input is UtahNoC-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707500950
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679335306949

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:01:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:01:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:01:48] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-20 18:01:48] [INFO ] Transformed 216 places.
[2023-03-20 18:01:48] [INFO ] Transformed 977 transitions.
[2023-03-20 18:01:48] [INFO ] Found NUPN structural information;
[2023-03-20 18:01:48] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 11) seen :1
FORMULA UtahNoC-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :2
FORMULA UtahNoC-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 18:01:49] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 18:01:49] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-20 18:01:49] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 18:01:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 18:01:50] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-20 18:01:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 18:01:50] [INFO ] After 187ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-20 18:01:50] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-20 18:01:50] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA UtahNoC-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 84 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 161 edges and 216 vertex of which 21 / 216 are part of one of the 7 SCC in 3 ms
Free SCC test removed 14 places
Drop transitions removed 144 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 202 transition count 675
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 201 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 200 transition count 674
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 200 transition count 672
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 198 transition count 672
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 25 place count 182 transition count 614
Iterating global reduction 3 with 16 rules applied. Total rules applied 41 place count 182 transition count 614
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 58 place count 182 transition count 597
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 60 place count 180 transition count 591
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 180 transition count 591
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 180 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 179 transition count 587
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 179 transition count 585
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 178 transition count 589
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 82 place count 178 transition count 578
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 177 transition count 577
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 177 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 85 place count 177 transition count 576
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 93 place count 177 transition count 568
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 110 place count 169 transition count 559
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 111 place count 169 transition count 563
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 113 place count 168 transition count 562
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 116 place count 168 transition count 559
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 120 place count 168 transition count 559
Applied a total of 120 rules in 213 ms. Remains 168 /216 variables (removed 48) and now considering 559/829 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 168/216 places, 559/829 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :4
FORMULA UtahNoC-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 18:01:51] [INFO ] Flow matrix only has 318 transitions (discarded 241 similar events)
// Phase 1: matrix 318 rows 168 cols
[2023-03-20 18:01:51] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-20 18:01:51] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 18:01:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 18:01:51] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 18:01:51] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 18:01:51] [INFO ] After 66ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 18:01:51] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-20 18:01:51] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 32 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 559/559 transitions.
Graph (trivial) has 118 edges and 168 vertex of which 39 / 168 are part of one of the 11 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions removed 48 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 75 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 128 transition count 443
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 128 transition count 443
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 35 place count 128 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 125 transition count 430
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 123 transition count 426
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 123 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 123 transition count 425
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 123 transition count 422
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 123 transition count 419
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 63 place count 120 transition count 411
Applied a total of 63 rules in 49 ms. Remains 120 /168 variables (removed 48) and now considering 411/559 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 120/168 places, 411/559 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 664616 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{1=1}
Probabilistic random walk after 664616 steps, saw 386392 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :1
FORMULA UtahNoC-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-20 18:01:55] [INFO ] Flow matrix only has 224 transitions (discarded 187 similar events)
// Phase 1: matrix 224 rows 120 cols
[2023-03-20 18:01:55] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-20 18:01:55] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:01:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 18:01:55] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:01:55] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-20 18:01:55] [INFO ] After 36ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 18:01:55] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-20 18:01:55] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 29 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 411/411 transitions.
Graph (trivial) has 61 edges and 120 vertex of which 2 / 120 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 119 transition count 408
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 118 transition count 408
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 9 place count 118 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 117 transition count 402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 115 transition count 394
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 115 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 115 transition count 392
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 115 transition count 391
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 114 transition count 390
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 22 place count 114 transition count 390
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 114 transition count 389
Applied a total of 23 rules in 28 ms. Remains 114 /120 variables (removed 6) and now considering 389/411 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 114/120 places, 389/411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 735600 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 735600 steps, saw 385330 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 18:01:58] [INFO ] Flow matrix only has 212 transitions (discarded 177 similar events)
// Phase 1: matrix 212 rows 114 cols
[2023-03-20 18:01:58] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-20 18:01:58] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:01:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 18:01:58] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:01:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 18:01:58] [INFO ] After 31ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 18:01:58] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 18:01:58] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 29 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 389/389 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 114/114 places, 389/389 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 389/389 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2023-03-20 18:01:58] [INFO ] Flow matrix only has 212 transitions (discarded 177 similar events)
[2023-03-20 18:01:58] [INFO ] Invariant cache hit.
[2023-03-20 18:01:58] [INFO ] Implicit Places using invariants in 42 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/114 places, 389/389 transitions.
Graph (trivial) has 68 edges and 112 vertex of which 10 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 101 transition count 352
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 101 transition count 352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 100 transition count 351
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 98 transition count 357
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 98 transition count 350
Applied a total of 24 rules in 16 ms. Remains 98 /112 variables (removed 14) and now considering 350/389 (removed 39) transitions.
[2023-03-20 18:01:58] [INFO ] Flow matrix only has 194 transitions (discarded 156 similar events)
// Phase 1: matrix 194 rows 98 cols
[2023-03-20 18:01:58] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 18:01:59] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-20 18:01:59] [INFO ] Flow matrix only has 194 transitions (discarded 156 similar events)
[2023-03-20 18:01:59] [INFO ] Invariant cache hit.
[2023-03-20 18:01:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 18:01:59] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/114 places, 350/389 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 388 ms. Remains : 98/114 places, 350/389 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 741929 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 741929 steps, saw 403220 distinct states, run finished after 3006 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 18:02:02] [INFO ] Flow matrix only has 194 transitions (discarded 156 similar events)
[2023-03-20 18:02:02] [INFO ] Invariant cache hit.
[2023-03-20 18:02:02] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:02:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 18:02:02] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:02:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 18:02:02] [INFO ] After 50ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 18:02:02] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 18:02:02] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 29 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 350/350 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 350/350 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 350/350 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 350/350 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2023-03-20 18:02:02] [INFO ] Flow matrix only has 194 transitions (discarded 156 similar events)
[2023-03-20 18:02:02] [INFO ] Invariant cache hit.
[2023-03-20 18:02:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-20 18:02:02] [INFO ] Flow matrix only has 194 transitions (discarded 156 similar events)
[2023-03-20 18:02:02] [INFO ] Invariant cache hit.
[2023-03-20 18:02:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 18:02:02] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-20 18:02:02] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 18:02:02] [INFO ] Flow matrix only has 194 transitions (discarded 156 similar events)
[2023-03-20 18:02:02] [INFO ] Invariant cache hit.
[2023-03-20 18:02:02] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 98/98 places, 350/350 transitions.
Graph (trivial) has 229 edges and 98 vertex of which 34 / 98 are part of one of the 9 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 213 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 216 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 73 transition count 131
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 70 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 68 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 68 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 66 transition count 127
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 31 place count 58 transition count 119
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 58 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 57 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 57 transition count 116
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 46 place count 57 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 57 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 56 transition count 104
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 56 transition count 103
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 56 transition count 103
Applied a total of 51 rules in 22 ms. Remains 56 /98 variables (removed 42) and now considering 103/350 (removed 247) transitions.
Running SMT prover for 2 properties.
[2023-03-20 18:02:02] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
// Phase 1: matrix 101 rows 56 cols
[2023-03-20 18:02:02] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 18:02:02] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:02:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 18:02:02] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:02:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 18:02:03] [INFO ] After 17ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 18:02:03] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 18:02:03] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 18:02:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-20 18:02:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 350 transitions and 1185 arcs took 2 ms.
[2023-03-20 18:02:03] [INFO ] Flatten gal took : 51 ms
Total runtime 14824 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/522/inv_0_ --invariant=/tmp/522/inv_1_ --inv-par
FORMULA UtahNoC-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679335328514

--------------------
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:
++ 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
++ sed s/.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
mcc2023
rfs formula name UtahNoC-PT-none-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/522/inv_0_
rfs formula name UtahNoC-PT-none-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/522/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 98 places, 350 transitions and 1185 arcs
pnml2lts-sym: Petri net UtahNoC_PT_none analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 350->275 groups
pnml2lts-sym: Regrouping took 0.060 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 98; there are 275 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/522/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/522/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 1.030 real 3.600 user 0.480 sys
pnml2lts-sym: max token count: 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="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtahNoC-PT-none, 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 r489-tall-167912707500950"
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 [ "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 ;