About the Execution of Smart+red for ShieldIIPs-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1140.191 | 110555.00 | 150640.00 | 45.80 | ??F?T?F??TTTFTFT | 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.r395-oct2-167903718400119.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400119
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 253K 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 ShieldIIPs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679556493350
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=ShieldIIPs-PT-030A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:28:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:28:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:28:16] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-23 07:28:16] [INFO ] Transformed 753 places.
[2023-03-23 07:28:16] [INFO ] Transformed 723 transitions.
[2023-03-23 07:28:16] [INFO ] Found NUPN structural information;
[2023-03-23 07:28:16] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 16) seen :9
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-23 07:28:17] [INFO ] Computed 271 place invariants in 23 ms
[2023-03-23 07:28:18] [INFO ] After 673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 07:28:19] [INFO ] [Nat]Absence check using 271 positive place invariants in 88 ms returned sat
[2023-03-23 07:28:21] [INFO ] After 2677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 07:28:22] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 5 ms to minimize.
[2023-03-23 07:28:22] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 1 ms to minimize.
[2023-03-23 07:28:22] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2023-03-23 07:28:23] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 0 ms to minimize.
[2023-03-23 07:28:23] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-23 07:28:23] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2023-03-23 07:28:23] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-23 07:28:23] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-23 07:28:23] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-23 07:28:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1838 ms
[2023-03-23 07:28:24] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-23 07:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-23 07:28:24] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 26 ms to minimize.
[2023-03-23 07:28:26] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2023-03-23 07:28:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 730 ms
[2023-03-23 07:28:26] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 0 ms to minimize.
[2023-03-23 07:28:26] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-23 07:28:27] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-23 07:28:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2023-03-23 07:28:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 707 ms
[2023-03-23 07:28:27] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 3 ms to minimize.
[2023-03-23 07:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-23 07:28:28] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:28:28] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2023-03-23 07:28:28] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-23 07:28:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 531 ms
[2023-03-23 07:28:28] [INFO ] After 9627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2441 ms.
[2023-03-23 07:28:31] [INFO ] After 12589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 729 ms.
Support contains 250 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 753 transition count 722
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 0 with 93 rules applied. Total rules applied 95 place count 752 transition count 722
Applied a total of 95 rules in 91 ms. Remains 752 /753 variables (removed 1) and now considering 722/723 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 752/753 places, 722/723 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 7) seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 722 rows 752 cols
[2023-03-23 07:28:32] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-23 07:28:33] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:28:33] [INFO ] [Nat]Absence check using 271 positive place invariants in 128 ms returned sat
[2023-03-23 07:28:35] [INFO ] After 2217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 07:28:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:28:37] [INFO ] After 1535ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 20 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 0 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2850 ms
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-23 07:28:40] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2023-03-23 07:28:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2023-03-23 07:28:41] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-23 07:28:41] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-03-23 07:28:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 805 ms
[2023-03-23 07:28:41] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2023-03-23 07:28:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2023-03-23 07:28:42] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-23 07:28:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 636 ms
[2023-03-23 07:28:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2023-03-23 07:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-23 07:28:43] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:28:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-23 07:28:43] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 16 ms to minimize.
[2023-03-23 07:28:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 497 ms
[2023-03-23 07:28:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-23 07:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-23 07:28:44] [INFO ] After 8366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2284 ms.
[2023-03-23 07:28:46] [INFO ] After 13382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 485 ms.
Support contains 190 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 722/722 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 751 transition count 721
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 751 transition count 721
Applied a total of 20 rules in 59 ms. Remains 751 /752 variables (removed 1) and now considering 721/722 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 751/752 places, 721/722 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 108028 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 108028 steps, saw 57022 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-23 07:28:50] [INFO ] Computed 271 place invariants in 5 ms
[2023-03-23 07:28:50] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:28:51] [INFO ] [Nat]Absence check using 271 positive place invariants in 76 ms returned sat
[2023-03-23 07:28:53] [INFO ] After 2056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 07:28:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:28:54] [INFO ] After 1490ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 07:28:55] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-23 07:28:55] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2023-03-23 07:28:55] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2023-03-23 07:28:55] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-23 07:28:56] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 4 ms to minimize.
[2023-03-23 07:28:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-23 07:28:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1117 ms
[2023-03-23 07:28:56] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:28:56] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-23 07:28:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-03-23 07:28:57] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2023-03-23 07:28:57] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2023-03-23 07:28:57] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 13 ms to minimize.
[2023-03-23 07:28:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 741 ms
[2023-03-23 07:28:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-23 07:28:58] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-23 07:28:58] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-23 07:28:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
[2023-03-23 07:28:58] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-23 07:28:59] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-23 07:28:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:28:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2023-03-23 07:28:59] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2023-03-23 07:28:59] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:29:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-23 07:29:00] [INFO ] After 6576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1365 ms.
[2023-03-23 07:29:01] [INFO ] After 10465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 467 ms.
Support contains 190 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-23 07:29:01] [INFO ] Invariant cache hit.
[2023-03-23 07:29:02] [INFO ] Implicit Places using invariants in 691 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 706 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 734 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 102940 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102940 steps, saw 56062 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-23 07:29:06] [INFO ] Computed 270 place invariants in 4 ms
[2023-03-23 07:29:06] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:29:06] [INFO ] [Nat]Absence check using 270 positive place invariants in 39 ms returned sat
[2023-03-23 07:29:09] [INFO ] After 2490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 07:29:09] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-23 07:29:09] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2023-03-23 07:29:09] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2023-03-23 07:29:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-23 07:29:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2023-03-23 07:29:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-03-23 07:29:10] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-23 07:29:10] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2023-03-23 07:29:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
[2023-03-23 07:29:11] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:29:11] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-23 07:29:11] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:29:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2023-03-23 07:29:11] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:29:11] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-23 07:29:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2023-03-23 07:29:12] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-23 07:29:12] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:29:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-23 07:29:12] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-23 07:29:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1173 ms
[2023-03-23 07:29:13] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-23 07:29:13] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-23 07:29:13] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-23 07:29:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 517 ms
[2023-03-23 07:29:14] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-03-23 07:29:14] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-23 07:29:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2023-03-23 07:29:14] [INFO ] After 7466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1528 ms.
[2023-03-23 07:29:15] [INFO ] After 9352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 390 ms.
Support contains 190 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 15 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-23 07:29:16] [INFO ] Invariant cache hit.
[2023-03-23 07:29:16] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-23 07:29:16] [INFO ] Invariant cache hit.
[2023-03-23 07:29:17] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2023-03-23 07:29:18] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-23 07:29:18] [INFO ] Invariant cache hit.
[2023-03-23 07:29:18] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2225 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 50 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-23 07:29:18] [INFO ] Invariant cache hit.
[2023-03-23 07:29:19] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:29:19] [INFO ] [Nat]Absence check using 270 positive place invariants in 74 ms returned sat
[2023-03-23 07:29:21] [INFO ] After 2026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 07:29:21] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:29:21] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 26 ms to minimize.
[2023-03-23 07:29:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-03-23 07:29:22] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:29:22] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:29:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2023-03-23 07:29:22] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2023-03-23 07:29:22] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-23 07:29:23] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-23 07:29:23] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-23 07:29:23] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-23 07:29:23] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-23 07:29:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1013 ms
[2023-03-23 07:29:24] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-23 07:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-23 07:29:24] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 1 ms to minimize.
[2023-03-23 07:29:24] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2023-03-23 07:29:25] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-23 07:29:25] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2023-03-23 07:29:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 871 ms
[2023-03-23 07:29:25] [INFO ] After 6301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1621 ms.
[2023-03-23 07:29:27] [INFO ] After 8311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-23 07:29:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-23 07:29:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3473 arcs took 22 ms.
[2023-03-23 07:29:27] [INFO ] Flatten gal took : 126 ms
Total runtime 71273 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 030A
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: 750 places, 721 transitions, 3473 arcs.
Final Score: 77216.048
Took : 35 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679556603905
--------------------
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 4951:
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="ShieldIIPs-PT-030A"
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 ShieldIIPs-PT-030A, 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 r395-oct2-167903718400119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030A.tgz
mv ShieldIIPs-PT-030A 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 ;