About the Execution of Smart+red for ShieldRVt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1267.983 | 24103.00 | 40982.00 | 75.30 | FTTTFFTTF?TFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979400271.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979400271
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 119K 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 ShieldRVt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679383557527
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:25:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 07:25:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:25:59] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-21 07:25:59] [INFO ] Transformed 503 places.
[2023-03-21 07:25:59] [INFO ] Transformed 503 transitions.
[2023-03-21 07:25:59] [INFO ] Found NUPN structural information;
[2023-03-21 07:25:59] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 16) seen :12
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) 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 4) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 503 rows 503 cols
[2023-03-21 07:25:59] [INFO ] Computed 41 place invariants in 25 ms
[2023-03-21 07:26:00] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 07:26:00] [INFO ] [Nat]Absence check using 41 positive place invariants in 30 ms returned sat
[2023-03-21 07:26:00] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 7 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-03-21 07:26:01] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2023-03-21 07:26:02] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 0 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:26:03] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2023-03-21 07:26:04] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-03-21 07:26:04] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2023-03-21 07:26:04] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2023-03-21 07:26:04] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2023-03-21 07:26:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-21 07:26:04] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3783 ms
[2023-03-21 07:26:04] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 4 ms to minimize.
[2023-03-21 07:26:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-21 07:26:06] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2023-03-21 07:26:06] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2023-03-21 07:26:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1502 ms
[2023-03-21 07:26:06] [INFO ] After 5941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-21 07:26:06] [INFO ] After 6331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 67 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 503 transition count 397
Reduce places removed 106 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 136 rules applied. Total rules applied 242 place count 397 transition count 367
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 272 place count 367 transition count 367
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 272 place count 367 transition count 336
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 334 place count 336 transition count 336
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 381 place count 289 transition count 289
Iterating global reduction 3 with 47 rules applied. Total rules applied 428 place count 289 transition count 289
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 428 place count 289 transition count 276
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 454 place count 276 transition count 276
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 600 place count 203 transition count 203
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 630 place count 188 transition count 208
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 633 place count 188 transition count 205
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 636 place count 185 transition count 205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 637 place count 185 transition count 204
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 638 place count 185 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 639 place count 184 transition count 203
Applied a total of 639 rules in 125 ms. Remains 184 /503 variables (removed 319) and now considering 203/503 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 184/503 places, 203/503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 1088093 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{0=1}
Probabilistic random walk after 1088093 steps, saw 592870 distinct states, run finished after 3002 ms. (steps per millisecond=362 ) properties seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 203 rows 184 cols
[2023-03-21 07:26:09] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-21 07:26:09] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:26:09] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-21 07:26:10] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-21 07:26:10] [INFO ] After 97ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:10] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-21 07:26:10] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-21 07:26:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-21 07:26:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-21 07:26:10] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-21 07:26:10] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2023-03-21 07:26:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 326 ms
[2023-03-21 07:26:10] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-21 07:26:10] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 203/203 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 184 transition count 197
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 8 rules applied. Total rules applied 14 place count 178 transition count 195
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 177 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 176 transition count 194
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 17 place count 176 transition count 187
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 31 place count 169 transition count 187
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 34 place count 166 transition count 184
Iterating global reduction 4 with 3 rules applied. Total rules applied 37 place count 166 transition count 184
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 76 place count 146 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 86 place count 141 transition count 168
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 141 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 141 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 140 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 91 place count 138 transition count 164
Applied a total of 91 rules in 56 ms. Remains 138 /184 variables (removed 46) and now considering 164/203 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 138/184 places, 164/203 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 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1461827 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :{}
Probabilistic random walk after 1461827 steps, saw 973032 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 164 rows 138 cols
[2023-03-21 07:26:13] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-21 07:26:13] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:26:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2023-03-21 07:26:13] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-21 07:26:13] [INFO ] After 47ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:13] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-21 07:26:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2023-03-21 07:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-21 07:26:14] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-21 07:26:14] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 36 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 164/164 transitions.
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 138/138 places, 164/164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 164/164 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2023-03-21 07:26:14] [INFO ] Invariant cache hit.
[2023-03-21 07:26:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-21 07:26:14] [INFO ] Invariant cache hit.
[2023-03-21 07:26:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-21 07:26:14] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-21 07:26:14] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 07:26:14] [INFO ] Invariant cache hit.
[2023-03-21 07:26:14] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 138/138 places, 164/164 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 138 transition count 158
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 138 transition count 158
Applied a total of 11 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 158/164 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 158 rows 138 cols
[2023-03-21 07:26:14] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-21 07:26:14] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:26:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-21 07:26:14] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 07:26:14] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:14] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-21 07:26:14] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:26:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-21 07:26:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 164 transitions and 672 arcs took 3 ms.
[2023-03-21 07:26:14] [INFO ] Flatten gal took : 45 ms
Total runtime 15816 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 010B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 138 places, 164 transitions, 672 arcs.
Final Score: 1547.641
Took : 6 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679383581630
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 992:
syntax error
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="ShieldRVt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r427-tajo-167905979400271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;