About the Execution of Smart+red for NoC3x3-PT-8B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1474.056 | 3600000.00 | 3663877.00 | 8503.30 | TTTTFTTFFFFFTTTF | 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.r267-smll-167863541700350.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 NoC3x3-PT-8B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541700350
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 09:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678865360659
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=NoC3x3-PT-8B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 07:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 07:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:29:23] [INFO ] Load time of PNML (sax parser for PT used): 690 ms
[2023-03-15 07:29:23] [INFO ] Transformed 9140 places.
[2023-03-15 07:29:24] [INFO ] Transformed 14577 transitions.
[2023-03-15 07:29:24] [INFO ] Found NUPN structural information;
[2023-03-15 07:29:24] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 963 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 13) seen :5
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 14577 rows 9140 cols
[2023-03-15 07:29:26] [INFO ] Computed 99 place invariants in 240 ms
[2023-03-15 07:29:31] [INFO ] [Real]Absence check using 99 positive place invariants in 228 ms returned sat
[2023-03-15 07:29:31] [INFO ] After 5661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 07:29:36] [INFO ] [Nat]Absence check using 99 positive place invariants in 237 ms returned sat
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-15 07:29:57] [INFO ] After 18993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 07:29:57] [INFO ] After 19033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 07:29:57] [INFO ] After 25241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 736 ms.
Support contains 50 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13556 edges and 9140 vertex of which 2347 / 9140 are part of one of the 31 SCC in 64 ms
Free SCC test removed 2316 places
Drop transitions removed 3686 transitions
Reduce isomorphic transitions removed 3686 transitions.
Graph (complete) has 12368 edges and 6824 vertex of which 6712 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.37 ms
Discarding 112 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 4139 transitions
Trivial Post-agglo rules discarded 4139 transitions
Performed 4139 trivial Post agglomeration. Transition count delta: 4139
Iterating post reduction 0 with 4241 rules applied. Total rules applied 4243 place count 6712 transition count 6571
Reduce places removed 4139 places and 0 transitions.
Ensure Unique test removed 2323 transitions
Reduce isomorphic transitions removed 2323 transitions.
Drop transitions removed 1124 transitions
Trivial Post-agglo rules discarded 1124 transitions
Performed 1124 trivial Post agglomeration. Transition count delta: 1124
Iterating post reduction 1 with 7586 rules applied. Total rules applied 11829 place count 2573 transition count 3124
Reduce places removed 1124 places and 0 transitions.
Ensure Unique test removed 1124 transitions
Reduce isomorphic transitions removed 1124 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 2268 rules applied. Total rules applied 14097 place count 1449 transition count 1980
Reduce places removed 20 places and 0 transitions.
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Iterating post reduction 3 with 130 rules applied. Total rules applied 14227 place count 1429 transition count 1870
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 4 with 200 rules applied. Total rules applied 14427 place count 1319 transition count 1780
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 14427 place count 1319 transition count 1732
Deduced a syphon composed of 48 places in 21 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 14523 place count 1271 transition count 1732
Discarding 355 places :
Symmetric choice reduction at 5 with 355 rule applications. Total rules 14878 place count 916 transition count 1377
Iterating global reduction 5 with 355 rules applied. Total rules applied 15233 place count 916 transition count 1377
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 15286 place count 916 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 60 Pre rules applied. Total rules applied 15286 place count 916 transition count 1264
Deduced a syphon composed of 60 places in 11 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 15406 place count 856 transition count 1264
Discarding 81 places :
Symmetric choice reduction at 6 with 81 rule applications. Total rules 15487 place count 775 transition count 1090
Iterating global reduction 6 with 81 rules applied. Total rules applied 15568 place count 775 transition count 1090
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 15593 place count 775 transition count 1065
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 243
Deduced a syphon composed of 243 places in 1 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 7 with 486 rules applied. Total rules applied 16079 place count 532 transition count 822
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 16102 place count 532 transition count 799
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 16104 place count 531 transition count 808
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 16138 place count 531 transition count 774
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 16140 place count 530 transition count 788
Free-agglomeration rule applied 219 times.
Iterating global reduction 8 with 219 rules applied. Total rules applied 16359 place count 530 transition count 569
Reduce places removed 219 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 904 edges and 311 vertex of which 304 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 232 rules applied. Total rules applied 16591 place count 304 transition count 557
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 16598 place count 304 transition count 550
Drop transitions removed 161 transitions
Redundant transition composition rules discarded 161 transitions
Iterating global reduction 10 with 161 rules applied. Total rules applied 16759 place count 304 transition count 389
Reduce places removed 9 places and 0 transitions.
Graph (complete) has 730 edges and 295 vertex of which 275 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 10 rules applied. Total rules applied 16769 place count 275 transition count 389
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 16789 place count 275 transition count 369
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 12 with 23 rules applied. Total rules applied 16812 place count 275 transition count 369
Applied a total of 16812 rules in 1252 ms. Remains 275 /9140 variables (removed 8865) and now considering 369/14577 (removed 14208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 275/9140 places, 369/14577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 6) seen :4
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 369 rows 275 cols
[2023-03-15 07:29:59] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-15 07:29:59] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:29:59] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 07:29:59] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:29:59] [INFO ] State equation strengthened by 162 read => feed constraints.
[2023-03-15 07:29:59] [INFO ] After 83ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:30:00] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-15 07:30:00] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 369/369 transitions.
Graph (trivial) has 79 edges and 275 vertex of which 9 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 270 transition count 336
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 246 transition count 331
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 54 place count 246 transition count 328
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 243 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 239 transition count 319
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 239 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 239 transition count 315
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 227 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 227 transition count 302
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 108 place count 227 transition count 291
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 227 transition count 288
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 115 place count 224 transition count 287
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 119 place count 224 transition count 287
Applied a total of 119 rules in 81 ms. Remains 224 /275 variables (removed 51) and now considering 287/369 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 224/275 places, 287/369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 6338 steps, including 1 resets, run visited all 1 properties in 16 ms. (steps per millisecond=396 )
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 37124 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 8B
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: 9140 places, 14577 transitions, 30726 arcs.
Final Score: 4872255.754
Took : 117 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-00 (reachable & potential((! ( ( (tk(P241)) <= (tk(P3481)) ) & (! ( ( 1 ) <= (tk(P6213)) )) ))))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-01 (reachable & potential(( ( 1 ) <= (tk(P8919)) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-02 (reachable & potential(( ( 1 ) <= (tk(P6108)) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-03 (reachable & potential(( (! ( (tk(P8066)) <= (tk(P5303)) )) & ( ( ( (tk(P4595)) <= ( 0 ) ) & ( (tk(P4813)) <= ( 0 ) ) ) & ( ( ( ( (tk(P8129)) <= ( 0 ) ) & ( (! ( ( ( 1 ) <= (tk(P7526)) ) & ( (tk(P327)) <= (tk(P2314)) ) )) & ( (tk(P6253)) <= (tk(P4314)) ) ) ) & ( (! ( ( ( ( 1 ) <= (tk(P3602)) ) & ( (tk(P4748)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P6841)) ) )) & ( ( ( ( 1 ) <= (tk(P4711)) ) & (! ( (tk(P6098)) <= ( 0 ) )) ) & (! ( ( ( 1 ) <= (tk(P2646)) ) & ( (tk(P1991)) <= ( 0 ) ) )) ) ) ) & ( (tk(P8380)) <= (tk(P7078)) ) ) ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P5598)) <= ( 0 ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P8156)) <= ( 1 ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-06 (reachable & potential((! ( (tk(P4370)) <= (tk(P6674)) ))))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P3405)) <= ( 0 ) ) & ( ( (tk(P8211)) <= (tk(P277)) ) | ( ( ( (! ( (tk(P5035)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P5928)) ) & (! ( ( ( (tk(P6701)) <= (tk(P1860)) ) & ( (tk(P3114)) <= (tk(P1843)) ) ) | (! ( (tk(P8346)) <= ( 0 ) )) )) ) ) | ( (! ( ( (! ( ( 1 ) <= (tk(P7903)) )) | ( (tk(P4212)) <= ( 0 ) ) ) & ( ( ( (tk(P6232)) <= ( 1 ) ) | ( (tk(P3308)) <= ( 1 ) ) ) & ( (tk(P2043)) <= ( 1 ) ) ) )) & ( ( (tk(P4791)) <= (tk(P1663)) ) | (! ( ( ( (tk(P6564)) <= (tk(P8722)) ) & ( (tk(P6042)) <= (tk(P5866)) ) ) & ( ( 1 ) <= (tk(P3034)) ) )) ) ) ) & ( (tk(P4301)) <= (tk(P7420)) ) ) ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-08 (reachable & potential(( ( ( ( ( (! ( ( ( ( ( 1 ) <= (tk(P884)) ) | ( (tk(P3716)) <= (tk(P116)) ) ) | ( ( (tk(P2814)) <= (tk(P2405)) ) & ( ( 1 ) <= (tk(P3253)) ) ) ) & ( ( ( 1 ) <= (tk(P5087)) ) & ( ( (tk(P8966)) <= ( 0 ) ) | ( (tk(P7255)) <= (tk(P6496)) ) ) ) )) | ( ( 1 ) <= (tk(P2125)) ) ) & ( (tk(P5839)) <= ( 0 ) ) ) & ( ( ( ( 1 ) <= (tk(P4054)) ) & ( ( (tk(P2787)) <= (tk(P8201)) ) & ( ( 1 ) <= (tk(P4137)) ) ) ) | (! ( ( ( ( ( 1 ) <= (tk(P4037)) ) & ( (tk(P4406)) <= (tk(P24)) ) ) & ( ( (tk(P5282)) <= (tk(P7230)) ) | (! ( (tk(P2070)) <= ( 1 ) )) ) ) | ( (tk(P6469)) <= ( 1 ) ) )) ) ) & ( ( (! ( (tk(P6372)) <= (tk(P7771)) )) & ( ( ( (tk(P124)) <= (tk(P4668)) ) | ( (! ( ( 1 ) <= (tk(P4900)) )) & ( ( ( (tk(P4190)) <= (tk(P346)) ) & ( ( 1 ) <= (tk(P3787)) ) ) & ( ( 1 ) <= (tk(P1884)) ) ) ) ) & (! ( (tk(P8254)) <= ( 1 ) )) ) ) & ( ( 1 ) <= (tk(P2645)) ) ) ) & ( ( ( ( (tk(P5166)) <= ( 0 ) ) | ( ( ( ( ( ( ( 1 ) <= (tk(P8181)) ) | ( ( 1 ) <= (tk(P5515)) ) ) | (! ( ( 1 ) <= (tk(P8219)) )) ) | ( (tk(P3794)) <= ( 0 ) ) ) | ( (! ( ( (tk(P6035)) <= ( 1 ) ) | ( (tk(P7730)) <= (tk(P7297)) ) )) | ( (tk(P224)) <= ( 0 ) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P3724)) ) | ( ( 1 ) <= (tk(P1801)) ) ) | ( ( ( 1 ) <= (tk(P6313)) ) & ( (tk(P539)) <= ( 1 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P7134)) )) & ( (tk(P1233)) <= (tk(P2295)) ) ) ) | ( ( ( 1 ) <= (tk(P5775)) ) & ( ( ( (tk(P7754)) <= (tk(P833)) ) & ( (tk(P725)) <= (tk(P2002)) ) ) & (! ( ( 1 ) <= (tk(P4173)) )) ) ) ) ) ) & (! ( (! ( ( ( (tk(P1090)) <= ( 0 ) ) & ( (tk(P1832)) <= ( 0 ) ) ) & ( ( (tk(P5440)) <= ( 0 ) ) | ( (tk(P1109)) <= ( 0 ) ) ) )) | (! ( ( 1 ) <= (tk(P1213)) )) )) ) & ( (tk(P3827)) <= ( 1 ) ) ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-09 (reachable &!potential( ( ( (tk(P4747)) <= (tk(P617)) ) & ( (tk(P4797)) <= (tk(P810)) ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( (tk(P1150)) <= (tk(P1680)) ) & (! ( ( ( ( (tk(P9053)) <= ( 0 ) ) | (! ( ( (tk(P3110)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P241)) ) )) ) | (! ( ( (tk(P8619)) <= ( 1 ) ) | ( (tk(P3731)) <= (tk(P194)) ) )) ) & (! ( ( 1 ) <= (tk(P9057)) )) )) ) | ( ( ( 1 ) <= (tk(P4322)) ) & ( (tk(P5547)) <= (tk(P550)) ) ) ) | ( ( (tk(P2297)) <= (tk(P4364)) ) | ( (tk(P4808)) <= ( 0 ) ) ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-11 (reachable &!potential( ( ( ( ( ( (! ( (tk(P579)) <= ( 1 ) )) | ( ( (tk(P2979)) <= (tk(P7045)) ) | (! ( ( ( ( 1 ) <= (tk(P6719)) ) | ( (tk(P3339)) <= (tk(P8311)) ) ) | ( ( (tk(P3464)) <= (tk(P8597)) ) | ( (tk(P1848)) <= (tk(P1874)) ) ) )) ) ) & ( ( ( ( ( 1 ) <= (tk(P8401)) ) & ( ( ( 1 ) <= (tk(P3741)) ) | ( ( (tk(P1763)) <= (tk(P3471)) ) | ( (tk(P6181)) <= (tk(P6121)) ) ) ) ) & (! ( ( ( ( 1 ) <= (tk(P1855)) ) | ( ( 1 ) <= (tk(P8855)) ) ) | ( ( (tk(P4182)) <= ( 0 ) ) | ( (tk(P3576)) <= ( 1 ) ) ) )) ) | (! ( ( 1 ) <= (tk(P6342)) )) ) ) & ( ( (! ( ( (tk(P8654)) <= ( 1 ) ) | ( ( (tk(P4167)) <= ( 0 ) ) & ( ( (tk(P1945)) <= (tk(P5012)) ) & ( (tk(P8588)) <= (tk(P142)) ) ) ) )) & ( ( 1 ) <= (tk(P6051)) ) ) | ( ( ( (tk(P4332)) <= (tk(P662)) ) & (! ( ( (tk(P6204)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P483)) ) )) ) | ( (tk(P8103)) <= ( 0 ) ) ) ) ) | ( ( (tk(P8219)) <= (tk(P3918)) ) | ( ( ( (tk(P1382)) <= ( 0 ) ) & ( (tk(P2630)) <= (tk(P1247)) ) ) & ( (tk(P1590)) <= ( 1 ) ) ) ) ) & ( (tk(P6415)) <= (tk(P7615)) ) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-12 (reachable & potential(( ( 1 ) <= (tk(P6527)) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P4411)) )))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-14 (reachable & potential((! ( ( ( ( ( (tk(P3793)) <= (tk(P7313)) ) | (! ( ( ( (tk(P2936)) <= (tk(P1632)) ) & ( ( ( 1 ) <= (tk(P7348)) ) | ( (tk(P7465)) <= ( 0 ) ) ) ) & ( (tk(P4754)) <= ( 0 ) ) )) ) | (! ( ( ( 1 ) <= (tk(P4676)) ) & ( ( 1 ) <= (tk(P6845)) ) )) ) & (! ( ( ( ( ( 1 ) <= (tk(P623)) ) | (! ( ( (tk(P5401)) <= ( 0 ) ) | ( (tk(P4950)) <= ( 1 ) ) )) ) & ( ( ( 1 ) <= (tk(P4011)) ) & ( ( ( ( 1 ) <= (tk(P3115)) ) & ( (tk(P7684)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P1968)) ) | ( (tk(P2238)) <= (tk(P7583)) ) ) ) ) ) & ( ( (tk(P4301)) <= (tk(P5076)) ) | ( (tk(P1622)) <= ( 1 ) ) ) )) ) | (! ( ( ( (tk(P4144)) <= ( 1 ) ) | (! ( (! ( ( 1 ) <= (tk(P2101)) )) | (! ( (tk(P1466)) <= (tk(P1166)) )) )) ) & ( (tk(P3637)) <= ( 0 ) ) )) ))))
PROPERTY: NoC3x3-PT-8B-ReachabilityCardinality-15 (reachable & potential((! ( ( (tk(P1097)) <= (tk(P1338)) ) | ( (! ( (! ( (tk(P1044)) <= ( 1 ) )) & ( ( 1 ) <= (tk(P8918)) ) )) | (! ( ( ( ( (tk(P4929)) <= (tk(P1092)) ) | ( ( ( ( 1 ) <= (tk(P2811)) ) | ( (tk(P7255)) <= (tk(P6537)) ) ) | ( ( 1 ) <= (tk(P7692)) ) ) ) | ( (! ( (tk(P4839)) <= ( 1 ) )) & (! ( (tk(P3826)) <= ( 0 ) )) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P1415)) )) | ( ( (tk(P8199)) <= (tk(P3900)) ) | ( (tk(P8683)) <= ( 1 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P6222)) )) & (! ( (tk(P11)) <= ( 1 ) )) ) ) & ( ( (tk(P9049)) <= ( 1 ) ) & (! ( (tk(P35)) <= (tk(P4408)) )) ) ) )) ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14674864 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102208 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="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 NoC3x3-PT-8B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863541700350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;