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.r491-tall-167912711200950.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 smartxred
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 r491-tall-167912711200950
=====================================================================

--------------------
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 1679306946475

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 10:09:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 10:09:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:09:08] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-20 10:09:08] [INFO ] Transformed 216 places.
[2023-03-20 10:09:08] [INFO ] Transformed 977 transitions.
[2023-03-20 10:09:08] [INFO ] Found NUPN structural information;
[2023-03-20 10:09:08] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 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 473 ms. (steps per millisecond=21 ) properties (out of 11) seen :7
FORMULA UtahNoC-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-11 TRUE 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-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 10:09:09] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 10:09:09] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-20 10:09:09] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 10:09:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-20 10:09:09] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-20 10:09:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 10:09:09] [INFO ] After 83ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-20 10:09:10] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-20 10:09:10] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA UtahNoC-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 32 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 267 edges and 216 vertex of which 61 / 216 are part of one of the 13 SCC in 3 ms
Free SCC test removed 48 places
Drop transitions removed 200 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 236 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 137 transition count 484
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 137 transition count 484
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 95 place count 137 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 132 transition count 438
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 132 transition count 438
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 112 place count 132 transition count 431
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 2 with 6 rules applied. Total rules applied 118 place count 129 transition count 428
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 129 transition count 424
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 127 transition count 420
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 127 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 127 transition count 419
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 4 with 4 rules applied. Total rules applied 131 place count 125 transition count 425
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 138 place count 125 transition count 418
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 144 place count 125 transition count 412
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 154 place count 119 transition count 408
Applied a total of 154 rules in 108 ms. Remains 119 /216 variables (removed 97) and now considering 408/829 (removed 421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 119/216 places, 408/829 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 670879 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{1=1}
Probabilistic random walk after 670879 steps, saw 388796 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :1
FORMULA UtahNoC-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-20 10:09:13] [INFO ] Flow matrix only has 224 transitions (discarded 184 similar events)
// Phase 1: matrix 224 rows 119 cols
[2023-03-20 10:09:13] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-20 10:09:13] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:09:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-20 10:09:13] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:09:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-20 10:09:13] [INFO ] After 39ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 10:09:13] [INFO ] After 79ms 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 10:09:13] [INFO ] After 216ms 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 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 408/408 transitions.
Graph (trivial) has 59 edges and 119 vertex of which 2 / 119 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 118 transition count 405
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 3 place count 117 transition count 405
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 117 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 116 transition count 399
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 114 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 114 transition count 391
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 114 transition count 389
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 114 transition count 388
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 113 transition count 387
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 113 transition count 386
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 23 place count 113 transition count 386
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 113 transition count 385
Applied a total of 24 rules in 69 ms. Remains 113 /119 variables (removed 6) and now considering 385/408 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 113/119 places, 385/408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 768159 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 768159 steps, saw 409526 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:09:17] [INFO ] Flow matrix only has 211 transitions (discarded 174 similar events)
// Phase 1: matrix 211 rows 113 cols
[2023-03-20 10:09:17] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-20 10:09:17] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:09:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 10:09:17] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:09:17] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 10:09:17] [INFO ] After 35ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 10:09:17] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 10:09:17] [INFO ] After 233ms 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 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 385/385 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 113/113 places, 385/385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 385/385 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2023-03-20 10:09:17] [INFO ] Flow matrix only has 211 transitions (discarded 174 similar events)
[2023-03-20 10:09:17] [INFO ] Invariant cache hit.
[2023-03-20 10:09:17] [INFO ] Implicit Places using invariants in 46 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/113 places, 385/385 transitions.
Graph (trivial) has 66 edges and 111 vertex of which 10 / 111 are part of one of the 4 SCC in 1 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 100 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 100 transition count 348
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 99 transition count 347
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 97 transition count 353
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 25 place count 97 transition count 345
Applied a total of 25 rules in 18 ms. Remains 97 /111 variables (removed 14) and now considering 345/385 (removed 40) transitions.
[2023-03-20 10:09:17] [INFO ] Flow matrix only has 192 transitions (discarded 153 similar events)
// Phase 1: matrix 192 rows 97 cols
[2023-03-20 10:09:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 10:09:17] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-20 10:09:17] [INFO ] Flow matrix only has 192 transitions (discarded 153 similar events)
[2023-03-20 10:09:17] [INFO ] Invariant cache hit.
[2023-03-20 10:09:17] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 10:09:17] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/113 places, 345/385 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 533 ms. Remains : 97/113 places, 345/385 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) 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 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1488772 steps, run timeout after 3011 ms. (steps per millisecond=494 ) properties seen :{0=1}
Probabilistic random walk after 1488772 steps, saw 771888 distinct states, run finished after 3011 ms. (steps per millisecond=494 ) properties seen :1
FORMULA UtahNoC-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-20 10:09:21] [INFO ] Flow matrix only has 192 transitions (discarded 153 similar events)
[2023-03-20 10:09:21] [INFO ] Invariant cache hit.
[2023-03-20 10:09:21] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:09:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 10:09:21] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:09:21] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 10:09:21] [INFO ] After 18ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:09:21] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 10:09:21] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 345/345 transitions.
Graph (trivial) has 75 edges and 97 vertex of which 21 / 97 are part of one of the 5 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 25 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 76 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 76 transition count 270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 76 transition count 264
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 76 transition count 261
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 73 transition count 256
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 73 transition count 258
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 72 transition count 257
Applied a total of 31 rules in 17 ms. Remains 72 /97 variables (removed 25) and now considering 257/345 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 72/97 places, 257/345 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 533992 steps, run visited all 1 properties in 863 ms. (steps per millisecond=618 )
Probabilistic random walk after 533992 steps, saw 267168 distinct states, run finished after 863 ms. (steps per millisecond=618 ) properties seen :1
FORMULA UtahNoC-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 13750 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running UtahNoC (PT), instance none
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 216 places, 977 transitions, 2905 arcs.
Final Score: 5692.78
Took : 33 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-00 (reachable & potential((! ( ( (tk(P75)) <= (tk(P2)) ) | ( ( (tk(P35)) <= ( 1 ) ) | ( ( ( ( 1 ) <= (tk(P102)) ) | ( (tk(P215)) <= ( 1 ) ) ) | ( ( ( (tk(P209)) <= ( 0 ) ) | ( ( ( ( ( 1 ) <= (tk(P3)) ) & ( (tk(P204)) <= (tk(P11)) ) ) | (! ( ( 1 ) <= (tk(P30)) )) ) & (! ( ( (tk(P128)) <= (tk(P36)) ) & ( ( 1 ) <= (tk(P50)) ) )) ) ) | ( ( 1 ) <= (tk(P81)) ) ) ) ) ))))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( ( 1 ) <= (tk(P172)) ) & ( ( (tk(P185)) <= ( 0 ) ) | ( ( ( (tk(P197)) <= ( 0 ) ) & (! ( (tk(P104)) <= ( 0 ) )) ) & (! ( (! ( ( ( 1 ) <= (tk(P47)) ) & ( ( 1 ) <= (tk(P168)) ) )) | ( (tk(P47)) <= (tk(P136)) ) )) ) ) ) | ( ( (tk(P144)) <= (tk(P46)) ) | ( (! ( ( 1 ) <= (tk(P73)) )) | ( (! ( ( (tk(P51)) <= ( 0 ) ) & ( ( ( ( 1 ) <= (tk(P97)) ) | ( ( 1 ) <= (tk(P76)) ) ) | ( ( 1 ) <= (tk(P56)) ) ) )) & (! ( ( ( ( (tk(P135)) <= ( 1 ) ) & ( (tk(P209)) <= ( 1 ) ) ) | ( ( (tk(P126)) <= ( 1 ) ) & ( (tk(P21)) <= (tk(P42)) ) ) ) & ( ( (tk(P107)) <= ( 0 ) ) & (! ( (tk(P54)) <= ( 0 ) )) ) )) ) ) ) ) | (! ( (! ( (tk(P110)) <= ( 1 ) )) | ( (tk(P36)) <= (tk(P204)) ) )) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-02 (reachable & potential(( ( ( (tk(P132)) <= ( 1 ) ) | (! ( (! ( ( (! ( ( (tk(P200)) <= ( 1 ) ) | ( (tk(P169)) <= ( 0 ) ) )) | ( (tk(P71)) <= (tk(P79)) ) ) & ( ( ( 1 ) <= (tk(P210)) ) | (! ( ( 1 ) <= (tk(P106)) )) ) )) & ( (tk(P143)) <= ( 0 ) ) )) ) & ( (! ( (! ( (tk(P67)) <= ( 1 ) )) & ( ( ( (tk(P74)) <= (tk(P129)) ) & ( (! ( (tk(P149)) <= ( 1 ) )) & ( (tk(P16)) <= (tk(P18)) ) ) ) | ( ( 1 ) <= (tk(P66)) ) ) )) & ( ( 1 ) <= (tk(P44)) ) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-03 (reachable & potential(( (! ( (tk(P111)) <= (tk(P205)) )) | (! ( (tk(P31)) <= ( 1 ) )) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( (! ( ( ( ( ( ( 1 ) <= (tk(P31)) ) | ( ( 1 ) <= (tk(P41)) ) ) & ( ( ( 1 ) <= (tk(P151)) ) & ( (tk(P130)) <= ( 0 ) ) ) ) & ( ( ( ( 1 ) <= (tk(P107)) ) | ( (tk(P35)) <= (tk(P201)) ) ) & ( ( ( 1 ) <= (tk(P59)) ) & ( (tk(P115)) <= ( 1 ) ) ) ) ) | ( (tk(P159)) <= (tk(P64)) ) )) | ( (tk(P205)) <= (tk(P157)) ) ) | (! ( ( ( ( 1 ) <= (tk(P176)) ) & ( (! ( ( (tk(P93)) <= (tk(P121)) ) & ( ( 1 ) <= (tk(P169)) ) )) | ( ( 1 ) <= (tk(P109)) ) ) ) | (! ( (! ( ( (tk(P215)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P146)) ) )) | (! ( ( (tk(P133)) <= (tk(P12)) ) | ( (tk(P174)) <= (tk(P153)) ) )) )) )) ) | ( (! ( ( 1 ) <= (tk(P53)) )) | (! ( (! ( ( ( ( ( 1 ) <= (tk(P150)) ) | ( (tk(P106)) <= ( 0 ) ) ) & ( ( (tk(P97)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P58)) ) ) ) & ( (! ( (tk(P77)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P38)) )) ) )) & (! ( (tk(P48)) <= (tk(P24)) )) )) ) ) | ( ( ( (tk(P35)) <= (tk(P198)) ) | ( ( ( ( 1 ) <= (tk(P76)) ) & (! ( ( ( ( (tk(P112)) <= ( 0 ) ) | ( (tk(P44)) <= (tk(P39)) ) ) & ( ( (tk(P166)) <= (tk(P185)) ) & ( (tk(P99)) <= (tk(P206)) ) ) ) & (! ( ( ( 1 ) <= (tk(P191)) ) & ( (tk(P52)) <= ( 0 ) ) )) )) ) | ( (tk(P125)) <= ( 0 ) ) ) ) & ( (tk(P180)) <= ( 1 ) ) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-05 (reachable & potential(( (! ( (tk(P185)) <= ( 1 ) )) | ( ( (tk(P3)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P108)) ) & ( ( 1 ) <= (tk(P81)) ) ) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-06 (reachable &!potential( ( (! ( (tk(P116)) <= ( 0 ) )) | ( (tk(P116)) <= ( 1 ) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-07 (reachable & potential((! ( ( ( (tk(P44)) <= (tk(P146)) ) & ( (tk(P116)) <= ( 1 ) ) ) & ( ( ( ( ( (! ( ( 1 ) <= (tk(P134)) )) & (! ( (tk(P176)) <= ( 1 ) )) ) & ( ( ( ( 1 ) <= (tk(P198)) ) | ( ( 1 ) <= (tk(P174)) ) ) | ( ( (tk(P171)) <= (tk(P208)) ) & ( (tk(P34)) <= (tk(P14)) ) ) ) ) | ( (tk(P32)) <= ( 0 ) ) ) | ( ( (! ( ( 1 ) <= (tk(P87)) )) | (! ( (tk(P23)) <= (tk(P163)) )) ) | ( (tk(P88)) <= (tk(P7)) ) ) ) | ( ( 1 ) <= (tk(P58)) ) ) ))))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P108)) <= ( 1 ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-09 (reachable &!potential( ( (! ( (! ( (! ( (! ( (tk(P205)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P59)) ) & ( (tk(P199)) <= ( 1 ) ) ) )) | ( ( ( ( (tk(P138)) <= (tk(P199)) ) | ( (tk(P148)) <= (tk(P94)) ) ) | ( (tk(P161)) <= (tk(P195)) ) ) | ( ( (tk(P202)) <= ( 0 ) ) & (! ( (tk(P97)) <= (tk(P202)) )) ) ) )) | ( ( (! ( ( ( 1 ) <= (tk(P33)) ) & ( (tk(P214)) <= (tk(P193)) ) )) | ( (! ( (tk(P210)) <= ( 0 ) )) & (! ( (tk(P109)) <= ( 1 ) )) ) ) & ( (tk(P50)) <= ( 0 ) ) ) )) | ( (tk(P120)) <= (tk(P110)) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-10 (reachable & potential(( ( 1 ) <= (tk(P76)) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-11 (reachable & potential(( ( 1 ) <= (tk(P93)) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-12 (reachable & potential((! ( (tk(P89)) <= ( 1 ) ))))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-13 (reachable &!potential( ( (! ( ( ( ( 1 ) <= (tk(P9)) ) & ( ( ( ( ( ( (tk(P204)) <= (tk(P119)) ) & ( (tk(P39)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P139)) ) & ( (tk(P152)) <= ( 0 ) ) ) ) & (! ( ( ( 1 ) <= (tk(P128)) ) | ( (tk(P97)) <= ( 0 ) ) )) ) & (! ( ( (tk(P52)) <= (tk(P141)) ) | ( ( 1 ) <= (tk(P134)) ) )) ) & ( (! ( (tk(P202)) <= (tk(P32)) )) & ( ( (! ( (tk(P187)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P80)) ) | ( (tk(P137)) <= ( 1 ) ) ) ) | (! ( ( (tk(P74)) <= ( 0 ) ) & ( (tk(P198)) <= ( 1 ) ) )) ) ) ) ) & ( ( ( (! ( ( (tk(P136)) <= (tk(P202)) ) & ( (tk(P38)) <= (tk(P181)) ) )) | ( ( (tk(P27)) <= (tk(P19)) ) | ( ( (tk(P117)) <= (tk(P45)) ) | (! ( ( 1 ) <= (tk(P169)) )) ) ) ) | ( (tk(P149)) <= ( 1 ) ) ) | ( ( ( ( (! ( (tk(P191)) <= ( 1 ) )) & ( (tk(P85)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P193)) ) & ( ( (tk(P124)) <= (tk(P207)) ) & ( (tk(P30)) <= ( 1 ) ) ) ) ) | (! ( (tk(P108)) <= ( 1 ) )) ) | (! ( ( 1 ) <= (tk(P182)) )) ) ) )) & ( (tk(P85)) <= ( 1 ) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-14 (reachable & potential(( ( (tk(P78)) <= (tk(P32)) ) & ( (! ( ( (tk(P103)) <= (tk(P182)) ) | ( (tk(P4)) <= ( 1 ) ) )) & ( (! ( (tk(P69)) <= ( 0 ) )) | ( (tk(P215)) <= (tk(P45)) ) ) ) )))
PROPERTY: UtahNoC-PT-none-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P195)) ) | (! ( ( (tk(P87)) <= (tk(P93)) ) & ( (tk(P75)) <= (tk(P166)) ) )) ) | (! ( ( 1 ) <= (tk(P120)) )) ) | ( ( ( (! ( (tk(P216)) <= ( 1 ) )) | ( ( (tk(P208)) <= ( 0 ) ) & ( (tk(P34)) <= ( 0 ) ) ) ) | ( ( 1 ) <= (tk(P31)) ) ) & (! ( (tk(P38)) <= (tk(P128)) )) ) ) & (! ( (tk(P107)) <= ( 0 ) )) ) | ( (tk(P176)) <= ( 0 ) ) ) | ( ( ( ( 1 ) <= (tk(P3)) ) & ( ( ( 1 ) <= (tk(P6)) ) & ( (! ( ( ( (tk(P4)) <= (tk(P154)) ) & ( (tk(P66)) <= ( 1 ) ) ) | (! ( (tk(P3)) <= (tk(P135)) )) )) | ( (tk(P212)) <= ( 0 ) ) ) ) ) & (! ( ( (tk(P17)) <= ( 0 ) ) & (! ( ( 1 ) <= (tk(P129)) )) )) ) ) | ( ( ( ( ( ( ( ( 1 ) <= (tk(P208)) ) & (! ( ( (tk(P179)) <= (tk(P96)) ) & ( ( 1 ) <= (tk(P20)) ) )) ) & ( (! ( ( (tk(P94)) <= ( 0 ) ) & ( (tk(P77)) <= ( 0 ) ) )) & ( ( ( (tk(P91)) <= ( 0 ) ) | ( (tk(P159)) <= ( 1 ) ) ) & ( (tk(P175)) <= (tk(P175)) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P67)) ) & ( ( ( 1 ) <= (tk(P151)) ) | ( ( 1 ) <= (tk(P34)) ) ) ) & ( (tk(P86)) <= (tk(P205)) ) ) | ( ( (! ( (tk(P180)) <= ( 0 ) )) | ( (tk(P152)) <= ( 0 ) ) ) & (! ( (tk(P165)) <= ( 1 ) )) ) ) ) & ( ( (tk(P190)) <= (tk(P141)) ) | ( ( (! ( (tk(P63)) <= (tk(P154)) )) & ( (tk(P2)) <= (tk(P151)) ) ) & ( ( ( ( ( 1 ) <= (tk(P52)) ) | ( ( 1 ) <= (tk(P49)) ) ) | (! ( ( 1 ) <= (tk(P145)) )) ) | ( ( ( 1 ) <= (tk(P21)) ) | ( (tk(P160)) <= (tk(P34)) ) ) ) ) ) ) & (! ( ( ( (tk(P157)) <= ( 1 ) ) | (! ( (tk(P87)) <= ( 0 ) )) ) & ( ( ( (! ( ( 1 ) <= (tk(P118)) )) & ( ( (tk(P151)) <= (tk(P67)) ) & ( ( 1 ) <= (tk(P197)) ) ) ) & ( ( ( (tk(P156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P127)) ) ) & ( ( (tk(P7)) <= (tk(P8)) ) & ( (tk(P5)) <= (tk(P151)) ) ) ) ) & ( (tk(P10)) <= ( 0 ) ) ) )) ) | ( ( ( 1 ) <= (tk(P215)) ) | ( ( 1 ) <= (tk(P202)) ) ) ) )))
FORMULA UtahNoC-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA UtahNoC-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679307025289

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="smartxred"
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 smartxred"
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 r491-tall-167912711200950"
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 ;