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-167813695100734.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-040, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 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 9.8M 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-040-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678662070328

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-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:01:12] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2023-03-12 23:01:12] [INFO ] Transformed 3684 places.
[2023-03-12 23:01:12] [INFO ] Transformed 9840 transitions.
[2023-03-12 23:01:12] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 16) seen :4
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-00 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 9840 rows 3684 cols
[2023-03-12 23:01:14] [INFO ] Computed 43 place invariants in 477 ms
[2023-03-12 23:01:15] [INFO ] After 1326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 23:01:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 83 ms returned sat
[2023-03-12 23:01:17] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 59 ms returned sat
[2023-03-12 23:01:31] [INFO ] After 13816ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-12 23:01:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 23:01:40] [INFO ] After 8916ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-03-12 23:01:40] [INFO ] After 8917ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 23:01:40] [INFO ] After 25109ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 11 different solutions.
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 916 ms.
Support contains 203 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 245 transitions
Trivial Post-agglo rules discarded 245 transitions
Performed 245 trivial Post agglomeration. Transition count delta: 245
Iterating post reduction 0 with 245 rules applied. Total rules applied 246 place count 3683 transition count 9595
Reduce places removed 245 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 256 rules applied. Total rules applied 502 place count 3438 transition count 9584
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 513 place count 3427 transition count 9584
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 513 place count 3427 transition count 9580
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 521 place count 3423 transition count 9580
Performed 1256 Post agglomeration using F-continuation condition.Transition count delta: 1256
Deduced a syphon composed of 1256 places in 13 ms
Reduce places removed 1256 places and 0 transitions.
Iterating global reduction 3 with 2512 rules applied. Total rules applied 3033 place count 2167 transition count 8324
Drop transitions removed 1189 transitions
Redundant transition composition rules discarded 1189 transitions
Iterating global reduction 3 with 1189 rules applied. Total rules applied 4222 place count 2167 transition count 7135
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4228 place count 2167 transition count 7129
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 4234 place count 2161 transition count 7129
Partial Free-agglomeration rule applied 1946 times.
Drop transitions removed 1946 transitions
Iterating global reduction 4 with 1946 rules applied. Total rules applied 6180 place count 2161 transition count 7129
Partial Free-agglomeration rule applied 135 times.
Drop transitions removed 135 transitions
Iterating global reduction 4 with 135 rules applied. Total rules applied 6315 place count 2161 transition count 7129
Applied a total of 6315 rules in 2472 ms. Remains 2161 /3684 variables (removed 1523) and now considering 7129/9840 (removed 2711) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2477 ms. Remains : 2161/3684 places, 7129/9840 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 9) seen :5
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7129 rows 2161 cols
[2023-03-12 23:01:44] [INFO ] Computed 42 place invariants in 179 ms
[2023-03-12 23:01:45] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:01:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-12 23:01:45] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-12 23:01:49] [INFO ] After 3879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:01:49] [INFO ] State equation strengthened by 6036 read => feed constraints.
[2023-03-12 23:01:53] [INFO ] After 3674ms SMT Verify possible using 6036 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 23:01:55] [INFO ] After 5754ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1195 ms.
[2023-03-12 23:01:56] [INFO ] After 11475ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 30 out of 2161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2161/2161 places, 7129/7129 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 2161 transition count 7119
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 2151 transition count 7118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 2150 transition count 7118
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 3 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 172 place count 2075 transition count 7043
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 2075 transition count 7041
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 2075 transition count 7040
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 2074 transition count 7040
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 2074 transition count 7039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 2073 transition count 7039
Partial Free-agglomeration rule applied 303 times.
Drop transitions removed 303 transitions
Iterating global reduction 5 with 303 rules applied. Total rules applied 481 place count 2073 transition count 7039
Applied a total of 481 rules in 1265 ms. Remains 2073 /2161 variables (removed 88) and now considering 7039/7129 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1271 ms. Remains : 2073/2161 places, 7039/7129 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 101945 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101945 steps, saw 34681 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7039 rows 2073 cols
[2023-03-12 23:02:01] [INFO ] Computed 42 place invariants in 300 ms
[2023-03-12 23:02:02] [INFO ] [Real]Absence check using 40 positive place invariants in 34 ms returned sat
[2023-03-12 23:02:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 23:02:02] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:02:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:02:02] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-12 23:02:05] [INFO ] After 2629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:02:05] [INFO ] State equation strengthened by 6607 read => feed constraints.
[2023-03-12 23:02:07] [INFO ] After 2524ms SMT Verify possible using 6607 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:02:09] [INFO ] After 4108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1251 ms.
[2023-03-12 23:02:10] [INFO ] After 8385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 30 out of 2073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2073/2073 places, 7039/7039 transitions.
Applied a total of 0 rules in 218 ms. Remains 2073 /2073 variables (removed 0) and now considering 7039/7039 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 2073/2073 places, 7039/7039 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2073/2073 places, 7039/7039 transitions.
Applied a total of 0 rules in 263 ms. Remains 2073 /2073 variables (removed 0) and now considering 7039/7039 (removed 0) transitions.
[2023-03-12 23:02:11] [INFO ] Invariant cache hit.
[2023-03-12 23:02:13] [INFO ] Implicit Places using invariants in 2427 ms returned []
[2023-03-12 23:02:13] [INFO ] Invariant cache hit.
[2023-03-12 23:02:14] [INFO ] State equation strengthened by 6607 read => feed constraints.
[2023-03-12 23:02:14] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 3868 ms to find 0 implicit places.
[2023-03-12 23:02:15] [INFO ] Redundant transitions in 873 ms returned []
[2023-03-12 23:02:15] [INFO ] Invariant cache hit.
[2023-03-12 23:02:19] [INFO ] Dead Transitions using invariants and state equation in 3342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8362 ms. Remains : 2073/2073 places, 7039/7039 transitions.
Graph (trivial) has 6435 edges and 2073 vertex of which 1840 / 2073 are part of one of the 2 SCC in 5 ms
Free SCC test removed 1838 places
Drop transitions removed 5006 transitions
Ensure Unique test removed 1589 transitions
Reduce isomorphic transitions removed 6595 transitions.
Graph (complete) has 688 edges and 235 vertex of which 122 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.0 ms
Discarding 113 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 122 transition count 260
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 153 place count 121 transition count 259
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 223 place count 51 transition count 153
Iterating global reduction 2 with 70 rules applied. Total rules applied 293 place count 51 transition count 153
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 327 place count 51 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 50 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 50 transition count 116
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 4 with 2 rules applied. Total rules applied 332 place count 49 transition count 115
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 4 with 2 rules applied. Total rules applied 334 place count 48 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 48 transition count 113
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 341 place count 48 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 48 transition count 106
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 344 place count 47 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 47 transition count 104
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 347 place count 46 transition count 103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 349 place count 44 transition count 101
Applied a total of 349 rules in 44 ms. Remains 44 /2073 variables (removed 2029) and now considering 101/7039 (removed 6938) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 101 rows 44 cols
[2023-03-12 23:02:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 23:02:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 23:02:19] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:02:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-12 23:02:19] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:02:19] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 23:02:19] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:02:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-12 23:02:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2073 places, 7039 transitions and 28057 arcs took 44 ms.
[2023-03-12 23:02:20] [INFO ] Flatten gal took : 464 ms
Total runtime 68034 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/521/inv_0_ --invariant=/tmp/521/inv_1_ --invariant=/tmp/521/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 13998168 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16085312 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:
++ 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
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-040"
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-040, 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-167813695100734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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