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-167903718400135.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 ShieldIIPs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 338K 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 ShieldIIPs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679556636467

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:30:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:30:39] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-23 07:30:39] [INFO ] Transformed 1003 places.
[2023-03-23 07:30:39] [INFO ] Transformed 963 transitions.
[2023-03-23 07:30:39] [INFO ] Found NUPN structural information;
[2023-03-23 07:30:39] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-23 07:30:40] [INFO ] Computed 361 place invariants in 22 ms
[2023-03-23 07:30:40] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:30:41] [INFO ] [Nat]Absence check using 361 positive place invariants in 71 ms returned sat
[2023-03-23 07:30:45] [INFO ] After 3762ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 07:30:45] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 10 ms to minimize.
[2023-03-23 07:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 17 ms to minimize.
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 4 ms to minimize.
[2023-03-23 07:30:47] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-23 07:30:47] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-23 07:30:47] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2023-03-23 07:30:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1762 ms
[2023-03-23 07:30:48] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:30:48] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-23 07:30:48] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:30:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 595 ms
[2023-03-23 07:30:49] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-23 07:30:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-23 07:30:49] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-23 07:30:49] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-23 07:30:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 671 ms
[2023-03-23 07:30:50] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-23 07:30:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-23 07:30:50] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-23 07:30:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2023-03-23 07:30:50] [INFO ] After 9687ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2450 ms.
[2023-03-23 07:30:53] [INFO ] After 12612ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 194 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Partial Free-agglomeration rule applied 191 times.
Drop transitions removed 191 transitions
Iterating global reduction 0 with 191 rules applied. Total rules applied 193 place count 1002 transition count 962
Applied a total of 193 rules in 174 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 1002/1003 places, 962/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-23 07:30:54] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-23 07:30:55] [INFO ] [Real]Absence check using 357 positive place invariants in 112 ms returned sat
[2023-03-23 07:30:55] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 07:30:55] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:30:55] [INFO ] [Nat]Absence check using 357 positive place invariants in 62 ms returned sat
[2023-03-23 07:30:55] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 07:30:58] [INFO ] After 2497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1987 ms
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-23 07:31:01] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-23 07:31:01] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 5 ms to minimize.
[2023-03-23 07:31:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 844 ms
[2023-03-23 07:31:02] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2023-03-23 07:31:03] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 1 ms to minimize.
[2023-03-23 07:31:03] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-23 07:31:04] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-23 07:31:04] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-23 07:31:04] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2023-03-23 07:31:05] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-23 07:31:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-23 07:31:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2461 ms
[2023-03-23 07:31:06] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 32 ms to minimize.
[2023-03-23 07:31:06] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-23 07:31:06] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 3 ms to minimize.
[2023-03-23 07:31:06] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-23 07:31:06] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2023-03-23 07:31:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 872 ms
[2023-03-23 07:31:06] [INFO ] After 11222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2724 ms.
[2023-03-23 07:31:09] [INFO ] After 14412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 475 ms.
Support contains 191 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1002 transition count 962
Applied a total of 1 rules in 63 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 99200 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99200 steps, saw 91393 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-23 07:31:13] [INFO ] Computed 361 place invariants in 10 ms
[2023-03-23 07:31:14] [INFO ] [Real]Absence check using 357 positive place invariants in 59 ms returned sat
[2023-03-23 07:31:14] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-23 07:31:14] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:31:14] [INFO ] [Nat]Absence check using 357 positive place invariants in 96 ms returned sat
[2023-03-23 07:31:14] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-23 07:31:17] [INFO ] After 2801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:31:17] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 14 ms to minimize.
[2023-03-23 07:31:18] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 26 ms to minimize.
[2023-03-23 07:31:18] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:31:18] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:31:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 677 ms
[2023-03-23 07:31:19] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-23 07:31:19] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-23 07:31:20] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2023-03-23 07:31:20] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 14 ms to minimize.
[2023-03-23 07:31:20] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-23 07:31:20] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-23 07:31:21] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2023-03-23 07:31:21] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-23 07:31:21] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-23 07:31:21] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2023-03-23 07:31:22] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-23 07:31:22] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 13 ms to minimize.
[2023-03-23 07:31:22] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 27 ms to minimize.
[2023-03-23 07:31:22] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 13 ms to minimize.
[2023-03-23 07:31:22] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 16 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 9 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 13 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-23 07:31:24] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2023-03-23 07:31:24] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4887 ms
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 991 ms
[2023-03-23 07:31:26] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-23 07:31:28] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-23 07:31:28] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-03-23 07:31:28] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-23 07:31:29] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-23 07:31:29] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2023-03-23 07:31:29] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-23 07:31:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2778 ms
[2023-03-23 07:31:29] [INFO ] After 14954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1556 ms.
[2023-03-23 07:31:31] [INFO ] After 17048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 358 ms.
Support contains 191 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 27 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1002/1002 places, 962/962 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 45 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-23 07:31:31] [INFO ] Invariant cache hit.
[2023-03-23 07:31:32] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-23 07:31:32] [INFO ] Invariant cache hit.
[2023-03-23 07:31:33] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2023-03-23 07:31:33] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-23 07:31:33] [INFO ] Invariant cache hit.
[2023-03-23 07:31:34] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3100 ms. Remains : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 22 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-23 07:31:34] [INFO ] Invariant cache hit.
[2023-03-23 07:31:35] [INFO ] [Real]Absence check using 357 positive place invariants in 95 ms returned sat
[2023-03-23 07:31:35] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 07:31:35] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:31:35] [INFO ] [Nat]Absence check using 357 positive place invariants in 62 ms returned sat
[2023-03-23 07:31:35] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 07:31:38] [INFO ] After 2591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 10 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2776 ms
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 583 ms
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1180 ms
[2023-03-23 07:31:44] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-23 07:31:44] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-23 07:31:44] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:31:44] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2292 ms
[2023-03-23 07:31:46] [INFO ] After 11028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2336 ms.
[2023-03-23 07:31:48] [INFO ] After 13781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:31:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-23 07:31:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1002 places, 962 transitions and 4741 arcs took 10 ms.
[2023-03-23 07:31:49] [INFO ] Flatten gal took : 166 ms
Total runtime 70447 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 040A
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1002 places, 962 transitions, 4741 arcs.
Final Score: 146918.695
Took : 48 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679556758081

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 6712:
syntax error

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="ShieldIIPs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-040A, examination is ReachabilityFireability"
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-167903718400135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040A.tgz
mv ShieldIIPs-PT-040A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;