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.r137-smll-167819417100030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417100030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678529391261

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=Dekker-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 10:09:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:09:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:09:54] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2023-03-11 10:09:54] [INFO ] Transformed 250 places.
[2023-03-11 10:09:54] [INFO ] Transformed 2600 transitions.
[2023-03-11 10:09:54] [INFO ] Found NUPN structural information;
[2023-03-11 10:09:54] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 552 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 8) seen :5
FORMULA Dekker-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:09:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-11 10:09:55] [INFO ] Computed 150 place invariants in 31 ms
[2023-03-11 10:09:55] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:09:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 71 ms returned sat
[2023-03-11 10:09:56] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2023-03-11 10:09:56] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 10:09:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:09:56] [INFO ] After 93ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 10:09:56] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 37 ms to minimize.
[2023-03-11 10:09:57] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 2 ms to minimize.
[2023-03-11 10:09:57] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-11 10:09:57] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 2 ms to minimize.
[2023-03-11 10:09:57] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 2 ms to minimize.
[2023-03-11 10:09:57] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-11 10:09:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2248 ms
[2023-03-11 10:09:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2249 ms
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-11 10:09:59] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-11 10:10:00] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-11 10:10:00] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-11 10:10:00] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2023-03-11 10:10:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1393 ms
[2023-03-11 10:10:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1393 ms
[2023-03-11 10:10:00] [INFO ] After 3794ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-11 10:10:00] [INFO ] After 4369ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA Dekker-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 269 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 209253 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209253 steps, saw 173374 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:10:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:10:03] [INFO ] Invariant cache hit.
[2023-03-11 10:10:04] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:10:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-11 10:10:04] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2023-03-11 10:10:04] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:10:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:10:04] [INFO ] After 75ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:10:04] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-11 10:10:04] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-11 10:10:04] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 5 ms to minimize.
[2023-03-11 10:10:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2093 ms
[2023-03-11 10:10:06] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2093 ms
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-11 10:10:06] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 9 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:10:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1099 ms
[2023-03-11 10:10:07] [INFO ] After 3327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-11 10:10:07] [INFO ] After 3733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 137 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 98 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:10:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:10:08] [INFO ] Invariant cache hit.
[2023-03-11 10:10:09] [INFO ] Implicit Places using invariants in 1454 ms returned [100, 103, 106, 109, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 205, 208, 211, 214, 217, 220, 223, 226, 235, 238]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1461 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 76 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1636 ms. Remains : 208/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 232815 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232815 steps, saw 192426 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:10:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2023-03-11 10:10:12] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-11 10:10:13] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:10:13] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:10:13] [INFO ] [Nat]Absence check using 100 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 10:10:13] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:10:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:10:13] [INFO ] After 71ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:10:13] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-11 10:10:13] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-11 10:10:13] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2023-03-11 10:10:13] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2023-03-11 10:10:13] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1183 ms
[2023-03-11 10:10:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1183 ms
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-11 10:10:14] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:10:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1129 ms
[2023-03-11 10:10:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1130 ms
[2023-03-11 10:10:15] [INFO ] After 2436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 10:10:15] [INFO ] After 2777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 75 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 208/208 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 71 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:10:15] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:10:15] [INFO ] Invariant cache hit.
[2023-03-11 10:10:16] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-11 10:10:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:10:16] [INFO ] Invariant cache hit.
[2023-03-11 10:10:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:10:17] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2023-03-11 10:10:17] [INFO ] Redundant transitions in 223 ms returned []
[2023-03-11 10:10:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:10:17] [INFO ] Invariant cache hit.
[2023-03-11 10:10:19] [INFO ] Dead Transitions using invariants and state equation in 2019 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3819 ms. Remains : 208/208 places, 2600/2600 transitions.
Graph (complete) has 340 edges and 208 vertex of which 104 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.3 ms
Discarding 104 places :
Also discarding 1352 output transitions
Drop transitions removed 1352 transitions
Ensure Unique test removed 8 places
Ensure Unique test removed 1152 transitions
Reduce isomorphic transitions removed 1152 transitions.
Iterating post reduction 0 with 1160 rules applied. Total rules applied 1161 place count 96 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1173 place count 88 transition count 92
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1177 place count 88 transition count 88
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 1190 place count 88 transition count 75
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1229 place count 62 transition count 62
Applied a total of 1229 rules in 127 ms. Remains 62 /208 variables (removed 146) and now considering 62/2600 (removed 2538) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 62 cols
[2023-03-11 10:10:19] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-11 10:10:19] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:10:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-11 10:10:19] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:10:19] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 10:10:20] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:10:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-11 10:10:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 2600 transitions and 17958 arcs took 26 ms.
[2023-03-11 10:10:20] [INFO ] Flatten gal took : 378 ms
Total runtime 26884 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/752/inv_0_ --invariant=/tmp/752/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14756100 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16096420 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="Dekker-PT-050"
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 Dekker-PT-050, 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 r137-smll-167819417100030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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