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.r107-tall-167814484200422.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 smartxred
Input is DES-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 79K 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 DES-PT-10b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678368591991

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 13:29:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 13:29:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:29:53] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-09 13:29:53] [INFO ] Transformed 320 places.
[2023-03-09 13:29:53] [INFO ] Transformed 271 transitions.
[2023-03-09 13:29:53] [INFO ] Found NUPN structural information;
[2023-03-09 13:29:53] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 88 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 12) seen :8
FORMULA DES-PT-10b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 271 rows 320 cols
[2023-03-09 13:29:54] [INFO ] Computed 65 place invariants in 19 ms
[2023-03-09 13:29:54] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:29:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 13:29:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 13:29:55] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 13:29:55] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 4 ms to minimize.
[2023-03-09 13:29:55] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-09 13:29:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-09 13:29:55] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-09 13:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-09 13:29:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 346 ms
[2023-03-09 13:29:56] [INFO ] After 1791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-09 13:29:57] [INFO ] After 2522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 106 ms.
Support contains 65 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 316 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 316 transition count 266
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 313 transition count 261
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 17 place count 308 transition count 261
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 17 place count 308 transition count 255
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 29 place count 302 transition count 255
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 45 place count 286 transition count 239
Iterating global reduction 3 with 16 rules applied. Total rules applied 61 place count 286 transition count 239
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 70 place count 277 transition count 230
Iterating global reduction 3 with 9 rules applied. Total rules applied 79 place count 277 transition count 230
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 88 place count 277 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 276 transition count 221
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 183 place count 229 transition count 174
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 229 transition count 173
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 190 place count 229 transition count 167
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 196 place count 223 transition count 167
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 223 transition count 166
Applied a total of 197 rules in 116 ms. Remains 223 /320 variables (removed 97) and now considering 166/271 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 223/320 places, 166/271 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
FORMULA DES-PT-10b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 166 rows 223 cols
[2023-03-09 13:29:57] [INFO ] Computed 63 place invariants in 10 ms
[2023-03-09 13:29:57] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:29:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 13:29:57] [INFO ] [Nat]Absence check using 33 positive and 30 generalized place invariants in 16 ms returned sat
[2023-03-09 13:29:57] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:29:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 13:29:57] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 13:29:58] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-09 13:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-09 13:29:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2023-03-09 13:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-09 13:29:58] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 13:29:58] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 50 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 166/166 transitions.
Graph (complete) has 523 edges and 223 vertex of which 218 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 218 transition count 161
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 214 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 214 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 213 transition count 160
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 23 place count 207 transition count 154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 207 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 206 transition count 152
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 206 transition count 152
Applied a total of 28 rules in 26 ms. Remains 206 /223 variables (removed 17) and now considering 152/166 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 206/223 places, 152/166 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 995418 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 995418 steps, saw 151177 distinct states, run finished after 3002 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 206 cols
[2023-03-09 13:30:01] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-09 13:30:01] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:30:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-09 13:30:01] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-09 13:30:01] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 13:30:01] [INFO ] After 85ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2023-03-09 13:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 13:30:02] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-09 13:30:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-09 13:30:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-09 13:30:02] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-09 13:30:02] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 50 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 152/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-09 13:30:02] [INFO ] Invariant cache hit.
[2023-03-09 13:30:02] [INFO ] Implicit Places using invariants in 101 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 121 ms. Remains : 205/206 places, 152/152 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1136222 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :{}
Probabilistic random walk after 1136222 steps, saw 172260 distinct states, run finished after 3001 ms. (steps per millisecond=378 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 205 cols
[2023-03-09 13:30:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-09 13:30:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:30:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-09 13:30:05] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-09 13:30:05] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 13:30:05] [INFO ] After 88ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:06] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-09 13:30:06] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 50 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-09 13:30:06] [INFO ] Invariant cache hit.
[2023-03-09 13:30:06] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 13:30:06] [INFO ] Invariant cache hit.
[2023-03-09 13:30:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 13:30:06] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-09 13:30:06] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 13:30:06] [INFO ] Invariant cache hit.
[2023-03-09 13:30:06] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 13:30:06] [INFO ] Invariant cache hit.
[2023-03-09 13:30:06] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:30:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-09 13:30:06] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-09 13:30:06] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-09 13:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 13:30:06] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-09 13:30:06] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 13:30:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-09 13:30:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 152 transitions and 601 arcs took 2 ms.
[2023-03-09 13:30:07] [INFO ] Flatten gal took : 38 ms
Total runtime 13781 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 10b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 205 places, 152 transitions, 601 arcs.
Final Score: 2370.48
Took : 6 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DES-PT-10b-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P29)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P29)) ) ) | ( ( (tk(P71)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P71)) ) ) )))
PROPERTY: DES-PT-10b-ReachabilityCardinality-10 (reachable & potential(( ( ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) | ( ( ( ( ( (tk(P129)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P129)) ) ) & ( ( (tk(P165)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P165)) ) ) ) & ( ( ( (tk(P14)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P14)) ) ) & ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) ) ) | ( ( ( ( (tk(P140)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P140)) ) ) & ( ( ( (tk(P118)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P118)) ) ) & ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) ) ) & ( ( ( ( (tk(P187)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P187)) ) ) | ( ( (tk(P152)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P152)) ) ) ) & ( ( ( ( (tk(P111)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P111)) ) ) | ( ( ( (tk(P14)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P14)) ) ) & ( ( (tk(P1)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1)) ) ) ) ) & ( ( ( ( (tk(P56)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P56)) ) ) | ( ( ( (tk(P197)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P197)) ) ) | ( ( (tk(P29)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P29)) ) ) ) ) | ( ( ( (tk(P53)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P53)) ) ) | ( ( ( ( (tk(P54)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P54)) ) ) & ( ( (tk(P143)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P143)) ) ) ) | ( ( ( ( (tk(P95)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P95)) ) ) | ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) ) & ( ( ( (tk(P181)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P181)) ) ) | ( ( ( (tk(P74)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P74)) ) ) | ( ( (tk(P188)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P188)) ) ) ) ) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) & ( ( ( (tk(P196)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P196)) ) ) | ( ( ( ( (tk(P177)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P177)) ) ) | ( ( (tk(P72)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P72)) ) ) ) & ( ( ( ( (tk(P79)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P79)) ) ) | ( ( (tk(P137)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P137)) ) ) ) | ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) | ( ( (tk(P102)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P102)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P81)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P81)) ) ) & ( ( ( (tk(P183)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P183)) ) ) & ( ( (tk(P175)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P175)) ) ) ) ) | ( ( ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) & ( ( ( (tk(P68)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P68)) ) ) & ( ( (tk(P178)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P178)) ) ) ) ) & ( ( ( ( ( ( (tk(P96)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P96)) ) ) & ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) ) | ( ( ( (tk(P103)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P103)) ) ) & ( ( (tk(P102)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P102)) ) ) ) ) & ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) | ( ( (tk(P59)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P59)) ) ) ) ) & ( ( ( ( (tk(P149)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P149)) ) ) | ( ( ( (tk(P66)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P66)) ) ) | ( ( ( (tk(P73)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P73)) ) ) & ( ( ( (tk(P20)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P20)) ) ) & ( ( (tk(P125)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P125)) ) ) ) ) ) ) & ( ( ( (tk(P199)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P199)) ) ) | ( ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) | ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) & ( ( ( ( (tk(P156)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P156)) ) ) & ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) ) | ( ( ( (tk(P85)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P85)) ) ) & ( ( (tk(P72)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P72)) ) ) ) ) ) ) ) ) ) ) ) ) )))
FORMULA DES-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678368638509

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

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="DES-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DES-PT-10b, 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 r107-tall-167814484200422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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