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-167903716700134.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-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 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.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 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 338K 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-040A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679427964326

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-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:46:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 19:46:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:46:07] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-21 19:46:07] [INFO ] Transformed 1003 places.
[2023-03-21 19:46:07] [INFO ] Transformed 963 transitions.
[2023-03-21 19:46:07] [INFO ] Found NUPN structural information;
[2023-03-21 19:46:07] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 13) seen :9
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:46:08] [INFO ] Computed 361 place invariants in 18 ms
[2023-03-21 19:46:09] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:46:09] [INFO ] [Nat]Absence check using 361 positive place invariants in 121 ms returned sat
[2023-03-21 19:46:11] [INFO ] After 1777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:46:11] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 29 ms to minimize.
[2023-03-21 19:46:12] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-21 19:46:12] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-21 19:46:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 11 ms to minimize.
[2023-03-21 19:46:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 840 ms
[2023-03-21 19:46:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-21 19:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-21 19:46:13] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-21 19:46:13] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 7 ms to minimize.
[2023-03-21 19:46:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2023-03-21 19:46:14] [INFO ] After 4401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1396 ms.
[2023-03-21 19:46:15] [INFO ] After 6234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 437 ms.
Support contains 88 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 228 times.
Drop transitions removed 228 transitions
Iterating global reduction 0 with 228 rules applied. Total rules applied 228 place count 1003 transition count 963
Applied a total of 228 rules in 128 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:46:16] [INFO ] Computed 361 place invariants in 38 ms
[2023-03-21 19:46:16] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:46:17] [INFO ] [Nat]Absence check using 348 positive place invariants in 123 ms returned sat
[2023-03-21 19:46:17] [INFO ] [Nat]Absence check using 348 positive and 13 generalized place invariants in 16 ms returned sat
[2023-03-21 19:46:18] [INFO ] After 1650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:46:19] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-21 19:46:19] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-21 19:46:20] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 2 ms to minimize.
[2023-03-21 19:46:20] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-21 19:46:20] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 28 ms to minimize.
[2023-03-21 19:46:20] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-21 19:46:21] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2023-03-21 19:46:21] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-21 19:46:21] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 19:46:21] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-21 19:46:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-21 19:46:22] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-21 19:46:22] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-21 19:46:22] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2023-03-21 19:46:23] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 15 ms to minimize.
[2023-03-21 19:46:23] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-21 19:46:23] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2023-03-21 19:46:23] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2023-03-21 19:46:23] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-21 19:46:24] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 14 ms to minimize.
[2023-03-21 19:46:24] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-21 19:46:24] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5021 ms
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 1 ms to minimize.
[2023-03-21 19:46:26] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 34 ms to minimize.
[2023-03-21 19:46:26] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-21 19:46:26] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-21 19:46:26] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2817 ms
[2023-03-21 19:46:27] [INFO ] After 10557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 804 ms.
[2023-03-21 19:46:28] [INFO ] After 11899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 143 ms.
Support contains 87 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 40 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 114796 steps, run timeout after 3041 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 114796 steps, saw 100151 distinct states, run finished after 3043 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 19:46:32] [INFO ] Invariant cache hit.
[2023-03-21 19:46:32] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:46:32] [INFO ] [Nat]Absence check using 348 positive place invariants in 54 ms returned sat
[2023-03-21 19:46:32] [INFO ] [Nat]Absence check using 348 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-21 19:46:34] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:46:35] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2023-03-21 19:46:35] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-21 19:46:35] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-21 19:46:36] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-21 19:46:37] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-21 19:46:37] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-21 19:46:37] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-21 19:46:37] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 23 ms to minimize.
[2023-03-21 19:46:39] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 6 ms to minimize.
[2023-03-21 19:46:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4365 ms
[2023-03-21 19:46:39] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 819 ms
[2023-03-21 19:46:40] [INFO ] After 7996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1146 ms.
[2023-03-21 19:46:41] [INFO ] After 9430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 213 ms.
Support contains 87 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 42 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1003/1003 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 36 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-21 19:46:42] [INFO ] Invariant cache hit.
[2023-03-21 19:46:42] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-21 19:46:42] [INFO ] Invariant cache hit.
[2023-03-21 19:46:44] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2386 ms to find 0 implicit places.
[2023-03-21 19:46:44] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-21 19:46:44] [INFO ] Invariant cache hit.
[2023-03-21 19:46:45] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3376 ms. Remains : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 83 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 19:46:45] [INFO ] Invariant cache hit.
[2023-03-21 19:46:45] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:46:46] [INFO ] [Nat]Absence check using 348 positive place invariants in 101 ms returned sat
[2023-03-21 19:46:46] [INFO ] [Nat]Absence check using 348 positive and 13 generalized place invariants in 20 ms returned sat
[2023-03-21 19:46:48] [INFO ] After 1707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:46:48] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2023-03-21 19:46:49] [INFO ] Deduced a trap composed of 9 places in 664 ms of which 1 ms to minimize.
[2023-03-21 19:46:49] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-21 19:46:51] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-21 19:46:51] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 26 ms to minimize.
[2023-03-21 19:46:51] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-21 19:46:51] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 6 ms to minimize.
[2023-03-21 19:46:52] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 13 ms to minimize.
[2023-03-21 19:46:52] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-21 19:46:52] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-21 19:46:52] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 13 ms to minimize.
[2023-03-21 19:46:53] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-21 19:46:53] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 0 ms to minimize.
[2023-03-21 19:46:53] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:46:53] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:46:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5320 ms
[2023-03-21 19:46:54] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2023-03-21 19:46:54] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-21 19:46:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-21 19:46:55] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-21 19:46:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 920 ms
[2023-03-21 19:46:55] [INFO ] After 9147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1252 ms.
[2023-03-21 19:46:56] [INFO ] After 10782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 19:46:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-21 19:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4814 arcs took 7 ms.
[2023-03-21 19:46:57] [INFO ] Flatten gal took : 163 ms
Total runtime 50218 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/751/inv_0_ --invariant=/tmp/751/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12268320 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096132 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-040A"
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-040A, 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-167903716700134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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