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.r521-tall-167987246200070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246200070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 31 16:48 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 Anderson-PT-12-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680871319444

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 12:42:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 12:42:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 12:42:01] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2023-04-07 12:42:01] [INFO ] Transformed 889 places.
[2023-04-07 12:42:02] [INFO ] Transformed 4152 transitions.
[2023-04-07 12:42:02] [INFO ] Found NUPN structural information;
[2023-04-07 12:42:02] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 14) seen :6
FORMULA Anderson-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 4152 rows 889 cols
[2023-04-07 12:42:03] [INFO ] Computed 27 invariants in 172 ms
[2023-04-07 12:42:04] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 12:42:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 146 ms returned sat
[2023-04-07 12:42:05] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 31 ms returned sat
[2023-04-07 12:42:10] [INFO ] After 5344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 12:42:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:15] [INFO ] After 4955ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 12:42:18] [INFO ] After 7272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1808 ms.
[2023-04-07 12:42:20] [INFO ] After 15525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 91 ms.
Support contains 54 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 111 Pre rules applied. Total rules applied 0 place count 889 transition count 4041
Deduced a syphon composed of 111 places in 29 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 0 with 222 rules applied. Total rules applied 222 place count 778 transition count 4041
Discarding 247 places :
Symmetric choice reduction at 0 with 247 rule applications. Total rules 469 place count 531 transition count 1022
Iterating global reduction 0 with 247 rules applied. Total rules applied 716 place count 531 transition count 1022
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 11 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 736 place count 521 transition count 1012
Applied a total of 736 rules in 430 ms. Remains 521 /889 variables (removed 368) and now considering 1012/4152 (removed 3140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 521/889 places, 1012/4152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 260474 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{1=1}
Probabilistic random walk after 260474 steps, saw 200982 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1012 rows 521 cols
[2023-04-07 12:42:24] [INFO ] Computed 27 invariants in 21 ms
[2023-04-07 12:42:24] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 12:42:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-04-07 12:42:24] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 21 ms returned sat
[2023-04-07 12:42:25] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 12:42:25] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:26] [INFO ] After 732ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 12:42:26] [INFO ] After 1257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 452 ms.
[2023-04-07 12:42:27] [INFO ] After 3060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 30 ms.
Support contains 51 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 1012/1012 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 521 transition count 1011
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 520 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 519 transition count 988
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 519 transition count 988
Applied a total of 4 rules in 92 ms. Remains 519 /521 variables (removed 2) and now considering 988/1012 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 519/521 places, 988/1012 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 988 rows 519 cols
[2023-04-07 12:42:27] [INFO ] Computed 27 invariants in 8 ms
[2023-04-07 12:42:28] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 12:42:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 12:42:28] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 15 ms returned sat
[2023-04-07 12:42:29] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 12:42:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:29] [INFO ] After 475ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 12:42:30] [INFO ] After 1010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 484 ms.
[2023-04-07 12:42:30] [INFO ] After 2431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Anderson-PT-12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 13 ms.
Support contains 33 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 988/988 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 519 transition count 984
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 515 transition count 984
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 512 transition count 915
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 512 transition count 915
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 509 transition count 912
Applied a total of 20 rules in 46 ms. Remains 509 /519 variables (removed 10) and now considering 912/988 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 509/519 places, 912/988 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 494893 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494893 steps, saw 392761 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 912 rows 509 cols
[2023-04-07 12:42:34] [INFO ] Computed 27 invariants in 7 ms
[2023-04-07 12:42:34] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:42:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-04-07 12:42:34] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 17 ms returned sat
[2023-04-07 12:42:39] [INFO ] After 4943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 12:42:39] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:39] [INFO ] After 373ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 12:42:40] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 2 ms to minimize.
[2023-04-07 12:42:40] [INFO ] Deduced a trap composed of 210 places in 318 ms of which 1 ms to minimize.
[2023-04-07 12:42:40] [INFO ] Deduced a trap composed of 255 places in 205 ms of which 0 ms to minimize.
[2023-04-07 12:42:41] [INFO ] Deduced a trap composed of 142 places in 243 ms of which 1 ms to minimize.
[2023-04-07 12:42:41] [INFO ] Deduced a trap composed of 221 places in 224 ms of which 3 ms to minimize.
[2023-04-07 12:42:41] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-04-07 12:42:42] [INFO ] Deduced a trap composed of 158 places in 390 ms of which 1 ms to minimize.
[2023-04-07 12:42:42] [INFO ] Deduced a trap composed of 120 places in 372 ms of which 1 ms to minimize.
[2023-04-07 12:42:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2708 ms
[2023-04-07 12:42:42] [INFO ] After 3418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-04-07 12:42:43] [INFO ] After 8821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 33 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 912/912 transitions.
Applied a total of 0 rules in 21 ms. Remains 509 /509 variables (removed 0) and now considering 912/912 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 509/509 places, 912/912 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 912/912 transitions.
Applied a total of 0 rules in 42 ms. Remains 509 /509 variables (removed 0) and now considering 912/912 (removed 0) transitions.
[2023-04-07 12:42:43] [INFO ] Invariant cache hit.
[2023-04-07 12:42:43] [INFO ] Implicit Places using invariants in 777 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 788 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/509 places, 912/912 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 508 transition count 803
Reduce places removed 109 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 127 rules applied. Total rules applied 236 place count 399 transition count 785
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 254 place count 381 transition count 785
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 266 place count 381 transition count 773
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 278 place count 369 transition count 773
Applied a total of 278 rules in 60 ms. Remains 369 /508 variables (removed 139) and now considering 773/912 (removed 139) transitions.
// Phase 1: matrix 773 rows 369 cols
[2023-04-07 12:42:44] [INFO ] Computed 26 invariants in 31 ms
[2023-04-07 12:42:44] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-04-07 12:42:44] [INFO ] Invariant cache hit.
[2023-04-07 12:42:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:46] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 369/509 places, 773/912 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2969 ms. Remains : 369/509 places, 773/912 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 570647 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570647 steps, saw 441908 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 12:42:49] [INFO ] Invariant cache hit.
[2023-04-07 12:42:49] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:42:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 12:42:49] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 18 ms returned sat
[2023-04-07 12:42:50] [INFO ] After 977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 12:42:50] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:50] [INFO ] After 235ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 12:42:50] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-04-07 12:42:51] [INFO ] After 1692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 33 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 773/773 transitions.
Applied a total of 0 rules in 20 ms. Remains 369 /369 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 369/369 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 773/773 transitions.
Applied a total of 0 rules in 28 ms. Remains 369 /369 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-04-07 12:42:51] [INFO ] Invariant cache hit.
[2023-04-07 12:42:51] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-04-07 12:42:51] [INFO ] Invariant cache hit.
[2023-04-07 12:42:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:42:53] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
[2023-04-07 12:42:53] [INFO ] Redundant transitions in 37 ms returned []
[2023-04-07 12:42:53] [INFO ] Invariant cache hit.
[2023-04-07 12:42:53] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2685 ms. Remains : 369/369 places, 773/773 transitions.
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 128 Pre rules applied. Total rules applied 0 place count 369 transition count 645
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 0 with 256 rules applied. Total rules applied 256 place count 241 transition count 645
Applied a total of 256 rules in 12 ms. Remains 241 /369 variables (removed 128) and now considering 645/773 (removed 128) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 645 rows 241 cols
[2023-04-07 12:42:53] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 12:42:53] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:42:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 12:42:54] [INFO ] [Nat]Absence check using 15 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 12:42:54] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 12:42:54] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-04-07 12:42:54] [INFO ] After 906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-07 12:42:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-04-07 12:42:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 369 places, 773 transitions and 3054 arcs took 4 ms.
[2023-04-07 12:42:55] [INFO ] Flatten gal took : 169 ms
Total runtime 53776 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/558/inv_0_ --invariant=/tmp/558/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15317256 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101060 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="Anderson-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-12, 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 r521-tall-167987246200070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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