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

About the Execution of LTSMin+red for ShieldRVt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
750.228 54357.00 80800.00 70.80 FTFTTFFTTFTTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978100350.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-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 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.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 1.3M 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-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679313506305

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-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:58:28] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-20 11:58:28] [INFO ] Transformed 5003 places.
[2023-03-20 11:58:28] [INFO ] Transformed 5003 transitions.
[2023-03-20 11:58:28] [INFO ] Found NUPN structural information;
[2023-03-20 11:58:28] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 14) seen :6
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5003 rows 5003 cols
[2023-03-20 11:58:29] [INFO ] Computed 401 place invariants in 41 ms
[2023-03-20 11:58:30] [INFO ] After 1400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 11:58:32] [INFO ] [Nat]Absence check using 401 positive place invariants in 288 ms returned sat
[2023-03-20 11:58:55] [INFO ] After 22815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 11:58:55] [INFO ] After 22834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 11:58:55] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 418 ms.
Support contains 95 out of 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions removed 1511 transitions
Trivial Post-agglo rules discarded 1511 transitions
Performed 1511 trivial Post agglomeration. Transition count delta: 1511
Iterating post reduction 0 with 1511 rules applied. Total rules applied 1511 place count 5003 transition count 3492
Reduce places removed 1511 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 1513 rules applied. Total rules applied 3024 place count 3492 transition count 3490
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 3052 place count 3491 transition count 3463
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 3079 place count 3464 transition count 3463
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 408 Pre rules applied. Total rules applied 3079 place count 3464 transition count 3055
Deduced a syphon composed of 408 places in 12 ms
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 4 with 816 rules applied. Total rules applied 3895 place count 3056 transition count 3055
Discarding 665 places :
Symmetric choice reduction at 4 with 665 rule applications. Total rules 4560 place count 2391 transition count 2390
Iterating global reduction 4 with 665 rules applied. Total rules applied 5225 place count 2391 transition count 2390
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 283 Pre rules applied. Total rules applied 5225 place count 2391 transition count 2107
Deduced a syphon composed of 283 places in 17 ms
Reduce places removed 283 places and 0 transitions.
Iterating global reduction 4 with 566 rules applied. Total rules applied 5791 place count 2108 transition count 2107
Performed 878 Post agglomeration using F-continuation condition.Transition count delta: 878
Deduced a syphon composed of 878 places in 4 ms
Reduce places removed 878 places and 0 transitions.
Iterating global reduction 4 with 1756 rules applied. Total rules applied 7547 place count 1230 transition count 1229
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7749 place count 1129 transition count 1322
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7951 place count 1028 transition count 1408
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 8093 place count 957 transition count 1471
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8094 place count 957 transition count 1470
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 8100 place count 957 transition count 1464
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 8106 place count 951 transition count 1464
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 8111 place count 951 transition count 1459
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 8114 place count 951 transition count 1459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8115 place count 950 transition count 1458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8116 place count 949 transition count 1458
Applied a total of 8116 rules in 1638 ms. Remains 949 /5003 variables (removed 4054) and now considering 1458/5003 (removed 3545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1640 ms. Remains : 949/5003 places, 1458/5003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 94317 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{0=1}
Probabilistic random walk after 94317 steps, saw 57635 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :1
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 1458 rows 949 cols
[2023-03-20 11:59:01] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 11:59:02] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 11:59:02] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-20 11:59:03] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 11:59:03] [INFO ] State equation strengthened by 361 read => feed constraints.
[2023-03-20 11:59:03] [INFO ] After 741ms SMT Verify possible using 361 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 11:59:04] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 8 ms to minimize.
[2023-03-20 11:59:04] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2023-03-20 11:59:04] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-20 11:59:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2023-03-20 11:59:04] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-20 11:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-20 11:59:05] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-20 11:59:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-20 11:59:05] [INFO ] After 2211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1076 ms.
[2023-03-20 11:59:06] [INFO ] After 4343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 158 ms.
Support contains 77 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 1458/1458 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 949 transition count 1454
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 945 transition count 1454
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 945 transition count 1452
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 943 transition count 1452
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 927 transition count 1436
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 925 transition count 1438
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 925 transition count 1437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 924 transition count 1437
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 919 transition count 1432
Applied a total of 55 rules in 165 ms. Remains 919 /949 variables (removed 30) and now considering 1432/1458 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 919/949 places, 1432/1458 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 109905 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109905 steps, saw 66650 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1432 rows 919 cols
[2023-03-20 11:59:10] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 11:59:10] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 11:59:10] [INFO ] [Nat]Absence check using 400 positive place invariants in 69 ms returned sat
[2023-03-20 11:59:11] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 11:59:11] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-20 11:59:12] [INFO ] After 424ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 11:59:12] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-20 11:59:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-20 11:59:13] [INFO ] After 1225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-20 11:59:13] [INFO ] After 2760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 276 ms.
Support contains 77 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1432/1432 transitions.
Applied a total of 0 rules in 63 ms. Remains 919 /919 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 919/919 places, 1432/1432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1432/1432 transitions.
Applied a total of 0 rules in 45 ms. Remains 919 /919 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
[2023-03-20 11:59:13] [INFO ] Invariant cache hit.
[2023-03-20 11:59:14] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-20 11:59:14] [INFO ] Invariant cache hit.
[2023-03-20 11:59:15] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-20 11:59:15] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2023-03-20 11:59:16] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-20 11:59:16] [INFO ] Invariant cache hit.
[2023-03-20 11:59:16] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2811 ms. Remains : 919/919 places, 1432/1432 transitions.
Graph (trivial) has 336 edges and 919 vertex of which 2 / 919 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 335 edges and 917 vertex of which 2 / 917 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 916 transition count 1427
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 914 transition count 1424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 914 transition count 1423
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 912 transition count 1423
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 912 transition count 1399
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 912 transition count 1399
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 912 transition count 1391
Applied a total of 55 rules in 147 ms. Remains 912 /919 variables (removed 7) and now considering 1391/1432 (removed 41) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1391 rows 912 cols
[2023-03-20 11:59:16] [INFO ] Computed 397 place invariants in 3 ms
[2023-03-20 11:59:16] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 11:59:17] [INFO ] [Nat]Absence check using 397 positive place invariants in 45 ms returned sat
[2023-03-20 11:59:17] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 11:59:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-20 11:59:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-20 11:59:18] [INFO ] After 1250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-20 11:59:18] [INFO ] After 1894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-20 11:59:18] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-20 11:59:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 919 places, 1432 transitions and 7591 arcs took 10 ms.
[2023-03-20 11:59:19] [INFO ] Flatten gal took : 143 ms
Total runtime 51420 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/532/inv_0_ --invariant=/tmp/532/inv_1_ --invariant=/tmp/532/inv_2_ --invariant=/tmp/532/inv_3_ --invariant=/tmp/532/inv_4_ --invariant=/tmp/532/inv_5_ --invariant=/tmp/532/inv_6_ --inv-par
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679313560662

--------------------
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
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/532/inv_0_
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/532/inv_1_
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/532/inv_2_
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/532/inv_3_
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/532/inv_4_
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/532/inv_5_
rfs formula name ShieldRVt-PT-100B-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/532/inv_6_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 919 places, 1432 transitions and 7591 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_100B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1432->537 groups
pnml2lts-sym: Regrouping took 0.380 real 0.390 user 0.000 sys
pnml2lts-sym: state vector length is 919; there are 537 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/532/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.480 real 1.930 user 0.000 sys
pnml2lts-sym: max token count: 1

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-100B"
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-100B, 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-167905978100350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100B.tgz
mv ShieldRVt-PT-100B 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 ;