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.r138-smll-167819419200014.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 marciexred
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 r138-smll-167819419200014
=====================================================================

--------------------
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 1678531395374

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:43:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:43:19] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-11 10:43:19] [INFO ] Transformed 75 places.
[2023-03-11 10:43:19] [INFO ] Transformed 255 transitions.
[2023-03-11 10:43:19] [INFO ] Found NUPN structural information;
[2023-03-11 10:43:19] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 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 585 ms. (steps per millisecond=17 ) properties (out of 9) seen :6
FORMULA Dekker-PT-015-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-08 FALSE 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 53 ms. (steps per millisecond=188 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:43:20] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-11 10:43:20] [INFO ] Computed 45 place invariants in 10 ms
[2023-03-11 10:43:20] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:43:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 10:43:20] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-11 10:43:20] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:43:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:20] [INFO ] After 60ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:43:20] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 7 ms to minimize.
[2023-03-11 10:43:20] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-11 10:43:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-11 10:43:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-11 10:43:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 379 ms
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 400 ms
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:43:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 214 ms
[2023-03-11 10:43:21] [INFO ] After 1117ms 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 10:43:21] [INFO ] After 1391ms 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 4 ms.
Support contains 37 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 57 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 57 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1097888 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{2=1}
Probabilistic random walk after 1097888 steps, saw 98174 distinct states, run finished after 3003 ms. (steps per millisecond=365 ) properties seen :1
FORMULA Dekker-PT-015-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-11 10:43:25] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:25] [INFO ] Invariant cache hit.
[2023-03-11 10:43:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:43:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2023-03-11 10:43:25] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 10 ms returned sat
[2023-03-11 10:43:25] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:25] [INFO ] After 50ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 10:43:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 201 ms
[2023-03-11 10:43:26] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2023-03-11 10:43:26] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-11 10:43:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-11 10:43:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-11 10:43:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:43:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 286 ms
[2023-03-11 10:43:26] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-11 10:43:26] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 31 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 29 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 31 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1267840 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{}
Probabilistic random walk after 1267840 steps, saw 98224 distinct states, run finished after 3002 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:43:29] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:29] [INFO ] Invariant cache hit.
[2023-03-11 10:43:29] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:43:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-11 10:43:29] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-11 10:43:29] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:29] [INFO ] After 32ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 133 ms
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 8 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-11 10:43:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 274 ms
[2023-03-11 10:43:30] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 10:43:30] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 31 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 27 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 27 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 19 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:43:30] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:30] [INFO ] Invariant cache hit.
[2023-03-11 10:43:30] [INFO ] Implicit Places using invariants in 200 ms returned [33, 36, 39, 42, 48, 51, 60, 63]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 203 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/75 places, 255/255 transitions.
Applied a total of 0 rules in 17 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 242 ms. Remains : 67/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 1364976 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :{}
Probabilistic random walk after 1364976 steps, saw 98288 distinct states, run finished after 3004 ms. (steps per millisecond=454 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:43:34] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2023-03-11 10:43:34] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 10:43:34] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:43:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 10:43:34] [INFO ] [Nat]Absence check using 30 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 10:43:34] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:34] [INFO ] After 31ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 182 ms
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 10:43:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 158 ms
[2023-03-11 10:43:34] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-11 10:43:34] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 17 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 67/67 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 17 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:43:34] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:34] [INFO ] Invariant cache hit.
[2023-03-11 10:43:34] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-11 10:43:34] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:34] [INFO ] Invariant cache hit.
[2023-03-11 10:43:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:35] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-11 10:43:35] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 10:43:35] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:35] [INFO ] Invariant cache hit.
[2023-03-11 10:43:35] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 706 ms. Remains : 67/67 places, 255/255 transitions.
Ensure Unique test removed 3 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 64 transition count 60
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 203 place count 64 transition count 55
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 218 place count 54 transition count 50
Applied a total of 218 rules in 45 ms. Remains 54 /67 variables (removed 13) and now considering 50/255 (removed 205) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 50 rows 54 cols
[2023-03-11 10:43:35] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-11 10:43:35] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:43:35] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-11 10:43:35] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:43:35] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:35] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-11 10:43:35] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:43:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-11 10:43:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 255 transitions and 1702 arcs took 8 ms.
[2023-03-11 10:43:36] [INFO ] Flatten gal took : 137 ms
Total runtime 17346 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Dekker_PT_015
(NrP: 67 NrTr: 255 NrArc: 1702)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec

net check time: 0m 0.000sec

init dd package: 0m 4.022sec


RS generation: 0m 0.230sec


-> reachability set: #nodes 2167 (2.2e+03) #states 278,528 (5)



starting MCC model checker
--------------------------

checking: EF [[[[0<=p58 & p58<=0] & [[[[[[[p61<=1 & 1<=p61] & [p4<=0 & 0<=p4]] & [[p35<=0 & 0<=p35] & [p28<=1 & 1<=p28]]] | [[p5<=0 & 0<=p5] & [p60<=1 & 1<=p60]]] | [[p39<=0 & 0<=p39] | [p18<=0 & 0<=p18]]] | [[1<=p54 & p54<=1] | [[p11<=1 & 1<=p11] | [p33<=0 & 0<=p33]]]] & [1<=p56 & p56<=1]]] & [[1<=p39 & p39<=1] & [p50<=1 & 1<=p50]]]]
normalized: E [true U [[[[[[[p39<=0 & 0<=p39] | [p18<=0 & 0<=p18]] | [[[[p61<=1 & 1<=p61] & [p4<=0 & 0<=p4]] & [[p35<=0 & 0<=p35] & [p28<=1 & 1<=p28]]] | [[p5<=0 & 0<=p5] & [p60<=1 & 1<=p60]]]] | [[[p11<=1 & 1<=p11] | [p33<=0 & 0<=p33]] | [1<=p54 & p54<=1]]] & [1<=p56 & p56<=1]] & [0<=p58 & p58<=0]] & [[1<=p39 & p39<=1] & [p50<=1 & 1<=p50]]]]

abstracting: (1<=p50)
states: 16,384 (4)
abstracting: (p50<=1)
states: 278,528 (5)
abstracting: (p39<=1)
states: 278,528 (5)
abstracting: (1<=p39)
states: 131,072 (5)
abstracting: (p58<=0)
states: 147,456 (5)
abstracting: (0<=p58)
states: 278,528 (5)
abstracting: (p56<=1)
states: 278,528 (5)
abstracting: (1<=p56)
states: 131,072 (5)
abstracting: (p54<=1)
states: 278,528 (5)
abstracting: (1<=p54)
states: 131,072 (5)
abstracting: (0<=p33)
states: 278,528 (5)
abstracting: (p33<=0)
states: 147,456 (5)
abstracting: (1<=p11)
states: 147,456 (5)
abstracting: (p11<=1)
states: 278,528 (5)
abstracting: (1<=p60)
states: 16,384 (4)
abstracting: (p60<=1)
states: 278,528 (5)
abstracting: (0<=p5)
states: 278,528 (5)
abstracting: (p5<=0)
states: 131,072 (5)
abstracting: (1<=p28)
states: 131,072 (5)
abstracting: (p28<=1)
states: 278,528 (5)
abstracting: (0<=p35)
states: 278,528 (5)
abstracting: (p35<=0)
states: 147,456 (5)
abstracting: (0<=p4)
states: 278,528 (5)
abstracting: (p4<=0)
states: 147,456 (5)
abstracting: (1<=p61)
states: 131,072 (5)
abstracting: (p61<=1)
states: 278,528 (5)
abstracting: (0<=p18)
states: 278,528 (5)
abstracting: (p18<=0)
states: 147,456 (5)
abstracting: (0<=p39)
states: 278,528 (5)
abstracting: (p39<=0)
states: 147,456 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.362sec

checking: AG [[[[[p39<=1 & 1<=p39] | [p7<=0 & 0<=p7]] | [p36<=0 & 0<=p36]] | [[[p64<=1 & 1<=p64] | [p48<=0 & 0<=p48]] | [[[p14<=0 & 0<=p14] & [[p51<=1 & 1<=p51] & [[[p7<=0 & 0<=p7] | [p49<=1 & 1<=p49]] | [[p29<=0 & 0<=p29] | [p26<=1 & 1<=p26]]]]] | [[[p39<=0 & 0<=p39] | [p0<=1 & 1<=p0]] & [[[p45<=0 & 0<=p45] & [p32<=1 & 1<=p32]] | [[[[p13<=0 & 0<=p13] & [p43<=0 & 0<=p43]] & [[p2<=1 & 1<=p2] & [[p61<=0 & 0<=p61] | [[p54<=0 & 0<=p54] & [p51<=1 & 1<=p51]]]]] | [[p41<=0 & 0<=p41] & [p30<=1 & 1<=p30]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p30<=1 & 1<=p30] & [p41<=0 & 0<=p41]] | [[[[[p51<=1 & 1<=p51] & [p54<=0 & 0<=p54]] | [p61<=0 & 0<=p61]] & [p2<=1 & 1<=p2]] & [[p43<=0 & 0<=p43] & [p13<=0 & 0<=p13]]]] | [[p32<=1 & 1<=p32] & [p45<=0 & 0<=p45]]] & [[p0<=1 & 1<=p0] | [p39<=0 & 0<=p39]]] | [[[[[p26<=1 & 1<=p26] | [p29<=0 & 0<=p29]] | [[p49<=1 & 1<=p49] | [p7<=0 & 0<=p7]]] & [p51<=1 & 1<=p51]] & [p14<=0 & 0<=p14]]] | [[p48<=0 & 0<=p48] | [p64<=1 & 1<=p64]]] | [[p36<=0 & 0<=p36] | [[p7<=0 & 0<=p7] | [p39<=1 & 1<=p39]]]]]]]

abstracting: (1<=p39)
states: 131,072 (5)
abstracting: (p39<=1)
states: 278,528 (5)
abstracting: (0<=p7)
states: 278,528 (5)
abstracting: (p7<=0)
states: 131,072 (5)
abstracting: (0<=p36)
states: 278,528 (5)
abstracting: (p36<=0)
states: 262,144 (5)
abstracting: (1<=p64)
states: 131,072 (5)
abstracting: (p64<=1)
states: 278,528 (5)
abstracting: (0<=p48)
states: 278,528 (5)
abstracting: (p48<=0)
states: 147,456 (5)
abstracting: (0<=p14)
states: 278,528 (5)
abstracting: (p14<=0)
states: 147,456 (5)
abstracting: (1<=p51)
states: 131,072 (5)
abstracting: (p51<=1)
states: 278,528 (5)
abstracting: (0<=p7)
states: 278,528 (5)
abstracting: (p7<=0)
states: 131,072 (5)
abstracting: (1<=p49)
states: 131,072 (5)
abstracting: (p49<=1)
states: 278,528 (5)
abstracting: (0<=p29)
states: 278,528 (5)
abstracting: (p29<=0)
states: 131,072 (5)
abstracting: (1<=p26)
states: 131,072 (5)
abstracting: (p26<=1)
states: 278,528 (5)
abstracting: (0<=p39)
states: 278,528 (5)
abstracting: (p39<=0)
states: 147,456 (5)
abstracting: (1<=p0)
states: 131,072 (5)
abstracting: (p0<=1)
states: 278,528 (5)
abstracting: (0<=p45)
states: 278,528 (5)
abstracting: (p45<=0)
states: 262,144 (5)
abstracting: (1<=p32)
states: 16,384 (4)
abstracting: (p32<=1)
states: 278,528 (5)
abstracting: (0<=p13)
states: 278,528 (5)
abstracting: (p13<=0)
states: 131,072 (5)
abstracting: (0<=p43)
states: 278,528 (5)
abstracting: (p43<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
abstracting: (0<=p61)
states: 278,528 (5)
abstracting: (p61<=0)
states: 147,456 (5)
abstracting: (0<=p54)
states: 278,528 (5)
abstracting: (p54<=0)
states: 147,456 (5)
abstracting: (1<=p51)
states: 131,072 (5)
abstracting: (p51<=1)
states: 278,528 (5)
abstracting: (0<=p41)
states: 278,528 (5)
abstracting: (p41<=0)
states: 147,456 (5)
abstracting: (1<=p30)
states: 131,072 (5)
abstracting: (p30<=1)
states: 278,528 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

totally nodes used: 119475 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 148865 1174748 1323613
used/not used/entry size/cache size: 1218676 65890188 16 1024MB
basic ops cache: hits/miss/sum: 29476 169264 198740
used/not used/entry size/cache size: 315126 16462090 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4577 31169 35746
used/not used/entry size/cache size: 31151 8357457 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66995790
1 107155
2 5465
3 426
4 28
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.547sec


BK_STOP 1678531423931

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec


iterations count:4876 (19), effective:171 (0)

initing FirstDep: 0m 0.001sec


iterations count:6229 (24), effective:215 (0)

iterations count:2370 (9), effective:51 (0)

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="marciexred"
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 marciexred"
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 r138-smll-167819419200014"
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 ;