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-167819417100022.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-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417100022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:41 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.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 15K Feb 26 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 01:43 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 247K 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-020-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678521953851

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-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 08:05:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 08:05:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:05:57] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-11 08:05:57] [INFO ] Transformed 100 places.
[2023-03-11 08:05:57] [INFO ] Transformed 440 transitions.
[2023-03-11 08:05:57] [INFO ] Found NUPN structural information;
[2023-03-11 08:05:57] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Dekker-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 5) seen :2
FORMULA Dekker-PT-020-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 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 08:05:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2023-03-11 08:05:59] [INFO ] Computed 60 place invariants in 18 ms
[2023-03-11 08:05:59] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:05:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-11 08:05:59] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-11 08:05:59] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:05:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 08:05:59] [INFO ] After 82ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:05:59] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 11 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 829 ms
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 08:06:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 08:06:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 08:06:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 08:06:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 08:06:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 08:06:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 477 ms
[2023-03-11 08:06:01] [INFO ] After 1462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-11 08:06:01] [INFO ] After 1858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 95 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 100/100 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 186732 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186732 steps, saw 104130 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:06:04] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 08:06:04] [INFO ] Invariant cache hit.
[2023-03-11 08:06:04] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:06:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2023-03-11 08:06:05] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-11 08:06:05] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:06:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 08:06:05] [INFO ] After 46ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 307 ms
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 9 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 08:06:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 620 ms
[2023-03-11 08:06:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 620 ms
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 08:06:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 203 ms
[2023-03-11 08:06:06] [INFO ] After 1222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-11 08:06:06] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 30 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 24 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 08:06:06] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 08:06:06] [INFO ] Invariant cache hit.
[2023-03-11 08:06:06] [INFO ] Implicit Places using invariants in 223 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 67, 70, 76, 88, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 227 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/100 places, 440/440 transitions.
Applied a total of 0 rules in 36 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 288 ms. Remains : 87/100 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 339570 steps, run timeout after 3003 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339570 steps, saw 182656 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:06:10] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 87 cols
[2023-03-11 08:06:10] [INFO ] Computed 47 place invariants in 3 ms
[2023-03-11 08:06:10] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:06:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-11 08:06:10] [INFO ] [Nat]Absence check using 40 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 08:06:10] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:06:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 08:06:10] [INFO ] After 59ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 08:06:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 610 ms
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 242 ms
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 08:06:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2023-03-11 08:06:11] [INFO ] After 1093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-11 08:06:11] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 30 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 440/440 transitions.
Applied a total of 0 rules in 31 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 87/87 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 440/440 transitions.
Applied a total of 0 rules in 24 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 08:06:11] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 08:06:11] [INFO ] Invariant cache hit.
[2023-03-11 08:06:11] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-11 08:06:11] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 08:06:11] [INFO ] Invariant cache hit.
[2023-03-11 08:06:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 08:06:12] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-11 08:06:12] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-11 08:06:12] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 08:06:12] [INFO ] Invariant cache hit.
[2023-03-11 08:06:12] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1209 ms. Remains : 87/87 places, 440/440 transitions.
Graph (complete) has 155 edges and 87 vertex of which 79 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Ensure Unique test removed 3 places
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 327 rules applied. Total rules applied 328 place count 76 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 340 place count 68 transition count 68
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 344 place count 68 transition count 64
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 351 place count 68 transition count 57
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 372 place count 54 transition count 50
Applied a total of 372 rules in 63 ms. Remains 54 /87 variables (removed 33) and now considering 50/440 (removed 390) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 50 rows 54 cols
[2023-03-11 08:06:12] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-11 08:06:12] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:06:12] [INFO ] [Nat]Absence check using 28 positive place invariants in 11 ms returned sat
[2023-03-11 08:06:12] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 08:06:12] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:06:13] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-11 08:06:13] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:06:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-11 08:06:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 440 transitions and 2967 arcs took 8 ms.
[2023-03-11 08:06:13] [INFO ] Flatten gal took : 183 ms
Total runtime 16066 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/710/inv_0_ --invariant=/tmp/710/inv_1_ --invariant=/tmp/710/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 14694692 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100192 kB
Could not compute solution for formula : Dekker-PT-020-ReachabilityCardinality-04
Could not compute solution for formula : Dekker-PT-020-ReachabilityCardinality-11
Could not compute solution for formula : Dekker-PT-020-ReachabilityCardinality-14

BK_STOP 1678525545952

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Dekker-PT-020-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/710/inv_0_
rfs formula name Dekker-PT-020-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/710/inv_1_
rfs formula name Dekker-PT-020-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/710/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 87 places, 440 transitions and 2967 arcs
pnml2lts-sym: Petri net Dekker_PT_020 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 440->420 groups
pnml2lts-sym: Regrouping took 0.240 real 0.230 user 0.000 sys
pnml2lts-sym: state vector length is 87; there are 420 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 716
Killing (9) : 716

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

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