About the Execution of LTSMin+red for ShieldIIPs-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3757.092 | 3600000.00 | 14324375.00 | 51.70 | TTTTTFTTTF?TTFFF | 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-167903716600118.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 ShieldIIPs-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-167903716600118
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 253K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679424408650
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=ShieldIIPs-PT-030A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:46:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 18:46:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:46:51] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-21 18:46:51] [INFO ] Transformed 753 places.
[2023-03-21 18:46:51] [INFO ] Transformed 723 transitions.
[2023-03-21 18:46:51] [INFO ] Found NUPN structural information;
[2023-03-21 18:46:51] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 10) seen :8
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-21 18:46:52] [INFO ] Computed 271 place invariants in 16 ms
[2023-03-21 18:46:52] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 18:46:52] [INFO ] [Nat]Absence check using 271 positive place invariants in 121 ms returned sat
[2023-03-21 18:46:53] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 18:46:54] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 9 ms to minimize.
[2023-03-21 18:46:54] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-21 18:46:54] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 26 ms to minimize.
[2023-03-21 18:46:54] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2023-03-21 18:46:55] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-21 18:46:55] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-21 18:46:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1251 ms
[2023-03-21 18:46:55] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 13 ms to minimize.
[2023-03-21 18:46:55] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2023-03-21 18:46:55] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 13 ms to minimize.
[2023-03-21 18:46:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2023-03-21 18:46:55] [INFO ] After 3028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 615 ms.
[2023-03-21 18:46:56] [INFO ] After 3984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 91 ms.
Support contains 39 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 753 transition count 722
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 0 with 189 rules applied. Total rules applied 193 place count 751 transition count 721
Applied a total of 193 rules in 156 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 751/753 places, 721/723 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-21 18:46:57] [INFO ] Computed 271 place invariants in 18 ms
[2023-03-21 18:46:57] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:46:57] [INFO ] [Nat]Absence check using 264 positive place invariants in 87 ms returned sat
[2023-03-21 18:46:57] [INFO ] [Nat]Absence check using 264 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-21 18:46:58] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 18:46:58] [INFO ] After 100ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:58] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2023-03-21 18:46:58] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-21 18:46:58] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 10 ms to minimize.
[2023-03-21 18:46:58] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 5 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-21 18:46:59] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-21 18:47:00] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 13 ms to minimize.
[2023-03-21 18:47:00] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2023-03-21 18:47:00] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-21 18:47:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-21 18:47:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2300 ms
[2023-03-21 18:47:00] [INFO ] After 2543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-21 18:47:00] [INFO ] After 3509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 27 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 751 transition count 721
Applied a total of 9 rules in 50 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 751/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 223208 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223208 steps, saw 166398 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-21 18:47:04] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-21 18:47:04] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:47:04] [INFO ] [Nat]Absence check using 267 positive place invariants in 61 ms returned sat
[2023-03-21 18:47:04] [INFO ] [Nat]Absence check using 267 positive and 4 generalized place invariants in 0 ms returned sat
[2023-03-21 18:47:04] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:47:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 18:47:04] [INFO ] After 94ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 811 ms
[2023-03-21 18:47:05] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-21 18:47:05] [INFO ] After 1730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 27 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-21 18:47:05] [INFO ] Invariant cache hit.
[2023-03-21 18:47:06] [INFO ] Implicit Places using invariants in 616 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 620 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 657 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228338 steps, run timeout after 3002 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228338 steps, saw 164853 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-21 18:47:09] [INFO ] Computed 270 place invariants in 10 ms
[2023-03-21 18:47:09] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:47:10] [INFO ] [Nat]Absence check using 266 positive place invariants in 59 ms returned sat
[2023-03-21 18:47:10] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 18:47:10] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:47:11] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 5 ms to minimize.
[2023-03-21 18:47:11] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-21 18:47:11] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2023-03-21 18:47:11] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-21 18:47:11] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-21 18:47:11] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-21 18:47:12] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2023-03-21 18:47:12] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-21 18:47:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1275 ms
[2023-03-21 18:47:12] [INFO ] After 2092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-21 18:47:12] [INFO ] After 2500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 27 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 24 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-21 18:47:12] [INFO ] Invariant cache hit.
[2023-03-21 18:47:13] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-21 18:47:13] [INFO ] Invariant cache hit.
[2023-03-21 18:47:14] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
[2023-03-21 18:47:14] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-21 18:47:14] [INFO ] Invariant cache hit.
[2023-03-21 18:47:14] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2383 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 18:47:14] [INFO ] Invariant cache hit.
[2023-03-21 18:47:15] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:47:15] [INFO ] [Nat]Absence check using 266 positive place invariants in 38 ms returned sat
[2023-03-21 18:47:15] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 18:47:15] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:47:16] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2023-03-21 18:47:16] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 0 ms to minimize.
[2023-03-21 18:47:16] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-21 18:47:16] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-21 18:47:17] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-21 18:47:17] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2023-03-21 18:47:17] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2023-03-21 18:47:17] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
[2023-03-21 18:47:17] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 15 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-21 18:47:19] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-21 18:47:19] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-21 18:47:19] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2023-03-21 18:47:19] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3640 ms
[2023-03-21 18:47:19] [INFO ] After 4375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-21 18:47:19] [INFO ] After 4742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 18:47:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2023-03-21 18:47:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3657 arcs took 9 ms.
[2023-03-21 18:47:20] [INFO ] Flatten gal took : 154 ms
Total runtime 29173 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/695/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12388972 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096496 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="ShieldIIPs-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 ShieldIIPs-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-167903716600118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030A.tgz
mv ShieldIIPs-PT-030A execution
cd execution
if [ "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 '
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 ;