fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r043-tajo-167813696800398
Last Updated
May 14, 2023

About the Execution of Smart+red for BugTracking-PT-q8m004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7934.632 3600000.00 3660770.00 1320.10 TFTFF?T?TF?F?FTF normal

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-167813696800398.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 BugTracking-PT-q8m004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696800398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m004-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678787161259

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=BugTracking-PT-q8m004
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:46:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:46:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:46:04] [INFO ] Load time of PNML (sax parser for PT used): 960 ms
[2023-03-14 09:46:04] [INFO ] Transformed 754 places.
[2023-03-14 09:46:04] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:46:04] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 147 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 115 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :1
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
[2023-03-14 09:46:05] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:46:05] [INFO ] Computed 10 place invariants in 37 ms
[2023-03-14 09:46:06] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 09:46:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 09:46:07] [INFO ] After 1073ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-14 09:46:07] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 09:46:08] [INFO ] After 913ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-14 09:46:08] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 7 ms to minimize.
[2023-03-14 09:46:09] [INFO ] Deduced a trap composed of 11 places in 430 ms of which 1 ms to minimize.
[2023-03-14 09:46:09] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 2 ms to minimize.
[2023-03-14 09:46:10] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 2 ms to minimize.
[2023-03-14 09:46:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1946 ms
[2023-03-14 09:46:10] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2023-03-14 09:46:11] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-14 09:46:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 626 ms
[2023-03-14 09:46:12] [INFO ] Deduced a trap composed of 12 places in 757 ms of which 0 ms to minimize.
[2023-03-14 09:46:12] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 2 ms to minimize.
[2023-03-14 09:46:13] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 1 ms to minimize.
[2023-03-14 09:46:13] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 1 ms to minimize.
[2023-03-14 09:46:13] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 0 ms to minimize.
[2023-03-14 09:46:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2617 ms
[2023-03-14 09:46:14] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 1 ms to minimize.
[2023-03-14 09:46:15] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 0 ms to minimize.
[2023-03-14 09:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 983 ms
[2023-03-14 09:46:15] [INFO ] After 7837ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 870 ms.
[2023-03-14 09:46:16] [INFO ] After 9948ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 283 ms.
Support contains 30 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 277 transition count 3910
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 277 transition count 3904
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 271 transition count 3904
Applied a total of 17 rules in 627 ms. Remains 271 /280 variables (removed 9) and now considering 3904/3904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 630 ms. Remains : 271/280 places, 3904/3904 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 116318 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{4=1}
Probabilistic random walk after 116318 steps, saw 42081 distinct states, run finished after 3015 ms. (steps per millisecond=38 ) properties seen :1
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-03-14 09:46:20] [INFO ] Flow matrix only has 3721 transitions (discarded 183 similar events)
// Phase 1: matrix 3721 rows 271 cols
[2023-03-14 09:46:20] [INFO ] Computed 9 place invariants in 19 ms
[2023-03-14 09:46:21] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 09:46:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-14 09:46:22] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 09:46:22] [INFO ] State equation strengthened by 304 read => feed constraints.
[2023-03-14 09:46:22] [INFO ] After 565ms SMT Verify possible using 304 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 09:46:23] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 1 ms to minimize.
[2023-03-14 09:46:23] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 0 ms to minimize.
[2023-03-14 09:46:24] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2023-03-14 09:46:24] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-14 09:46:24] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2023-03-14 09:46:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1751 ms
[2023-03-14 09:46:25] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 13 ms to minimize.
[2023-03-14 09:46:25] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2023-03-14 09:46:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 824 ms
[2023-03-14 09:46:26] [INFO ] Deduced a trap composed of 11 places in 404 ms of which 1 ms to minimize.
[2023-03-14 09:46:26] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 0 ms to minimize.
[2023-03-14 09:46:26] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-14 09:46:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1230 ms
[2023-03-14 09:46:27] [INFO ] After 4950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 439 ms.
[2023-03-14 09:46:27] [INFO ] After 6524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6 ms.
Support contains 24 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 270 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 270 transition count 3871
Applied a total of 2 rules in 278 ms. Remains 270 /271 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 270/271 places, 3871/3904 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 125011 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125011 steps, saw 47907 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 09:46:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:46:31] [INFO ] Computed 9 place invariants in 34 ms
[2023-03-14 09:46:31] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 09:46:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 09:46:32] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 09:46:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:46:33] [INFO ] After 755ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 09:46:33] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 0 ms to minimize.
[2023-03-14 09:46:34] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-14 09:46:34] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-14 09:46:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 984 ms
[2023-03-14 09:46:34] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 2 ms to minimize.
[2023-03-14 09:46:34] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-14 09:46:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 553 ms
[2023-03-14 09:46:35] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 1 ms to minimize.
[2023-03-14 09:46:35] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 0 ms to minimize.
[2023-03-14 09:46:36] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 1 ms to minimize.
[2023-03-14 09:46:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1160 ms
[2023-03-14 09:46:36] [INFO ] After 3864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 371 ms.
[2023-03-14 09:46:36] [INFO ] After 5342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 24 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:46:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:46:36] [INFO ] Invariant cache hit.
[2023-03-14 09:46:37] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-14 09:46:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:46:37] [INFO ] Invariant cache hit.
[2023-03-14 09:46:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:46:39] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
[2023-03-14 09:46:39] [INFO ] Redundant transitions in 302 ms returned []
[2023-03-14 09:46:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:46:39] [INFO ] Invariant cache hit.
[2023-03-14 09:46:40] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3891 ms. Remains : 270/270 places, 3871/3871 transitions.
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 270 transition count 3699
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 173 place count 270 transition count 3698
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 178 place count 270 transition count 3693
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 183 place count 265 transition count 3693
Applied a total of 183 rules in 208 ms. Remains 265 /270 variables (removed 5) and now considering 3693/3871 (removed 178) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3693 rows 265 cols
[2023-03-14 09:46:41] [INFO ] Computed 9 place invariants in 20 ms
[2023-03-14 09:46:41] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 09:46:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 09:46:42] [INFO ] After 954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 09:46:43] [INFO ] After 1774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 521 ms.
[2023-03-14 09:46:43] [INFO ] After 2389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 09:46:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2023-03-14 09:46:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 3871 transitions and 19051 arcs took 41 ms.
[2023-03-14 09:46:44] [INFO ] Flatten gal took : 425 ms
Total runtime 40815 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m004
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: 270 places, 3871 transitions, 19051 arcs.
Final Score: 41041.624
Took : 88 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BugTracking-PT-q8m004-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P74)) <= ( 0 ) )))
PROPERTY: BugTracking-PT-q8m004-ReachabilityCardinality-07 (reachable &!potential( ( ( ( 1 ) <= (tk(P72)) ) | ( ( (! ( (tk(P140)) <= ( 0 ) )) | ( ( (tk(P54)) <= (tk(P164)) ) | ( (! ( (tk(P3)) <= ( 2 ) )) & ( (tk(P13)) <= ( 4 ) ) ) ) ) & ( (! ( (tk(P206)) <= (tk(P249)) )) | ( ( (tk(P151)) <= (tk(P204)) ) | ( ( ( 2 ) <= (tk(P243)) ) & ( (! ( ( 2 ) <= (tk(P168)) )) | (! ( (tk(P152)) <= ( 2 ) )) ) ) ) ) ) )))
PROPERTY: BugTracking-PT-q8m004-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P238)) <= ( 0 ) )))
PROPERTY: BugTracking-PT-q8m004-ReachabilityCardinality-12 (reachable & potential(( (! ( (tk(P201)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P30)) )) | ( (! ( (tk(P234)) <= ( 1 ) )) | ( ( (! ( (tk(P58)) <= (tk(P173)) )) | ( (tk(P49)) <= ( 4 ) ) ) & ( (! ( (tk(P75)) <= ( 3 ) )) | ( ( (tk(P147)) <= ( 0 ) ) | (! ( ( 4 ) <= (tk(P263)) )) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8197028 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16084148 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="BugTracking-PT-q8m004"
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 BugTracking-PT-q8m004, 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-167813696800398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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