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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K 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.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:44 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 141K 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-015-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678517995822

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-015
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 06:59:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:59:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:59:58] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-11 06:59:58] [INFO ] Transformed 75 places.
[2023-03-11 06:59:58] [INFO ] Transformed 255 transitions.
[2023-03-11 06:59:58] [INFO ] Found NUPN structural information;
[2023-03-11 06:59:58] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-015-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 9) seen :4
FORMULA Dekker-PT-015-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:59:59] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-11 06:59:59] [INFO ] Computed 45 place invariants in 12 ms
[2023-03-11 07:00:00] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:00:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-11 07:00:00] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-11 07:00:00] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 07:00:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:00] [INFO ] After 88ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 07:00:00] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 11 ms to minimize.
[2023-03-11 07:00:00] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-11 07:00:00] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 07:00:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 07:00:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2023-03-11 07:00:00] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 274 ms
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 169 ms
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:00:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 231 ms
[2023-03-11 07:00:01] [INFO ] After 1114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-11 07:00:01] [INFO ] After 1477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 61 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 32 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 776304 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{2=1}
Probabilistic random walk after 776304 steps, saw 81097 distinct states, run finished after 3003 ms. (steps per millisecond=258 ) properties seen :1
FORMULA Dekker-PT-015-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-03-11 07:00:05] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:05] [INFO ] Invariant cache hit.
[2023-03-11 07:00:05] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:00:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-11 07:00:05] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-11 07:00:05] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:00:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:05] [INFO ] After 66ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 177 ms
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:00:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-11 07:00:05] [INFO ] After 480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-11 07:00:06] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 58 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 19 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 844752 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 844752 steps, saw 81818 distinct states, run finished after 3002 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 07:00:09] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:09] [INFO ] Invariant cache hit.
[2023-03-11 07:00:09] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:00:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-11 07:00:09] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-11 07:00:09] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:00:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:09] [INFO ] After 67ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:00:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
[2023-03-11 07:00:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 07:00:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 07:00:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 07:00:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 07:00:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 176 ms
[2023-03-11 07:00:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:00:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2023-03-11 07:00:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-11 07:00:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 07:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-11 07:00:10] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2023-03-11 07:00:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 07:00:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-11 07:00:10] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-11 07:00:10] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1 ms.
Support contains 58 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 75/75 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 07:00:10] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:10] [INFO ] Invariant cache hit.
[2023-03-11 07:00:10] [INFO ] Implicit Places using invariants in 71 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 74/75 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 96 ms. Remains : 74/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :3
FORMULA Dekker-PT-015-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-11 07:00:10] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 74 cols
[2023-03-11 07:00:10] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-11 07:00:10] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned sat
[2023-03-11 07:00:10] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-11 07:00:10] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:10] [INFO ] After 19ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:11] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:00:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 07:00:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 07:00:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 92 ms
[2023-03-11 07:00:11] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 07:00:11] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1673360 steps, run timeout after 3001 ms. (steps per millisecond=557 ) properties seen :{}
Probabilistic random walk after 1673360 steps, saw 114607 distinct states, run finished after 3001 ms. (steps per millisecond=557 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:00:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:14] [INFO ] Invariant cache hit.
[2023-03-11 07:00:14] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2023-03-11 07:00:14] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-11 07:00:14] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:14] [INFO ] After 31ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-11 07:00:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2023-03-11 07:00:14] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-11 07:00:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 07:00:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 07:00:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 156 ms
[2023-03-11 07:00:14] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 07:00:14] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 74/74 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 07:00:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:14] [INFO ] Invariant cache hit.
[2023-03-11 07:00:14] [INFO ] Implicit Places using invariants in 167 ms returned [33, 36, 39, 42, 48, 51, 60, 65]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 169 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/74 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 66 /66 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 193 ms. Remains : 66/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1843968 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :{}
Probabilistic random walk after 1843968 steps, saw 131053 distinct states, run finished after 3005 ms. (steps per millisecond=613 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:00:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 66 cols
[2023-03-11 07:00:17] [INFO ] Computed 36 place invariants in 12 ms
[2023-03-11 07:00:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-11 07:00:17] [INFO ] [Nat]Absence check using 30 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 07:00:18] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:18] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:18] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-11 07:00:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-11 07:00:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 07:00:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 125 ms
[2023-03-11 07:00:18] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 07:00:18] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 255/255 transitions.
Applied a total of 0 rules in 11 ms. Remains 66 /66 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 66/66 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 66 /66 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 07:00:18] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:18] [INFO ] Invariant cache hit.
[2023-03-11 07:00:18] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-11 07:00:18] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:18] [INFO ] Invariant cache hit.
[2023-03-11 07:00:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:18] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-11 07:00:18] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 07:00:18] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 07:00:18] [INFO ] Invariant cache hit.
[2023-03-11 07:00:18] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 66/66 places, 255/255 transitions.
Graph (complete) has 120 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Ensure Unique test removed 4 places
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 174 place count 54 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 177 place count 52 transition count 51
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 178 place count 52 transition count 50
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 52 transition count 44
Ensure Unique test removed 6 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 202 place count 40 transition count 38
Applied a total of 202 rules in 33 ms. Remains 40 /66 variables (removed 26) and now considering 38/255 (removed 217) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 40 cols
[2023-03-11 07:00:18] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-11 07:00:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 07:00:18] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 07:00:18] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:18] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 07:00:18] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-11 07:00:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 255 transitions and 1686 arcs took 4 ms.
[2023-03-11 07:00:19] [INFO ] Flatten gal took : 93 ms
Total runtime 20759 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/686/inv_0_ --inv-par
FORMULA Dekker-PT-015-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678518136975

--------------------
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-015-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/686/inv_0_
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 66 places, 255 transitions and 1686 arcs
pnml2lts-sym: Petri net Dekker_PT_015 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 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: 255->240 groups
pnml2lts-sym: Regrouping took 0.050 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 66; there are 240 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/686/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 116.180 real 463.710 user 0.100 sys
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-015"
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-015, 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-167819417100014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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