About the Execution of LTSMin+red for ShieldPPPt-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16190.487 | 3600000.00 | 14322896.00 | 157.90 | FTFTTTFTFFTTFTFT | normal |
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-167903717300638.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 ShieldPPPt-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-167903717300638
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 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 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679464560641
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=ShieldPPPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:56:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:56:03] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-22 05:56:03] [INFO ] Transformed 1563 places.
[2023-03-22 05:56:03] [INFO ] Transformed 1423 transitions.
[2023-03-22 05:56:03] [INFO ] Found NUPN structural information;
[2023-03-22 05:56:03] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 12) seen :7
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-22 05:56:04] [INFO ] Computed 221 place invariants in 60 ms
[2023-03-22 05:56:04] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:56:05] [INFO ] [Nat]Absence check using 221 positive place invariants in 92 ms returned sat
[2023-03-22 05:56:07] [INFO ] After 2346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:56:08] [INFO ] Deduced a trap composed of 22 places in 573 ms of which 11 ms to minimize.
[2023-03-22 05:56:09] [INFO ] Deduced a trap composed of 39 places in 531 ms of which 27 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 21 places in 822 ms of which 16 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 2 ms to minimize.
[2023-03-22 05:56:11] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 1 ms to minimize.
[2023-03-22 05:56:11] [INFO ] Deduced a trap composed of 29 places in 527 ms of which 0 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 22 places in 461 ms of which 2 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 1 ms to minimize.
[2023-03-22 05:56:13] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 12 ms to minimize.
[2023-03-22 05:56:13] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 0 ms to minimize.
[2023-03-22 05:56:13] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 0 ms to minimize.
[2023-03-22 05:56:14] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2023-03-22 05:56:14] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 0 ms to minimize.
[2023-03-22 05:56:14] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 1 ms to minimize.
[2023-03-22 05:56:15] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 1 ms to minimize.
[2023-03-22 05:56:15] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 0 ms to minimize.
[2023-03-22 05:56:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7474 ms
[2023-03-22 05:56:17] [INFO ] Deduced a trap composed of 20 places in 1498 ms of which 1 ms to minimize.
[2023-03-22 05:56:17] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 2 ms to minimize.
[2023-03-22 05:56:17] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 3 ms to minimize.
[2023-03-22 05:56:18] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 1 ms to minimize.
[2023-03-22 05:56:18] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 1 ms to minimize.
[2023-03-22 05:56:19] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 10 ms to minimize.
[2023-03-22 05:56:19] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 1 ms to minimize.
[2023-03-22 05:56:19] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 0 ms to minimize.
[2023-03-22 05:56:19] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 0 ms to minimize.
[2023-03-22 05:56:20] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 0 ms to minimize.
[2023-03-22 05:56:20] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 0 ms to minimize.
[2023-03-22 05:56:20] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 1 ms to minimize.
[2023-03-22 05:56:21] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2023-03-22 05:56:21] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-22 05:56:21] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 0 ms to minimize.
[2023-03-22 05:56:22] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-03-22 05:56:22] [INFO ] Deduced a trap composed of 27 places in 576 ms of which 1 ms to minimize.
[2023-03-22 05:56:23] [INFO ] Deduced a trap composed of 35 places in 611 ms of which 4 ms to minimize.
[2023-03-22 05:56:23] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 0 ms to minimize.
[2023-03-22 05:56:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 8007 ms
[2023-03-22 05:56:24] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 1 ms to minimize.
[2023-03-22 05:56:24] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 1 ms to minimize.
[2023-03-22 05:56:25] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 1 ms to minimize.
[2023-03-22 05:56:25] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 1 ms to minimize.
[2023-03-22 05:56:26] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 1 ms to minimize.
[2023-03-22 05:56:26] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-22 05:56:26] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 1 ms to minimize.
[2023-03-22 05:56:27] [INFO ] Deduced a trap composed of 31 places in 640 ms of which 14 ms to minimize.
[2023-03-22 05:56:27] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2023-03-22 05:56:28] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 1 ms to minimize.
[2023-03-22 05:56:28] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2023-03-22 05:56:28] [INFO ] Deduced a trap composed of 28 places in 363 ms of which 0 ms to minimize.
[2023-03-22 05:56:29] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 1 ms to minimize.
[2023-03-22 05:56:29] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2023-03-22 05:56:29] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 1 ms to minimize.
[2023-03-22 05:56:29] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 5883 ms
[2023-03-22 05:56:29] [INFO ] After 24349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-22 05:56:29] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 210 ms.
Support contains 54 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1563 transition count 1084
Reduce places removed 339 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 353 rules applied. Total rules applied 692 place count 1224 transition count 1070
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 706 place count 1210 transition count 1070
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 706 place count 1210 transition count 986
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 874 place count 1126 transition count 986
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 1004 place count 996 transition count 856
Iterating global reduction 3 with 130 rules applied. Total rules applied 1134 place count 996 transition count 856
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1134 place count 996 transition count 803
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1240 place count 943 transition count 803
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1884 place count 621 transition count 481
Renaming transitions due to excessive name length > 1024 char.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1984 place count 571 transition count 481
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1988 place count 571 transition count 477
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1992 place count 567 transition count 477
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 4 with 47 rules applied. Total rules applied 2039 place count 567 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2040 place count 566 transition count 476
Applied a total of 2040 rules in 366 ms. Remains 566 /1563 variables (removed 997) and now considering 476/1423 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 566/1563 places, 476/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :3
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 476 rows 566 cols
[2023-03-22 05:56:30] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-22 05:56:30] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:30] [INFO ] [Nat]Absence check using 221 positive place invariants in 44 ms returned sat
[2023-03-22 05:56:31] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 05:56:31] [INFO ] After 67ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:32] [INFO ] Deduced a trap composed of 6 places in 800 ms of which 23 ms to minimize.
[2023-03-22 05:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 862 ms
[2023-03-22 05:56:32] [INFO ] After 986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 05:56:32] [INFO ] After 1377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 12 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 476/476 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 566 transition count 464
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 554 transition count 464
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 24 place count 554 transition count 455
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 42 place count 545 transition count 455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 544 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 544 transition count 454
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 73 place count 529 transition count 440
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 529 transition count 438
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 75 place count 529 transition count 436
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 527 transition count 436
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 93 place count 520 transition count 435
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 100 place count 520 transition count 435
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 512 transition count 427
Applied a total of 108 rules in 117 ms. Remains 512 /566 variables (removed 54) and now considering 427/476 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 512/566 places, 427/476 transitions.
Finished random walk after 2791 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=174 )
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29087 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/636/inv_0_ --invariant=/tmp/636/inv_1_ --invariant=/tmp/636/inv_2_ --invariant=/tmp/636/inv_3_ --invariant=/tmp/636/inv_4_ --invariant=/tmp/636/inv_5_ --invariant=/tmp/636/inv_6_ --invariant=/tmp/636/inv_7_ --invariant=/tmp/636/inv_8_ --invariant=/tmp/636/inv_9_ --invariant=/tmp/636/inv_10_ --invariant=/tmp/636/inv_11_ --invariant=/tmp/636/inv_12_ --invariant=/tmp/636/inv_13_ --invariant=/tmp/636/inv_14_ --invariant=/tmp/636/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 163312 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16293928 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
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="ShieldPPPt-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 ShieldPPPt-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-167903717300638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-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 '
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 ;