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-167819419200015.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419200015
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-01
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-02
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-03
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-04
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-05
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-06
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-07
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-08
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-09
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-10
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-11
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-12
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-13
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-14
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678531399095

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=ReachabilityFireability
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:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 10:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:43:22] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-11 10:43:22] [INFO ] Transformed 75 places.
[2023-03-11 10:43:22] [INFO ] Transformed 255 transitions.
[2023-03-11 10:43:22] [INFO ] Found NUPN structural information;
[2023-03-11 10:43:22] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Dekker-PT-015-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 11) seen :7
FORMULA Dekker-PT-015-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 10:43:24] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-11 10:43:24] [INFO ] Computed 45 place invariants in 8 ms
[2023-03-11 10:43:24] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 10:43:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2023-03-11 10:43:24] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-11 10:43:24] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-11 10:43:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:24] [INFO ] After 33ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 9 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
[2023-03-11 10:43:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2023-03-11 10:43:25] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-11 10:43:25] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA Dekker-PT-015-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 14 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 56 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 322 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 1267280 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{0=1}
Probabilistic random walk after 1267280 steps, saw 98224 distinct states, run finished after 3002 ms. (steps per millisecond=422 ) properties seen :1
FORMULA Dekker-PT-015-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-11 10:43:28] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:28] [INFO ] Invariant cache hit.
[2023-03-11 10:43:28] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-11 10:43:28] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-11 10:43:28] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 10:43:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2023-03-11 10:43:29] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-11 10:43:29] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 10:43:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:29] [INFO ] After 20ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:43:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 734 ms
[2023-03-11 10:43:29] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 10:43:29] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 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 34 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 34 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1446576 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :{}
Probabilistic random walk after 1446576 steps, saw 104877 distinct states, run finished after 3002 ms. (steps per millisecond=481 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 10:43:33] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:33] [INFO ] Invariant cache hit.
[2023-03-11 10:43:33] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-11 10:43:33] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-11 10:43:33] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 10:43:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 10:43:33] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-11 10:43:33] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 10:43:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:33] [INFO ] After 15ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 10:43:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 604 ms
[2023-03-11 10:43:33] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 10:43:33] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 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 28 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 29 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 21 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:43:33] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:33] [INFO ] Invariant cache hit.
[2023-03-11 10:43:34] [INFO ] Implicit Places using invariants in 273 ms returned [30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 278 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/75 places, 255/255 transitions.
Applied a total of 0 rules in 18 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 318 ms. Remains : 60/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1523072 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1523072 steps, saw 114593 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 10:43:37] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2023-03-11 10:43:37] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-11 10:43:37] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2023-03-11 10:43:37] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 10:43:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 10:43:37] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 10:43:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:37] [INFO ] After 9ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 10:43:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 380 ms
[2023-03-11 10:43:37] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 10:43:38] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 60/60 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:43:38] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:38] [INFO ] Invariant cache hit.
[2023-03-11 10:43:38] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-11 10:43:38] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:38] [INFO ] Invariant cache hit.
[2023-03-11 10:43:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:43:38] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-11 10:43:38] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 10:43:38] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:43:38] [INFO ] Invariant cache hit.
[2023-03-11 10:43:38] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 60/60 places, 255/255 transitions.
Graph (complete) has 90 edges and 60 vertex of which 8 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.3 ms
Discarding 52 places :
Also discarding 221 output transitions
Drop transitions removed 221 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 8 transition count 8
Applied a total of 27 rules in 7 ms. Remains 8 /60 variables (removed 52) and now considering 8/255 (removed 247) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 10:43:38] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 10:43:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 10:43:38] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 10:43:38] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 10:43:38] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-11 10:43:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-11 10:43:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 255 transitions and 1590 arcs took 5 ms.
[2023-03-11 10:43:39] [INFO ] Flatten gal took : 94 ms
Total runtime 16548 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Dekker_PT_015
(NrP: 60 NrTr: 255 NrArc: 1590)

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

net check time: 0m 0.000sec

init dd package: 0m 3.887sec


RS generation: 0m 0.101sec


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



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

checking: EF [[[[p34<=1 & 1<=p34] & [1<=p5 & p5<=1]] & [[p11<=1 & 1<=p11] & [1<=p41 & p41<=1]]]]
normalized: E [true U [[[p34<=1 & 1<=p34] & [1<=p5 & p5<=1]] & [[p11<=1 & 1<=p11] & [1<=p41 & p41<=1]]]]

abstracting: (p41<=1)
states: 278,528 (5)
abstracting: (1<=p41)
states: 16,384 (4)
abstracting: (1<=p11)
states: 147,456 (5)
abstracting: (p11<=1)
states: 278,528 (5)
abstracting: (p5<=1)
states: 278,528 (5)
abstracting: (1<=p5)
states: 147,456 (5)
abstracting: (1<=p34)
states: 131,072 (5)
abstracting: (p34<=1)
states: 278,528 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

totally nodes used: 36121 (3.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 103895 628813 732708
used/not used/entry size/cache size: 646184 66462680 16 1024MB
basic ops cache: hits/miss/sum: 8986 37708 46694
used/not used/entry size/cache size: 68527 16708689 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: 711 3748 4459
used/not used/entry size/cache size: 3748 8384860 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 67073628
1 34374
2 839
3 23
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.049sec


BK_STOP 1678531426440

--------------------
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 ReachabilityFireability -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.003sec


iterations count:4584 (17), effective:171 (0)

initing FirstDep: 0m 0.000sec


iterations count:2513 (9), effective:78 (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="ReachabilityFireability"
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 ReachabilityFireability"
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-167819419200015"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;