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-167903718500254.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-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718500254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Feb 25 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:59 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.7K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 83K 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-005B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679560310610

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-005B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:31:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:31:53] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-23 08:31:53] [INFO ] Transformed 353 places.
[2023-03-23 08:31:53] [INFO ] Transformed 328 transitions.
[2023-03-23 08:31:53] [INFO ] Found NUPN structural information;
[2023-03-23 08:31:53] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 12) seen :9
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 328 rows 353 cols
[2023-03-23 08:31:53] [INFO ] Computed 46 place invariants in 13 ms
[2023-03-23 08:31:54] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:31:54] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2023-03-23 08:31:54] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:31:54] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 17 ms to minimize.
[2023-03-23 08:31:54] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 6 ms to minimize.
[2023-03-23 08:31:54] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 880 ms
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 0 ms to minimize.
[2023-03-23 08:31:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 573 ms
[2023-03-23 08:31:56] [INFO ] After 1831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-23 08:31:56] [INFO ] After 2216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 33 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 328/328 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 353 transition count 260
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 138 place count 285 transition count 258
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 148 place count 284 transition count 249
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 157 place count 275 transition count 249
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 157 place count 275 transition count 229
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 197 place count 255 transition count 229
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 222 place count 230 transition count 204
Iterating global reduction 4 with 25 rules applied. Total rules applied 247 place count 230 transition count 204
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 247 place count 230 transition count 198
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 259 place count 224 transition count 198
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 407 place count 150 transition count 124
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 421 place count 143 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 424 place count 143 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 427 place count 140 transition count 122
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 431 place count 140 transition count 122
Applied a total of 431 rules in 210 ms. Remains 140 /353 variables (removed 213) and now considering 122/328 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 140/353 places, 122/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 233490 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233490 steps, saw 148693 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 140 cols
[2023-03-23 08:31:59] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-23 08:31:59] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:31:59] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2023-03-23 08:31:59] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:31:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 08:32:00] [INFO ] After 86ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 24 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 464 ms
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2023-03-23 08:32:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-23 08:32:00] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-23 08:32:00] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 33 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 122/122 transitions.
Applied a total of 0 rules in 21 ms. Remains 140 /140 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 140/140 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-23 08:32:00] [INFO ] Invariant cache hit.
[2023-03-23 08:32:01] [INFO ] Implicit Places using invariants in 92 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/140 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 103 ms. Remains : 139/140 places, 122/122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 312793 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312793 steps, saw 200318 distinct states, run finished after 3008 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 139 cols
[2023-03-23 08:32:04] [INFO ] Computed 45 place invariants in 21 ms
[2023-03-23 08:32:04] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:32:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-23 08:32:04] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 08:32:04] [INFO ] After 77ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 22 ms to minimize.
[2023-03-23 08:32:04] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-23 08:32:04] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-23 08:32:04] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 0 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 849 ms
[2023-03-23 08:32:05] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2023-03-23 08:32:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-23 08:32:05] [INFO ] After 1206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-23 08:32:05] [INFO ] After 1474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 33 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 139/139 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-23 08:32:05] [INFO ] Invariant cache hit.
[2023-03-23 08:32:06] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-23 08:32:06] [INFO ] Invariant cache hit.
[2023-03-23 08:32:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 08:32:06] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-23 08:32:06] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-23 08:32:06] [INFO ] Invariant cache hit.
[2023-03-23 08:32:06] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 139/139 places, 122/122 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 139 transition count 122
Applied a total of 8 rules in 13 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 139 cols
[2023-03-23 08:32:06] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-23 08:32:06] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:32:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 27 ms returned sat
[2023-03-23 08:32:06] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-23 08:32:06] [INFO ] After 106ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 7 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 557 ms
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 5 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2023-03-23 08:32:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-23 08:32:07] [INFO ] After 1134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-23 08:32:07] [INFO ] After 1381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:32:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-23 08:32:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 122 transitions and 460 arcs took 3 ms.
[2023-03-23 08:32:08] [INFO ] Flatten gal took : 52 ms
Total runtime 15418 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 005B
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: 139 places, 122 transitions, 460 arcs.
Final Score: 1442.67
Took : 4 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-005B-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( ( (tk(P33)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P33)) ) ) | ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) ) | ( ( ( (tk(P136)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P136)) ) ) | ( ( (tk(P104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P104)) ) ) ) ) | ( ( ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) | ( ( (tk(P11)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P11)) ) ) ) | ( ( ( ( (tk(P130)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P130)) ) ) & ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) ) | ( ( ( ( (tk(P128)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P128)) ) ) & ( ( (tk(P126)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P126)) ) ) ) | ( ( ( ( (tk(P123)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P123)) ) ) & ( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) ) ) & ( ( ( (tk(P112)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P112)) ) ) & ( ( ( ( ( (tk(P110)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P110)) ) ) & ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) ) & ( ( ( ( (tk(P68)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P68)) ) ) | ( ( (tk(P114)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P114)) ) ) ) & ( ( ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) | ( ( (tk(P48)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P48)) ) ) ) | ( ( ( (tk(P38)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P38)) ) ) | ( ( (tk(P138)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P138)) ) ) ) ) ) ) | ( ( ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) | ( ( (tk(P106)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P106)) ) ) ) & ( ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) | ( ( (tk(P59)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P59)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-005B-ReachabilityCardinality-10 (reachable & potential(( ( ( ( (tk(P5)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P5)) ) ) & ( ( ( (tk(P40)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) ) & ( ( (tk(P132)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P132)) ) ) ) ) & ( ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P84)) ) ) & ( ( ( (tk(P26)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P26)) ) ) & ( ( ( (tk(P76)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P76)) ) ) | ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-005B-ReachabilityCardinality-15 (reachable & potential(( ( ( (tk(P3)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P3)) ) ) & ( ( (tk(P9)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) )))
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679560352478

--------------------
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

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-005B"
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-005B, 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-167903718500254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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