fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r393-oct2-167903717100470
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldPPPs-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1904.111 3600000.00 14210806.00 72.30 TFTTFFFFFTTFFF?F 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.r393-oct2-167903717100470.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 ltsminxred
Input is ShieldPPPs-PT-030A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:50 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 4.1K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 265K 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 ShieldPPPs-PT-030A-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679451806933

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=ShieldPPPs-PT-030A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:23:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:23:29] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-22 02:23:29] [INFO ] Transformed 933 places.
[2023-03-22 02:23:29] [INFO ] Transformed 783 transitions.
[2023-03-22 02:23:29] [INFO ] Found NUPN structural information;
[2023-03-22 02:23:29] [INFO ] Parsed PT model containing 933 places and 783 transitions and 3006 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 14) seen :11
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 783 rows 933 cols
[2023-03-22 02:23:30] [INFO ] Computed 331 place invariants in 34 ms
[2023-03-22 02:23:31] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 02:23:31] [INFO ] [Nat]Absence check using 331 positive place invariants in 59 ms returned sat
[2023-03-22 02:23:32] [INFO ] After 982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 02:23:33] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 43 ms to minimize.
[2023-03-22 02:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-22 02:23:33] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 18 ms to minimize.
[2023-03-22 02:23:33] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 20 ms to minimize.
[2023-03-22 02:23:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-22 02:23:34] [INFO ] After 2733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-22 02:23:34] [INFO ] After 3522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 135 ms.
Support contains 54 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 931 transition count 781
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 239 place count 931 transition count 781
Applied a total of 239 rules in 205 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 931/933 places, 781/783 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-01 FALSE 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 02:23:35] [INFO ] Computed 331 place invariants in 28 ms
[2023-03-22 02:23:35] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:23:35] [INFO ] [Nat]Absence check using 314 positive place invariants in 158 ms returned sat
[2023-03-22 02:23:35] [INFO ] [Nat]Absence check using 314 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-22 02:23:39] [INFO ] After 3771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:23:40] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 16 ms to minimize.
[2023-03-22 02:23:40] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-22 02:23:40] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-22 02:23:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 965 ms
[2023-03-22 02:23:41] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2023-03-22 02:23:41] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-22 02:23:41] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-22 02:23:42] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-22 02:23:42] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-22 02:23:42] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-22 02:23:42] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-22 02:23:42] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 02:23:42] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-22 02:23:43] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-22 02:23:43] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-22 02:23:43] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:23:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2218 ms
[2023-03-22 02:23:43] [INFO ] After 7795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2770 ms.
[2023-03-22 02:23:46] [INFO ] After 10971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 56 ms.
Support contains 50 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 92 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 931/931 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :1
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:23:46] [INFO ] Invariant cache hit.
[2023-03-22 02:23:46] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:23:47] [INFO ] [Nat]Absence check using 314 positive place invariants in 54 ms returned sat
[2023-03-22 02:23:47] [INFO ] [Nat]Absence check using 314 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-22 02:23:47] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:23:48] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-22 02:23:49] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-22 02:23:49] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 0 ms to minimize.
[2023-03-22 02:23:49] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-22 02:23:49] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-22 02:23:50] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-22 02:23:50] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-22 02:23:50] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-22 02:23:50] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-22 02:23:51] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 0 ms to minimize.
[2023-03-22 02:23:51] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-22 02:23:51] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-22 02:23:51] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-22 02:23:51] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 13 ms to minimize.
[2023-03-22 02:23:52] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-22 02:23:52] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-22 02:23:52] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-22 02:23:52] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2023-03-22 02:23:52] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 02:23:53] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 26 ms to minimize.
[2023-03-22 02:23:53] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-22 02:23:53] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2023-03-22 02:23:53] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-22 02:23:54] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-22 02:23:54] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5768 ms
[2023-03-22 02:23:54] [INFO ] After 6924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-22 02:23:54] [INFO ] After 7428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 931 transition count 781
Applied a total of 6 rules in 130 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 931/931 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222342 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222342 steps, saw 198409 distinct states, run finished after 3003 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 02:23:57] [INFO ] Computed 331 place invariants in 20 ms
[2023-03-22 02:23:57] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:23:58] [INFO ] [Nat]Absence check using 313 positive place invariants in 104 ms returned sat
[2023-03-22 02:23:58] [INFO ] [Nat]Absence check using 313 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-22 02:23:58] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:23:59] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-22 02:23:59] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-22 02:23:59] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-22 02:24:07] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 2 ms to minimize.
[2023-03-22 02:24:08] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2023-03-22 02:24:09] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 31 ms to minimize.
[2023-03-22 02:24:09] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-22 02:24:09] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-22 02:24:10] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2023-03-22 02:24:10] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 0 ms to minimize.
[2023-03-22 02:24:10] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-22 02:24:10] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-22 02:24:11] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-22 02:24:11] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 0 ms to minimize.
[2023-03-22 02:24:11] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-22 02:24:12] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2023-03-22 02:24:12] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-22 02:24:12] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 11 ms to minimize.
[2023-03-22 02:24:13] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:24:13] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-22 02:24:14] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 4 ms to minimize.
[2023-03-22 02:24:14] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2023-03-22 02:24:15] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 14 ms to minimize.
[2023-03-22 02:24:15] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2023-03-22 02:24:16] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 23 ms to minimize.
[2023-03-22 02:24:17] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2023-03-22 02:24:17] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-22 02:24:17] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-22 02:24:18] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-22 02:24:18] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 02:24:18] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-22 02:24:19] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2023-03-22 02:24:19] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 0 ms to minimize.
[2023-03-22 02:24:19] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 20706 ms
[2023-03-22 02:24:19] [INFO ] After 21350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-22 02:24:19] [INFO ] After 21807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 84 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 931/931 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 26 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 02:24:19] [INFO ] Invariant cache hit.
[2023-03-22 02:24:20] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-22 02:24:20] [INFO ] Invariant cache hit.
[2023-03-22 02:24:22] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2023-03-22 02:24:22] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 02:24:22] [INFO ] Invariant cache hit.
[2023-03-22 02:24:22] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3124 ms. Remains : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 21 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 02:24:22] [INFO ] Invariant cache hit.
[2023-03-22 02:24:23] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:24:23] [INFO ] [Nat]Absence check using 313 positive place invariants in 44 ms returned sat
[2023-03-22 02:24:23] [INFO ] [Nat]Absence check using 313 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-22 02:24:23] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:24:24] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2023-03-22 02:24:24] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-22 02:24:24] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-22 02:24:24] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-22 02:24:25] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 02:24:25] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-22 02:24:25] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-22 02:24:25] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-22 02:24:25] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-22 02:24:26] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-22 02:24:26] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-22 02:24:26] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-22 02:24:26] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-22 02:24:26] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-22 02:24:32] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-22 02:24:33] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-22 02:24:33] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-22 02:24:33] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-22 02:24:33] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-22 02:24:34] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2023-03-22 02:24:34] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2023-03-22 02:24:34] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-22 02:24:34] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-22 02:24:34] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-22 02:24:35] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-22 02:24:35] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-22 02:24:35] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-22 02:24:35] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-22 02:24:35] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2023-03-22 02:24:36] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-22 02:24:36] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-22 02:24:36] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-22 02:24:36] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-22 02:24:36] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 12864 ms
[2023-03-22 02:24:36] [INFO ] After 13388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1031 ms.
[2023-03-22 02:24:37] [INFO ] After 14682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 02:24:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-22 02:24:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 931 places, 781 transitions and 3668 arcs took 12 ms.
[2023-03-22 02:24:38] [INFO ] Flatten gal took : 117 ms
Total runtime 68703 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/855/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 14241032 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095056 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-PT-030A"
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 ShieldPPPs-PT-030A, 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 r393-oct2-167903717100470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030A.tgz
mv ShieldPPPs-PT-030A 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 ;