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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 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.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 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 167K 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-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679560428950

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=ShieldIIPt-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:33:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 08:33:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:33:51] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-23 08:33:51] [INFO ] Transformed 703 places.
[2023-03-23 08:33:51] [INFO ] Transformed 653 transitions.
[2023-03-23 08:33:51] [INFO ] Found NUPN structural information;
[2023-03-23 08:33:51] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 FALSE 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-23 08:33:52] [INFO ] Computed 91 place invariants in 36 ms
[2023-03-23 08:33:53] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 08:33:53] [INFO ] [Nat]Absence check using 91 positive place invariants in 35 ms returned sat
[2023-03-23 08:33:54] [INFO ] After 1116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 08:33:55] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 8 ms to minimize.
[2023-03-23 08:33:55] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 1 ms to minimize.
[2023-03-23 08:33:55] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-23 08:33:56] [INFO ] Deduced a trap composed of 34 places in 573 ms of which 2 ms to minimize.
[2023-03-23 08:33:56] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 1 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 14 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 0 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3739 ms
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 0 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 4 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 0 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2462 ms
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 1 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 909 ms
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 13 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 18 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 15 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 0 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2152 ms
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 13 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2148 ms
[2023-03-23 08:34:07] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 27 ms to minimize.
[2023-03-23 08:34:07] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-23 08:34:09] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 4 ms to minimize.
[2023-03-23 08:34:09] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2023-03-23 08:34:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2332 ms
[2023-03-23 08:34:09] [INFO ] After 15802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 866 ms.
[2023-03-23 08:34:10] [INFO ] After 17076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 134 ms.
Support contains 164 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 703 transition count 581
Reduce places removed 72 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 102 rules applied. Total rules applied 174 place count 631 transition count 551
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 205 place count 601 transition count 550
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 205 place count 601 transition count 515
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 275 place count 566 transition count 515
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 327 place count 514 transition count 463
Iterating global reduction 3 with 52 rules applied. Total rules applied 379 place count 514 transition count 463
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 379 place count 514 transition count 452
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 401 place count 503 transition count 452
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 595 place count 406 transition count 355
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 619 place count 394 transition count 355
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 623 place count 394 transition count 351
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 627 place count 390 transition count 351
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 390 transition count 351
Applied a total of 633 rules in 137 ms. Remains 390 /703 variables (removed 313) and now considering 351/653 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 390/703 places, 351/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 351 rows 390 cols
[2023-03-23 08:34:10] [INFO ] Computed 91 place invariants in 3 ms
[2023-03-23 08:34:10] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:34:11] [INFO ] [Nat]Absence check using 91 positive place invariants in 72 ms returned sat
[2023-03-23 08:34:11] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:11] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 08:34:11] [INFO ] After 199ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:12] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 13 ms to minimize.
[2023-03-23 08:34:12] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-23 08:34:12] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2023-03-23 08:34:12] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-23 08:34:12] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-23 08:34:12] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2023-03-23 08:34:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2006 ms
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 425 ms
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-23 08:34:14] [INFO ] After 3029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-23 08:34:14] [INFO ] After 3825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 91 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 351/351 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 390 transition count 345
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 384 transition count 341
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 380 transition count 341
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 20 place count 380 transition count 325
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 52 place count 364 transition count 325
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 361 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 361 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 361 transition count 321
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 360 transition count 321
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 150 place count 315 transition count 276
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 312 transition count 278
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 312 transition count 275
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 162 place count 309 transition count 275
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 309 transition count 275
Applied a total of 164 rules in 72 ms. Remains 309 /390 variables (removed 81) and now considering 275/351 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 309/390 places, 275/351 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 247926 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247926 steps, saw 154108 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 275 rows 309 cols
[2023-03-23 08:34:18] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-23 08:34:18] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:34:18] [INFO ] [Nat]Absence check using 91 positive place invariants in 28 ms returned sat
[2023-03-23 08:34:18] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:18] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 08:34:19] [INFO ] After 344ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-23 08:34:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 672 ms
[2023-03-23 08:34:19] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 322 ms
[2023-03-23 08:34:20] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-03-23 08:34:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2023-03-23 08:34:20] [INFO ] After 1816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-23 08:34:20] [INFO ] After 2489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 91 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 275/275 transitions.
Applied a total of 0 rules in 15 ms. Remains 309 /309 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 309/309 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 275/275 transitions.
Applied a total of 0 rules in 24 ms. Remains 309 /309 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2023-03-23 08:34:20] [INFO ] Invariant cache hit.
[2023-03-23 08:34:21] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-23 08:34:21] [INFO ] Invariant cache hit.
[2023-03-23 08:34:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 08:34:21] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2023-03-23 08:34:21] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-23 08:34:21] [INFO ] Invariant cache hit.
[2023-03-23 08:34:21] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1017 ms. Remains : 309/309 places, 275/275 transitions.
Graph (complete) has 722 edges and 309 vertex of which 307 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 307 transition count 274
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 3 place count 306 transition count 274
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 306 transition count 274
Applied a total of 16 rules in 26 ms. Remains 306 /309 variables (removed 3) and now considering 274/275 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 306 cols
[2023-03-23 08:34:21] [INFO ] Computed 89 place invariants in 14 ms
[2023-03-23 08:34:21] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:34:22] [INFO ] [Nat]Absence check using 89 positive place invariants in 15 ms returned sat
[2023-03-23 08:34:22] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-23 08:34:22] [INFO ] After 231ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 703 ms
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-23 08:34:24] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-23 08:34:24] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-23 08:34:24] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-23 08:34:24] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-23 08:34:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 561 ms
[2023-03-23 08:34:24] [INFO ] After 1863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-23 08:34:24] [INFO ] After 2551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-23 08:34:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 275 transitions and 988 arcs took 3 ms.
[2023-03-23 08:34:24] [INFO ] Flatten gal took : 66 ms
Total runtime 33375 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 010B
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: 309 places, 275 transitions, 988 arcs.
Final Score: 7071.934
Took : 10 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679560476043

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 1579:
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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-167903718600271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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