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.r393-oct2-167903716800286.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 ltsminxred
Input is ShieldIIPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 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.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 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 ShieldIIPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679436546368

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:09:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:09:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:09:09] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-21 22:09:09] [INFO ] Transformed 1403 places.
[2023-03-21 22:09:09] [INFO ] Transformed 1303 transitions.
[2023-03-21 22:09:09] [INFO ] Found NUPN structural information;
[2023-03-21 22:09:09] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 12) seen :5
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-01 FALSE 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-21 22:09:09] [INFO ] Computed 181 place invariants in 17 ms
[2023-03-21 22:09:10] [INFO ] After 710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 22:09:11] [INFO ] [Nat]Absence check using 181 positive place invariants in 55 ms returned sat
[2023-03-21 22:09:12] [INFO ] After 1286ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-21 22:09:13] [INFO ] Deduced a trap composed of 22 places in 511 ms of which 19 ms to minimize.
[2023-03-21 22:09:13] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 1 ms to minimize.
[2023-03-21 22:09:13] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 1 ms to minimize.
[2023-03-21 22:09:14] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 1 ms to minimize.
[2023-03-21 22:09:14] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 2 ms to minimize.
[2023-03-21 22:09:15] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 0 ms to minimize.
[2023-03-21 22:09:15] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 1 ms to minimize.
[2023-03-21 22:09:15] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 1 ms to minimize.
[2023-03-21 22:09:16] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 1 ms to minimize.
[2023-03-21 22:09:17] [INFO ] Deduced a trap composed of 28 places in 758 ms of which 2 ms to minimize.
[2023-03-21 22:09:17] [INFO ] Deduced a trap composed of 21 places in 346 ms of which 0 ms to minimize.
[2023-03-21 22:09:17] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 1 ms to minimize.
[2023-03-21 22:09:18] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 1 ms to minimize.
[2023-03-21 22:09:18] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 3 ms to minimize.
[2023-03-21 22:09:18] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 1 ms to minimize.
[2023-03-21 22:09:19] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 0 ms to minimize.
[2023-03-21 22:09:19] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-21 22:09:19] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 14 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 1 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 0 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2023-03-21 22:09:21] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2023-03-21 22:09:21] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 0 ms to minimize.
[2023-03-21 22:09:21] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 1 ms to minimize.
[2023-03-21 22:09:22] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 0 ms to minimize.
[2023-03-21 22:09:22] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 0 ms to minimize.
[2023-03-21 22:09:22] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 0 ms to minimize.
[2023-03-21 22:09:22] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-21 22:09:23] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 14 ms to minimize.
[2023-03-21 22:09:23] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 1 ms to minimize.
[2023-03-21 22:09:23] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2023-03-21 22:09:23] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 0 ms to minimize.
[2023-03-21 22:09:24] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2023-03-21 22:09:24] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 0 ms to minimize.
[2023-03-21 22:09:24] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 1 ms to minimize.
[2023-03-21 22:09:25] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2023-03-21 22:09:25] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 0 ms to minimize.
[2023-03-21 22:09:25] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 6 ms to minimize.
[2023-03-21 22:09:25] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 2 ms to minimize.
[2023-03-21 22:09:26] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2023-03-21 22:09:26] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 4 ms to minimize.
[2023-03-21 22:09:26] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 43 ms to minimize.
[2023-03-21 22:09:26] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2023-03-21 22:09:27] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 0 ms to minimize.
[2023-03-21 22:09:27] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-03-21 22:09:27] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2023-03-21 22:09:27] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 14981 ms
[2023-03-21 22:09:27] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 0 ms to minimize.
[2023-03-21 22:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-21 22:09:28] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2023-03-21 22:09:28] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2023-03-21 22:09:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-21 22:09:29] [INFO ] After 17806ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-03-21 22:09:29] [INFO ] After 18794ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 356 ms.
Support contains 12 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1403 transition count 970
Reduce places removed 333 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 335 rules applied. Total rules applied 668 place count 1070 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 669 place count 1069 transition count 968
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 669 place count 1069 transition count 886
Deduced a syphon composed of 82 places in 4 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 833 place count 987 transition count 886
Discarding 135 places :
Symmetric choice reduction at 3 with 135 rule applications. Total rules 968 place count 852 transition count 751
Iterating global reduction 3 with 135 rules applied. Total rules applied 1103 place count 852 transition count 751
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1103 place count 852 transition count 693
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1219 place count 794 transition count 693
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 2 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1893 place count 457 transition count 356
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 2007 place count 400 transition count 392
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2008 place count 400 transition count 391
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2011 place count 400 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2014 place count 397 transition count 388
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 2035 place count 397 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2036 place count 396 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2038 place count 394 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2038 place count 394 transition count 386
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2040 place count 393 transition count 386
Applied a total of 2040 rules in 350 ms. Remains 393 /1403 variables (removed 1010) and now considering 386/1303 (removed 917) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 393/1403 places, 386/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 386 rows 393 cols
[2023-03-21 22:09:30] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-21 22:09:30] [INFO ] [Real]Absence check using 179 positive place invariants in 42 ms returned sat
[2023-03-21 22:09:30] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:09:30] [INFO ] [Nat]Absence check using 179 positive place invariants in 76 ms returned sat
[2023-03-21 22:09:31] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 22:09:31] [INFO ] After 256ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:31] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-21 22:09:31] [INFO ] After 1053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 386/386 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 393 transition count 381
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 388 transition count 381
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 386 transition count 379
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 386 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 385 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 383 transition count 376
Applied a total of 18 rules in 54 ms. Remains 383 /393 variables (removed 10) and now considering 376/386 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 383/393 places, 376/386 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 169751 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169751 steps, saw 114283 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 376 rows 383 cols
[2023-03-21 22:09:35] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:09:35] [INFO ] [Real]Absence check using 179 positive place invariants in 20 ms returned sat
[2023-03-21 22:09:35] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:09:35] [INFO ] [Nat]Absence check using 179 positive place invariants in 75 ms returned sat
[2023-03-21 22:09:35] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-21 22:09:35] [INFO ] After 107ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:36] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-21 22:09:36] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 376/376 transitions.
Applied a total of 0 rules in 32 ms. Remains 383 /383 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 383/383 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 376/376 transitions.
Applied a total of 0 rules in 13 ms. Remains 383 /383 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-21 22:09:36] [INFO ] Invariant cache hit.
[2023-03-21 22:09:36] [INFO ] Implicit Places using invariants in 502 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 382/383 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 381 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 381 transition count 375
Applied a total of 2 rules in 25 ms. Remains 381 /382 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 381 cols
[2023-03-21 22:09:36] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:09:37] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-21 22:09:37] [INFO ] Invariant cache hit.
[2023-03-21 22:09:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:09:37] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 381/383 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1303 ms. Remains : 381/383 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 169211 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169211 steps, saw 117947 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:09:40] [INFO ] Invariant cache hit.
[2023-03-21 22:09:41] [INFO ] [Real]Absence check using 178 positive place invariants in 39 ms returned sat
[2023-03-21 22:09:41] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:09:41] [INFO ] [Nat]Absence check using 178 positive place invariants in 31 ms returned sat
[2023-03-21 22:09:41] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:09:41] [INFO ] After 123ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:42] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-21 22:09:42] [INFO ] After 876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 5 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 381 /381 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 381/381 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 375/375 transitions.
Applied a total of 0 rules in 15 ms. Remains 381 /381 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-21 22:09:42] [INFO ] Invariant cache hit.
[2023-03-21 22:09:42] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-21 22:09:42] [INFO ] Invariant cache hit.
[2023-03-21 22:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:09:42] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-03-21 22:09:42] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-21 22:09:42] [INFO ] Invariant cache hit.
[2023-03-21 22:09:43] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1061 ms. Remains : 381/381 places, 375/375 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 381 transition count 375
Applied a total of 38 rules in 15 ms. Remains 381 /381 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 375 rows 381 cols
[2023-03-21 22:09:43] [INFO ] Computed 178 place invariants in 3 ms
[2023-03-21 22:09:43] [INFO ] [Real]Absence check using 178 positive place invariants in 38 ms returned sat
[2023-03-21 22:09:43] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:09:43] [INFO ] [Nat]Absence check using 178 positive place invariants in 34 ms returned sat
[2023-03-21 22:09:43] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-21 22:09:43] [INFO ] After 109ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:44] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-21 22:09:44] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:09:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-21 22:09:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 381 places, 375 transitions and 1827 arcs took 8 ms.
[2023-03-21 22:09:44] [INFO ] Flatten gal took : 105 ms
Total runtime 35718 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/685/inv_0_ --invariant=/tmp/685/inv_1_ --invariant=/tmp/685/inv_2_ --invariant=/tmp/685/inv_3_ --inv-par
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679436586170

--------------------
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
mcc2023
rfs formula name ShieldIIPt-PT-020B-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/685/inv_0_
rfs formula name ShieldIIPt-PT-020B-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/685/inv_1_
rfs formula name ShieldIIPt-PT-020B-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/685/inv_2_
rfs formula name ShieldIIPt-PT-020B-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/685/inv_3_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 381 places, 375 transitions and 1827 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_020B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 375->206 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 381; there are 206 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/685/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/685/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/685/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/685/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.430 real 1.700 user 0.000 sys
pnml2lts-sym: max token count: 1

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-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-020B, 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 r393-oct2-167903716800286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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