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.r425-tajo-167905978000286.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 ltsminxred
Input is ShieldRVt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 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.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 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 239K 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-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679306645874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:04:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 10:04:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:04:08] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-20 10:04:08] [INFO ] Transformed 1003 places.
[2023-03-20 10:04:08] [INFO ] Transformed 1003 transitions.
[2023-03-20 10:04:08] [INFO ] Found NUPN structural information;
[2023-03-20 10:04:08] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 14) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-20 10:04:08] [INFO ] Computed 81 place invariants in 18 ms
[2023-03-20 10:04:09] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:04:10] [INFO ] [Nat]Absence check using 81 positive place invariants in 117 ms returned sat
[2023-03-20 10:04:10] [INFO ] After 735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:04:11] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 7 ms to minimize.
[2023-03-20 10:04:11] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 2 ms to minimize.
[2023-03-20 10:04:12] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 1 ms to minimize.
[2023-03-20 10:04:12] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 2 ms to minimize.
[2023-03-20 10:04:12] [INFO ] Deduced a trap composed of 41 places in 371 ms of which 2 ms to minimize.
[2023-03-20 10:04:13] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-20 10:04:13] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 1 ms to minimize.
[2023-03-20 10:04:13] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2023-03-20 10:04:14] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 3 ms to minimize.
[2023-03-20 10:04:14] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 1 ms to minimize.
[2023-03-20 10:04:14] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 1 ms to minimize.
[2023-03-20 10:04:14] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2023-03-20 10:04:14] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 0 ms to minimize.
[2023-03-20 10:04:15] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2023-03-20 10:04:15] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 0 ms to minimize.
[2023-03-20 10:04:15] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 0 ms to minimize.
[2023-03-20 10:04:15] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2023-03-20 10:04:15] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2023-03-20 10:04:15] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2023-03-20 10:04:16] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2023-03-20 10:04:16] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2023-03-20 10:04:16] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2023-03-20 10:04:16] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2023-03-20 10:04:16] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 0 ms to minimize.
[2023-03-20 10:04:16] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5745 ms
[2023-03-20 10:04:17] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 0 ms to minimize.
[2023-03-20 10:04:17] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 0 ms to minimize.
[2023-03-20 10:04:17] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
[2023-03-20 10:04:18] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-20 10:04:18] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 0 ms to minimize.
[2023-03-20 10:04:18] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2023-03-20 10:04:18] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 0 ms to minimize.
[2023-03-20 10:04:18] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2023-03-20 10:04:19] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 1 ms to minimize.
[2023-03-20 10:04:19] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2023-03-20 10:04:19] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 5 ms to minimize.
[2023-03-20 10:04:19] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2023-03-20 10:04:20] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 1 ms to minimize.
[2023-03-20 10:04:20] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 1 ms to minimize.
[2023-03-20 10:04:20] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2023-03-20 10:04:20] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 2 ms to minimize.
[2023-03-20 10:04:21] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2023-03-20 10:04:21] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 2 ms to minimize.
[2023-03-20 10:04:21] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 1 ms to minimize.
[2023-03-20 10:04:21] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 1 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 1 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 0 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 1 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 18 ms to minimize.
[2023-03-20 10:04:23] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2023-03-20 10:04:23] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2023-03-20 10:04:23] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 2 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 1 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 0 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 0 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 1 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 8 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 0 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 0 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 1 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 8 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 10785 ms
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 0 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 0 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1451 ms
[2023-03-20 10:04:29] [INFO ] After 19281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 545 ms.
[2023-03-20 10:04:30] [INFO ] After 20553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 152 ms.
Support contains 68 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 263 place count 1003 transition count 740
Reduce places removed 263 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 265 rules applied. Total rules applied 528 place count 740 transition count 738
Reduce places removed 1 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 20 rules applied. Total rules applied 548 place count 739 transition count 719
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 567 place count 720 transition count 719
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 567 place count 720 transition count 636
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 733 place count 637 transition count 636
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 840 place count 530 transition count 529
Iterating global reduction 4 with 107 rules applied. Total rules applied 947 place count 530 transition count 529
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 947 place count 530 transition count 487
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1031 place count 488 transition count 487
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 19 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1375 place count 316 transition count 315
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1459 place count 274 transition count 342
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1463 place count 274 transition count 338
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1467 place count 270 transition count 338
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1468 place count 270 transition count 338
Applied a total of 1468 rules in 403 ms. Remains 270 /1003 variables (removed 733) and now considering 338/1003 (removed 665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 270/1003 places, 338/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 207833 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207833 steps, saw 143347 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 338 rows 270 cols
[2023-03-20 10:04:34] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 10:04:34] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:04:34] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2023-03-20 10:04:34] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:04:34] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-20 10:04:34] [INFO ] After 295ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:04:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 503 ms
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2023-03-20 10:04:35] [INFO ] After 1367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-20 10:04:36] [INFO ] After 1849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 68 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 338/338 transitions.
Applied a total of 0 rules in 13 ms. Remains 270 /270 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 270/270 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 338/338 transitions.
Applied a total of 0 rules in 11 ms. Remains 270 /270 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2023-03-20 10:04:36] [INFO ] Invariant cache hit.
[2023-03-20 10:04:36] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-20 10:04:36] [INFO ] Invariant cache hit.
[2023-03-20 10:04:36] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-20 10:04:36] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-20 10:04:36] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 10:04:36] [INFO ] Invariant cache hit.
[2023-03-20 10:04:37] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 929 ms. Remains : 270/270 places, 338/338 transitions.
Graph (trivial) has 44 edges and 270 vertex of which 2 / 270 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 776 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 268 transition count 326
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 19 place count 268 transition count 326
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 268 transition count 320
Applied a total of 25 rules in 68 ms. Remains 268 /270 variables (removed 2) and now considering 320/338 (removed 18) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 320 rows 268 cols
[2023-03-20 10:04:37] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-20 10:04:37] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:04:37] [INFO ] [Nat]Absence check using 80 positive place invariants in 10 ms returned sat
[2023-03-20 10:04:37] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:04:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 10:04:37] [INFO ] After 81ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-20 10:04:38] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-20 10:04:38] [INFO ] After 955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:04:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 16 ms.
[2023-03-20 10:04:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 338 transitions and 1484 arcs took 5 ms.
[2023-03-20 10:04:38] [INFO ] Flatten gal took : 128 ms
Total runtime 31003 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/798/inv_0_ --invariant=/tmp/798/inv_1_ --invariant=/tmp/798/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13903272 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099332 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
mcc2023

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-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-020B, 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 r425-tajo-167905978000286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;