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.r043-tajo-167813697200726.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 smartxred
Input is CANInsertWithFailure-PT-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200726
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 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 5.6M 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-030-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678801783497

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:49:45] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-14 13:49:45] [INFO ] Transformed 2164 places.
[2023-03-14 13:49:45] [INFO ] Transformed 5580 transitions.
[2023-03-14 13:49:45] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 13 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 16) seen :7
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5580 rows 2164 cols
[2023-03-14 13:49:46] [INFO ] Computed 33 place invariants in 177 ms
[2023-03-14 13:49:47] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-14 13:49:47] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-14 13:49:47] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 13:49:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2023-03-14 13:49:48] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 30 ms returned sat
[2023-03-14 13:49:52] [INFO ] After 4498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 13:49:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-14 13:50:03] [INFO ] After 10244ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-14 13:50:09] [INFO ] After 16646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2889 ms.
[2023-03-14 13:50:12] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 261 ms.
Support contains 38 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 2163 transition count 5381
Reduce places removed 199 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 203 rules applied. Total rules applied 403 place count 1964 transition count 5377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 407 place count 1960 transition count 5377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 407 place count 1960 transition count 5376
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 409 place count 1959 transition count 5376
Performed 745 Post agglomeration using F-continuation condition.Transition count delta: 745
Deduced a syphon composed of 745 places in 3 ms
Reduce places removed 745 places and 0 transitions.
Iterating global reduction 3 with 1490 rules applied. Total rules applied 1899 place count 1214 transition count 4631
Drop transitions removed 691 transitions
Redundant transition composition rules discarded 691 transitions
Iterating global reduction 3 with 691 rules applied. Total rules applied 2590 place count 1214 transition count 3940
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 2595 place count 1214 transition count 3935
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2600 place count 1209 transition count 3935
Partial Free-agglomeration rule applied 1045 times.
Drop transitions removed 1045 transitions
Iterating global reduction 4 with 1045 rules applied. Total rules applied 3645 place count 1209 transition count 3935
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 3679 place count 1209 transition count 3935
Applied a total of 3679 rules in 1401 ms. Remains 1209 /2164 variables (removed 955) and now considering 3935/5580 (removed 1645) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1415 ms. Remains : 1209/2164 places, 3935/5580 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 8) seen :2
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) 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 6) seen :1
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3935 rows 1209 cols
[2023-03-14 13:50:14] [INFO ] Computed 32 place invariants in 132 ms
[2023-03-14 13:50:15] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:50:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-14 13:50:15] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-14 13:50:16] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:50:16] [INFO ] State equation strengthened by 3467 read => feed constraints.
[2023-03-14 13:50:18] [INFO ] After 1761ms SMT Verify possible using 3467 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:50:19] [INFO ] After 3114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 999 ms.
[2023-03-14 13:50:20] [INFO ] After 5694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 76 ms.
Support contains 10 out of 1209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1209/1209 places, 3935/3935 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1209 transition count 3934
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1208 transition count 3934
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 28 place count 1195 transition count 3921
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 1195 transition count 3920
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1195 transition count 3919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 1194 transition count 3919
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 3 with 95 rules applied. Total rules applied 126 place count 1194 transition count 3919
Applied a total of 126 rules in 626 ms. Remains 1194 /1209 variables (removed 15) and now considering 3919/3935 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 627 ms. Remains : 1194/1209 places, 3919/3935 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 199227 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199227 steps, saw 37569 distinct states, run finished after 3004 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3919 rows 1194 cols
[2023-03-14 13:50:25] [INFO ] Computed 32 place invariants in 60 ms
[2023-03-14 13:50:25] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:50:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2023-03-14 13:50:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-14 13:50:26] [INFO ] After 1002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:50:26] [INFO ] State equation strengthened by 3671 read => feed constraints.
[2023-03-14 13:50:28] [INFO ] After 1600ms SMT Verify possible using 3671 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:50:29] [INFO ] After 2808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 953 ms.
[2023-03-14 13:50:30] [INFO ] After 5078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 48 ms.
Support contains 10 out of 1194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1194/1194 places, 3919/3919 transitions.
Applied a total of 0 rules in 86 ms. Remains 1194 /1194 variables (removed 0) and now considering 3919/3919 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1194/1194 places, 3919/3919 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1194/1194 places, 3919/3919 transitions.
Applied a total of 0 rules in 81 ms. Remains 1194 /1194 variables (removed 0) and now considering 3919/3919 (removed 0) transitions.
[2023-03-14 13:50:30] [INFO ] Invariant cache hit.
[2023-03-14 13:50:31] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2023-03-14 13:50:31] [INFO ] Invariant cache hit.
[2023-03-14 13:50:32] [INFO ] State equation strengthened by 3671 read => feed constraints.
[2023-03-14 13:50:50] [INFO ] Implicit Places using invariants and state equation in 19079 ms returned []
Implicit Place search using SMT with State Equation took 20307 ms to find 0 implicit places.
[2023-03-14 13:50:51] [INFO ] Redundant transitions in 363 ms returned []
[2023-03-14 13:50:51] [INFO ] Invariant cache hit.
[2023-03-14 13:50:52] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22196 ms. Remains : 1194/1194 places, 3919/3919 transitions.
Graph (trivial) has 3563 edges and 1194 vertex of which 1028 / 1194 are part of one of the 2 SCC in 4 ms
Free SCC test removed 1026 places
Drop transitions removed 2726 transitions
Ensure Unique test removed 891 transitions
Reduce isomorphic transitions removed 3617 transitions.
Graph (complete) has 489 edges and 168 vertex of which 80 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 80 transition count 159
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 120 place count 79 transition count 158
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 173 place count 26 transition count 78
Iterating global reduction 2 with 53 rules applied. Total rules applied 226 place count 26 transition count 78
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 251 place count 26 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 25 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 25 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 25 transition count 50
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 256 place count 24 transition count 51
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 259 place count 24 transition count 48
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 262 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 267 place count 21 transition count 43
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 21 transition count 44
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 270 place count 20 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 19 transition count 42
Applied a total of 271 rules in 23 ms. Remains 19 /1194 variables (removed 1175) and now considering 42/3919 (removed 3877) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 42 rows 19 cols
[2023-03-14 13:50:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 13:50:52] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:50:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-14 13:50:52] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:50:52] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 13:50:52] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:50:52] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-14 13:50:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1194 places, 3919 transitions and 15703 arcs took 27 ms.
[2023-03-14 13:50:53] [INFO ] Flatten gal took : 309 ms
Total runtime 68312 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 030
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1194 places, 3919 transitions, 15703 arcs.
Final Score: 759381.214
Took : 35 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANInsertWithFailure-PT-030-ReachabilityCardinality-02 (reachable & potential(( ( (! ( (tk(P315)) <= ( 0 ) )) & ( (tk(P47)) <= ( 0 ) ) ) & ( ( (tk(P837)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P177)) ) ) )))
PROPERTY: CANInsertWithFailure-PT-030-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P908)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-030-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P882)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-030-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P987)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-030-ReachabilityCardinality-12 (reachable &!potential( ( ( (tk(P483)) <= ( 0 ) ) | ( (tk(P720)) <= (tk(P857)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11612276 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095032 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
Caught signal 15, terminating.

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CANInsertWithFailure-PT-030, 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 r043-tajo-167813697200726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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