Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100750.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 22M 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 CANInsertWithFailure-PT-060-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678663390835

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=CANInsertWithFailure-PT-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:23:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:23:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:23:13] [INFO ] Load time of PNML (sax parser for PT used): 536 ms
[2023-03-12 23:23:13] [INFO ] Transformed 7924 places.
[2023-03-12 23:23:13] [INFO ] Transformed 21960 transitions.
[2023-03-12 23:23:13] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 707 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 872 ms. (steps per millisecond=11 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 21960 rows 7924 cols
[2023-03-12 23:23:17] [INFO ] Computed 63 place invariants in 2492 ms
[2023-03-12 23:23:20] [INFO ] After 2699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 23:23:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 176 ms returned sat
[2023-03-12 23:23:23] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 157 ms returned sat
[2023-03-12 23:23:43] [INFO ] After 18587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-12 23:23:43] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:23:45] [INFO ] After 1870ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-12 23:23:45] [INFO ] After 1871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 23:23:45] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 370 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 357 place count 7923 transition count 21604
Reduce places removed 356 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 379 rules applied. Total rules applied 736 place count 7567 transition count 21581
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 759 place count 7544 transition count 21581
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 759 place count 7544 transition count 21572
Deduced a syphon composed of 9 places in 22 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 777 place count 7535 transition count 21572
Performed 3202 Post agglomeration using F-continuation condition.Transition count delta: 3202
Deduced a syphon composed of 3202 places in 11 ms
Reduce places removed 3202 places and 0 transitions.
Iterating global reduction 3 with 6404 rules applied. Total rules applied 7181 place count 4333 transition count 18370
Drop transitions removed 3105 transitions
Redundant transition composition rules discarded 3105 transitions
Iterating global reduction 3 with 3105 rules applied. Total rules applied 10286 place count 4333 transition count 15265
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 10294 place count 4333 transition count 15257
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 10302 place count 4325 transition count 15257
Partial Free-agglomeration rule applied 3880 times.
Drop transitions removed 3880 transitions
Iterating global reduction 4 with 3880 rules applied. Total rules applied 14182 place count 4325 transition count 15257
Partial Free-agglomeration rule applied 411 times.
Drop transitions removed 411 transitions
Iterating global reduction 4 with 411 rules applied. Total rules applied 14593 place count 4325 transition count 15257
Applied a total of 14593 rules in 7283 ms. Remains 4325 /7924 variables (removed 3599) and now considering 15257/21960 (removed 6703) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7288 ms. Remains : 4325/7924 places, 15257/21960 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 13) seen :3
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 15257 rows 4325 cols
[2023-03-12 23:23:54] [INFO ] Computed 62 place invariants in 1039 ms
[2023-03-12 23:23:55] [INFO ] After 1136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:23:56] [INFO ] [Nat]Absence check using 60 positive place invariants in 46 ms returned sat
[2023-03-12 23:23:56] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 52 ms returned sat
[2023-03-12 23:24:12] [INFO ] After 14984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:24:12] [INFO ] State equation strengthened by 12853 read => feed constraints.
[2023-03-12 23:24:20] [INFO ] After 8562ms SMT Verify possible using 12853 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:24:20] [INFO ] After 8563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:24:20] [INFO ] After 25109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 693 ms.
Support contains 228 out of 4325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4325/4325 places, 15257/15257 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 4325 transition count 15252
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 4320 transition count 15251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 4319 transition count 15251
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 134 place count 4258 transition count 15190
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 4258 transition count 15186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 4258 transition count 15184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 4256 transition count 15184
Partial Free-agglomeration rule applied 195 times.
Drop transitions removed 195 transitions
Iterating global reduction 4 with 195 rules applied. Total rules applied 337 place count 4256 transition count 15184
Applied a total of 337 rules in 3447 ms. Remains 4256 /4325 variables (removed 69) and now considering 15184/15257 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3447 ms. Remains : 4256/4325 places, 15184/15257 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 10) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 15184 rows 4256 cols
[2023-03-12 23:24:26] [INFO ] Computed 62 place invariants in 679 ms
[2023-03-12 23:24:27] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:24:28] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2023-03-12 23:24:28] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 66 ms returned sat
[2023-03-12 23:24:43] [INFO ] After 13897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 23:24:43] [INFO ] State equation strengthened by 13371 read => feed constraints.
[2023-03-12 23:24:52] [INFO ] After 9340ms SMT Verify possible using 13371 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:24:52] [INFO ] After 9341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 23:24:52] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 467 ms.
Support contains 222 out of 4256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4256/4256 places, 15184/15184 transitions.
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 6 place count 4253 transition count 15181
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 4253 transition count 15181
Applied a total of 10 rules in 1924 ms. Remains 4253 /4256 variables (removed 3) and now considering 15181/15184 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1924 ms. Remains : 4253/4256 places, 15181/15184 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 8) seen :1
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 15181 rows 4253 cols
[2023-03-12 23:24:56] [INFO ] Computed 62 place invariants in 639 ms
[2023-03-12 23:24:57] [INFO ] After 833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:24:57] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2023-03-12 23:24:57] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 51 ms returned sat
[2023-03-12 23:25:11] [INFO ] After 12800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:25:11] [INFO ] State equation strengthened by 13498 read => feed constraints.
[2023-03-12 23:25:22] [INFO ] After 11112ms SMT Verify possible using 13498 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:25:22] [INFO ] After 11114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 23:25:22] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 553 ms.
Support contains 210 out of 4253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4253/4253 places, 15181/15181 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 4248 transition count 15176
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 4248 transition count 15176
Applied a total of 17 rules in 2022 ms. Remains 4248 /4253 variables (removed 5) and now considering 15176/15181 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2022 ms. Remains : 4248/4253 places, 15176/15181 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 68436 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68436 steps, saw 52243 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 15176 rows 4248 cols
[2023-03-12 23:25:29] [INFO ] Computed 62 place invariants in 817 ms
[2023-03-12 23:25:30] [INFO ] After 959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:25:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 42 ms returned sat
[2023-03-12 23:25:31] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 53 ms returned sat
[2023-03-12 23:25:44] [INFO ] After 13047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:25:44] [INFO ] State equation strengthened by 13515 read => feed constraints.
[2023-03-12 23:25:55] [INFO ] After 10713ms SMT Verify possible using 13515 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:25:55] [INFO ] After 10714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:25:55] [INFO ] After 25111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 376 ms.
Support contains 210 out of 4248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4248/4248 places, 15176/15176 transitions.
Applied a total of 0 rules in 691 ms. Remains 4248 /4248 variables (removed 0) and now considering 15176/15176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 4248/4248 places, 15176/15176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4248/4248 places, 15176/15176 transitions.
Applied a total of 0 rules in 687 ms. Remains 4248 /4248 variables (removed 0) and now considering 15176/15176 (removed 0) transitions.
[2023-03-12 23:25:57] [INFO ] Invariant cache hit.
[2023-03-12 23:25:59] [INFO ] Implicit Places using invariants in 2821 ms returned []
Implicit Place search using SMT only with invariants took 2821 ms to find 0 implicit places.
[2023-03-12 23:25:59] [INFO ] Invariant cache hit.
[2023-03-12 23:26:06] [INFO ] Dead Transitions using invariants and state equation in 7032 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10545 ms. Remains : 4248/4248 places, 15176/15176 transitions.
Graph (trivial) has 12880 edges and 4248 vertex of which 2844 / 4248 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2842 places
Drop transitions removed 7467 transitions
Ensure Unique test removed 3312 transitions
Reduce isomorphic transitions removed 10779 transitions.
Graph (complete) has 4847 edges and 1406 vertex of which 1246 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.1 ms
Discarding 160 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Drop transitions removed 563 transitions
Reduce isomorphic transitions removed 563 transitions.
Iterating post reduction 0 with 563 rules applied. Total rules applied 565 place count 1246 transition count 3788
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 565 place count 1246 transition count 3784
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 573 place count 1242 transition count 3784
Discarding 626 places :
Symmetric choice reduction at 1 with 626 rule applications. Total rules 1199 place count 616 transition count 2318
Iterating global reduction 1 with 626 rules applied. Total rules applied 1825 place count 616 transition count 2318
Ensure Unique test removed 501 transitions
Reduce isomorphic transitions removed 501 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 2326 place count 616 transition count 1817
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 2407 place count 535 transition count 1655
Iterating global reduction 2 with 81 rules applied. Total rules applied 2488 place count 535 transition count 1655
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 2569 place count 535 transition count 1574
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2571 place count 534 transition count 1573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2572 place count 534 transition count 1572
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 2600 place count 534 transition count 1544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 2601 place count 534 transition count 1543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2602 place count 533 transition count 1543
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2606 place count 531 transition count 1541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2608 place count 531 transition count 1539
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2609 place count 531 transition count 1538
Free-agglomeration rule applied 234 times with reduction of 12 identical transitions.
Iterating global reduction 7 with 234 rules applied. Total rules applied 2843 place count 531 transition count 1292
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 7 with 522 rules applied. Total rules applied 3365 place count 297 transition count 1004
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 3397 place count 297 transition count 972
Partial Free-agglomeration rule applied 152 times.
Drop transitions removed 152 transitions
Iterating global reduction 8 with 152 rules applied. Total rules applied 3549 place count 297 transition count 972
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3553 place count 293 transition count 968
Iterating global reduction 8 with 4 rules applied. Total rules applied 3557 place count 293 transition count 968
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3558 place count 293 transition count 968
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3562 place count 289 transition count 964
Applied a total of 3562 rules in 680 ms. Remains 289 /4248 variables (removed 3959) and now considering 964/15176 (removed 14212) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 964 rows 289 cols
[2023-03-12 23:26:07] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 23:26:07] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:26:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 0 ms returned sat
[2023-03-12 23:26:08] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:26:08] [INFO ] After 731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-12 23:26:08] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:26:08] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-12 23:26:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4248 places, 15176 transitions and 58956 arcs took 67 ms.
[2023-03-12 23:26:09] [INFO ] Flatten gal took : 596 ms
Total runtime 177172 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/536/inv_0_ --invariant=/tmp/536/inv_1_ --invariant=/tmp/536/inv_2_ --invariant=/tmp/536/inv_3_ --invariant=/tmp/536/inv_4_ --invariant=/tmp/536/inv_5_ --invariant=/tmp/536/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11723120 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16065104 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="CANInsertWithFailure-PT-060"
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 CANInsertWithFailure-PT-060, 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 r041-tajo-167813695100750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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