Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718600326.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPt-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:23 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 ShieldIIPt-PT-050A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679562942341

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=ShieldIIPt-PT-050A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:15:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 09:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:15:45] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-23 09:15:45] [INFO ] Transformed 953 places.
[2023-03-23 09:15:45] [INFO ] Transformed 703 transitions.
[2023-03-23 09:15:45] [INFO ] Found NUPN structural information;
[2023-03-23 09:15:45] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 702 rows 953 cols
[2023-03-23 09:15:46] [INFO ] Computed 451 place invariants in 25 ms
[2023-03-23 09:15:47] [INFO ] After 848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 09:15:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 78 ms returned sat
[2023-03-23 09:15:49] [INFO ] After 2144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 09:15:51] [INFO ] After 4162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1376 ms.
[2023-03-23 09:15:53] [INFO ] After 6043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1076 ms.
Support contains 134 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 0 with 68 rules applied. Total rules applied 72 place count 951 transition count 700
Applied a total of 72 rules in 173 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 7) seen :3
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 700 rows 951 cols
[2023-03-23 09:15:55] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-23 09:15:55] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 09:15:55] [INFO ] [Nat]Absence check using 451 positive place invariants in 102 ms returned sat
[2023-03-23 09:15:56] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 09:15:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-23 09:15:57] [INFO ] After 604ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 09:15:58] [INFO ] After 1363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 896 ms.
[2023-03-23 09:15:59] [INFO ] After 3755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 631 ms.
Support contains 101 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 951 transition count 700
Applied a total of 10 rules in 46 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 951/951 places, 700/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 123970 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 123970 steps, saw 121856 distinct states, run finished after 3006 ms. (steps per millisecond=41 ) properties seen :2
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 700 rows 951 cols
[2023-03-23 09:16:03] [INFO ] Computed 451 place invariants in 10 ms
[2023-03-23 09:16:03] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 09:16:04] [INFO ] [Nat]Absence check using 451 positive place invariants in 92 ms returned sat
[2023-03-23 09:16:04] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 09:16:05] [INFO ] After 375ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:05] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 398 ms.
[2023-03-23 09:16:06] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 267 ms.
Support contains 42 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 951 transition count 700
Applied a total of 15 rules in 59 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 951/951 places, 700/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 154292 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154292 steps, saw 150155 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 700 rows 951 cols
[2023-03-23 09:16:09] [INFO ] Computed 451 place invariants in 17 ms
[2023-03-23 09:16:10] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 09:16:10] [INFO ] [Nat]Absence check using 451 positive place invariants in 217 ms returned sat
[2023-03-23 09:16:11] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-23 09:16:11] [INFO ] After 459ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:12] [INFO ] After 1164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-23 09:16:12] [INFO ] After 2797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 250 ms.
Support contains 42 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 28 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 951/951 places, 700/700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 28 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-23 09:16:13] [INFO ] Invariant cache hit.
[2023-03-23 09:16:14] [INFO ] Implicit Places using invariants in 1187 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 949/951 places, 700/700 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 101 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-23 09:16:14] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-23 09:16:15] [INFO ] Implicit Places using invariants in 956 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 962 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/951 places, 699/700 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 105 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-23 09:16:15] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-23 09:16:16] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-23 09:16:16] [INFO ] Invariant cache hit.
[2023-03-23 09:16:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 09:16:17] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 946/951 places, 698/700 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4516 ms. Remains : 946/951 places, 698/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 148203 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148203 steps, saw 144303 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 09:16:21] [INFO ] Invariant cache hit.
[2023-03-23 09:16:21] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 09:16:21] [INFO ] [Nat]Absence check using 448 positive place invariants in 95 ms returned sat
[2023-03-23 09:16:22] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 09:16:22] [INFO ] After 423ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:23] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-23 09:16:23] [INFO ] After 2246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 180 ms.
Support contains 42 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 25 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 24 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-23 09:16:23] [INFO ] Invariant cache hit.
[2023-03-23 09:16:24] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-23 09:16:24] [INFO ] Invariant cache hit.
[2023-03-23 09:16:25] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 09:16:26] [INFO ] Implicit Places using invariants and state equation in 2123 ms returned []
Implicit Place search using SMT with State Equation took 3059 ms to find 0 implicit places.
[2023-03-23 09:16:26] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-23 09:16:26] [INFO ] Invariant cache hit.
[2023-03-23 09:16:27] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3774 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 946 transition count 698
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 946 transition count 659
Applied a total of 78 rules in 81 ms. Remains 946 /946 variables (removed 0) and now considering 659/698 (removed 39) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 659 rows 946 cols
[2023-03-23 09:16:27] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-23 09:16:27] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 09:16:27] [INFO ] [Nat]Absence check using 448 positive place invariants in 69 ms returned sat
[2023-03-23 09:16:28] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:29] [INFO ] After 1018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-23 09:16:29] [INFO ] After 1584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 09:16:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 28 ms.
[2023-03-23 09:16:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 946 places, 698 transitions and 3216 arcs took 10 ms.
[2023-03-23 09:16:29] [INFO ] Flatten gal took : 176 ms
Total runtime 45095 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 050A
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: 946 places, 698 transitions, 3216 arcs.
Final Score: 106522.485
Took : 32 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-050A-ReachabilityCardinality-08 (reachable &!potential( ( ( ( (tk(P650)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P650)) ) ) | ( ( ( ( (tk(P752)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P752)) ) ) & ( ( ( (tk(P512)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P512)) ) ) | ( ( (tk(P240)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P240)) ) ) ) ) | ( ( ( ( ( (tk(P824)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P824)) ) ) & ( ( (tk(P811)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P811)) ) ) ) | ( ( ( (tk(P268)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P268)) ) ) & ( ( (tk(P574)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P574)) ) ) ) ) & ( ( ( ( (tk(P560)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P560)) ) ) | ( ( (tk(P834)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P834)) ) ) ) & ( ( ( ( (tk(P25)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P25)) ) ) | ( ( ( (tk(P593)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P593)) ) ) | ( ( (tk(P411)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P411)) ) ) ) ) | ( ( ( (tk(P814)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P814)) ) ) | ( ( ( ( (tk(P366)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P366)) ) ) & ( ( (tk(P694)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P694)) ) ) ) | ( ( ( (tk(P574)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P574)) ) ) & ( ( ( (tk(P853)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P853)) ) ) & ( ( ( (tk(P324)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P324)) ) ) | ( ( (tk(P630)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P630)) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-050A-ReachabilityCardinality-12 (reachable & potential(( ( ( ( ( (tk(P291)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P291)) ) ) & ( ( (tk(P821)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P821)) ) ) ) & ( ( ( (tk(P400)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P400)) ) ) & ( ( ( (tk(P100)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P100)) ) ) & ( ( (tk(P670)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P670)) ) ) ) ) ) & ( ( ( ( (tk(P509)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P509)) ) ) & ( ( ( (tk(P798)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P798)) ) ) & ( ( (tk(P413)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P413)) ) ) ) ) & ( ( ( ( (tk(P636)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P636)) ) ) | ( ( (tk(P915)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P915)) ) ) ) & ( ( ( ( (tk(P860)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P860)) ) ) | ( ( (tk(P89)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P89)) ) ) ) & ( ( ( (tk(P147)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P147)) ) ) | ( ( ( ( (tk(P368)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P368)) ) ) | ( ( ( (tk(P401)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P401)) ) ) & ( ( (tk(P695)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P695)) ) ) ) ) & ( ( ( ( (tk(P20)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P20)) ) ) | ( ( ( (tk(P900)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P900)) ) ) | ( ( (tk(P866)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P866)) ) ) ) ) | ( ( ( (tk(P581)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P581)) ) ) | ( ( ( (tk(P455)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P455)) ) ) | ( ( ( (tk(P526)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P526)) ) ) & ( ( (tk(P945)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P945)) ) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9831128 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16105472 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="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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 r395-oct2-167903718600326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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