fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814481500694
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DLCround-PT-07b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4979.752 3588274.00 14281316.00 456.30 TFFFFFTFTFTFTTTF 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.r105-tall-167814481500694.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DLCround-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481500694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 963K Mar 5 18:22 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 DLCround-PT-07b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678361954968

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=DLCround-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 11:39:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 11:39:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:39:16] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-09 11:39:16] [INFO ] Transformed 2703 places.
[2023-03-09 11:39:16] [INFO ] Transformed 4071 transitions.
[2023-03-09 11:39:16] [INFO ] Found NUPN structural information;
[2023-03-09 11:39:16] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 15) seen :6
FORMULA DLCround-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 4071 rows 2703 cols
[2023-03-09 11:39:17] [INFO ] Computed 132 place invariants in 40 ms
[2023-03-09 11:39:19] [INFO ] After 1043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 11:39:19] [INFO ] [Nat]Absence check using 132 positive place invariants in 102 ms returned sat
[2023-03-09 11:39:22] [INFO ] After 2587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 11:39:23] [INFO ] Deduced a trap composed of 107 places in 483 ms of which 7 ms to minimize.
[2023-03-09 11:39:23] [INFO ] Deduced a trap composed of 151 places in 346 ms of which 1 ms to minimize.
[2023-03-09 11:39:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1182 ms
[2023-03-09 11:39:25] [INFO ] Deduced a trap composed of 168 places in 265 ms of which 1 ms to minimize.
[2023-03-09 11:39:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 504 ms
[2023-03-09 11:39:26] [INFO ] Deduced a trap composed of 127 places in 299 ms of which 7 ms to minimize.
[2023-03-09 11:39:27] [INFO ] Deduced a trap composed of 128 places in 256 ms of which 1 ms to minimize.
[2023-03-09 11:39:27] [INFO ] Deduced a trap composed of 184 places in 264 ms of which 2 ms to minimize.
[2023-03-09 11:39:27] [INFO ] Deduced a trap composed of 182 places in 242 ms of which 0 ms to minimize.
[2023-03-09 11:39:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1610 ms
[2023-03-09 11:39:27] [INFO ] After 7609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1136 ms.
[2023-03-09 11:39:29] [INFO ] After 10016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA DLCround-PT-07b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 365 ms.
Support contains 52 out of 2703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Graph (trivial) has 2451 edges and 2703 vertex of which 357 / 2703 are part of one of the 34 SCC in 14 ms
Free SCC test removed 323 places
Drop transitions removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Drop transitions removed 1032 transitions
Trivial Post-agglo rules discarded 1032 transitions
Performed 1032 trivial Post agglomeration. Transition count delta: 1032
Iterating post reduction 0 with 1032 rules applied. Total rules applied 1033 place count 2380 transition count 2673
Reduce places removed 1032 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 1091 rules applied. Total rules applied 2124 place count 1348 transition count 2614
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 31 rules applied. Total rules applied 2155 place count 1323 transition count 2608
Reduce places removed 3 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 3 with 38 rules applied. Total rules applied 2193 place count 1320 transition count 2573
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 2229 place count 1285 transition count 2572
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 2229 place count 1285 transition count 2553
Deduced a syphon composed of 19 places in 8 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 2267 place count 1266 transition count 2553
Discarding 301 places :
Symmetric choice reduction at 5 with 301 rule applications. Total rules 2568 place count 965 transition count 2252
Iterating global reduction 5 with 301 rules applied. Total rules applied 2869 place count 965 transition count 2252
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 124 Pre rules applied. Total rules applied 2869 place count 965 transition count 2128
Deduced a syphon composed of 124 places in 7 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 5 with 248 rules applied. Total rules applied 3117 place count 841 transition count 2128
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 3157 place count 801 transition count 1694
Iterating global reduction 5 with 40 rules applied. Total rules applied 3197 place count 801 transition count 1694
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 3206 place count 801 transition count 1685
Performed 214 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 214 places in 1 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 6 with 428 rules applied. Total rules applied 3634 place count 587 transition count 1464
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3637 place count 587 transition count 1461
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3644 place count 580 transition count 1384
Iterating global reduction 7 with 7 rules applied. Total rules applied 3651 place count 580 transition count 1384
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -555
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 3785 place count 513 transition count 1939
Drop transitions removed 75 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 7 with 82 rules applied. Total rules applied 3867 place count 513 transition count 1857
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 3883 place count 497 transition count 1507
Iterating global reduction 8 with 16 rules applied. Total rules applied 3899 place count 497 transition count 1507
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 3908 place count 497 transition count 1498
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 3918 place count 492 transition count 1553
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 3921 place count 492 transition count 1550
Drop transitions removed 164 transitions
Redundant transition composition rules discarded 164 transitions
Iterating global reduction 10 with 164 rules applied. Total rules applied 4085 place count 492 transition count 1386
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 4092 place count 485 transition count 1294
Iterating global reduction 10 with 7 rules applied. Total rules applied 4099 place count 485 transition count 1294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4107 place count 485 transition count 1286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4109 place count 484 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4110 place count 483 transition count 1274
Iterating global reduction 11 with 1 rules applied. Total rules applied 4111 place count 483 transition count 1274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4112 place count 483 transition count 1273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 4118 place count 480 transition count 1296
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 4120 place count 480 transition count 1294
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 4133 place count 480 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 4134 place count 479 transition count 1270
Iterating global reduction 13 with 1 rules applied. Total rules applied 4135 place count 479 transition count 1270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 4136 place count 479 transition count 1269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4138 place count 478 transition count 1279
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4139 place count 478 transition count 1278
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 4148 place count 478 transition count 1269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4150 place count 477 transition count 1280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 4151 place count 477 transition count 1279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 4152 place count 477 transition count 1278
Free-agglomeration rule applied 207 times with reduction of 85 identical transitions.
Iterating global reduction 16 with 207 rules applied. Total rules applied 4359 place count 477 transition count 986
Reduce places removed 207 places and 0 transitions.
Drop transitions removed 259 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 266 transitions.
Graph (complete) has 834 edges and 270 vertex of which 263 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 474 rules applied. Total rules applied 4833 place count 263 transition count 720
Discarding 22 places :
Symmetric choice reduction at 17 with 22 rule applications. Total rules 4855 place count 241 transition count 676
Iterating global reduction 17 with 22 rules applied. Total rules applied 4877 place count 241 transition count 676
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 17 with 84 rules applied. Total rules applied 4961 place count 241 transition count 592
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 4964 place count 238 transition count 592
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 4975 place count 227 transition count 569
Iterating global reduction 18 with 11 rules applied. Total rules applied 4986 place count 227 transition count 569
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 4987 place count 227 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 4988 place count 226 transition count 568
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 4989 place count 226 transition count 582
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 4999 place count 225 transition count 573
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 20 with 6 rules applied. Total rules applied 5005 place count 225 transition count 567
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 5009 place count 225 transition count 567
Applied a total of 5009 rules in 839 ms. Remains 225 /2703 variables (removed 2478) and now considering 567/4071 (removed 3504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 225/2703 places, 567/4071 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :2
FORMULA DLCround-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 11:39:30] [INFO ] Flow matrix only has 401 transitions (discarded 166 similar events)
// Phase 1: matrix 401 rows 225 cols
[2023-03-09 11:39:30] [INFO ] Computed 89 place invariants in 6 ms
[2023-03-09 11:39:30] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:39:30] [INFO ] [Nat]Absence check using 89 positive place invariants in 12 ms returned sat
[2023-03-09 11:39:30] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:39:30] [INFO ] State equation strengthened by 105 read => feed constraints.
[2023-03-09 11:39:30] [INFO ] After 58ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 11:39:30] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-09 11:39:30] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 567/567 transitions.
Graph (trivial) has 59 edges and 225 vertex of which 7 / 225 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 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 7 place count 221 transition count 554
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 215 transition count 554
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 215 transition count 547
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 208 transition count 547
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 204 transition count 542
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 204 transition count 542
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 53 place count 195 transition count 532
Drop transitions removed 44 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 61 transitions.
Graph (complete) has 586 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 62 rules applied. Total rules applied 115 place count 193 transition count 471
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 125 place count 183 transition count 444
Iterating global reduction 3 with 10 rules applied. Total rules applied 135 place count 183 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 183 transition count 443
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 148 place count 177 transition count 467
Drop transitions removed 14 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 166 place count 177 transition count 449
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 199 place count 177 transition count 416
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 201 place count 175 transition count 402
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 175 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 206 place count 175 transition count 399
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 211 place count 175 transition count 394
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 175 transition count 392
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 506 edges and 173 vertex of which 168 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 7 rules applied. Total rules applied 220 place count 168 transition count 388
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 236 place count 168 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 238 place count 167 transition count 378
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 167 transition count 409
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 250 place count 166 transition count 399
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 274 place count 166 transition count 375
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 275 place count 166 transition count 375
Applied a total of 275 rules in 86 ms. Remains 166 /225 variables (removed 59) and now considering 375/567 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 166/225 places, 375/567 transitions.
Finished random walk after 3227 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=230 )
FORMULA DLCround-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14469 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/491/inv_0_ --invariant=/tmp/491/inv_1_ --invariant=/tmp/491/inv_2_ --invariant=/tmp/491/inv_3_ --invariant=/tmp/491/inv_4_ --invariant=/tmp/491/inv_5_ --invariant=/tmp/491/inv_6_ --invariant=/tmp/491/inv_7_ --invariant=/tmp/491/inv_8_ --invariant=/tmp/491/inv_9_ --invariant=/tmp/491/inv_10_ --invariant=/tmp/491/inv_11_ --invariant=/tmp/491/inv_12_ --invariant=/tmp/491/inv_13_ --invariant=/tmp/491/inv_14_ --invariant=/tmp/491/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 11169192 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16099072 kB
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-00
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-01
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-02
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-03
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-04
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-05
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-06
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-07
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-08
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-09
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-10
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-11
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-12
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-13
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-14
Could not compute solution for formula : DLCround-PT-07b-ReachabilityCardinality-15

BK_STOP 1678365543242

--------------------
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 DLCround-PT-07b-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/491/inv_0_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_1_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_2_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_3_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_4_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_5_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/491/inv_6_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_7_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/491/inv_8_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_9_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/491/inv_10_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_11_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/491/inv_12_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/491/inv_13_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_14_
rfs formula name DLCround-PT-07b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/491/inv_15_
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 2703 places, 4071 transitions and 11073 arcs
pnml2lts-sym: Petri net DLCround-PT-07b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.040 real 0.020 user 0.020 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: 4071->4071 groups
pnml2lts-sym: Regrouping took 7.310 real 7.270 user 0.020 sys
pnml2lts-sym: state vector length is 2703; there are 4071 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 497
Killing (9) : 497

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="DLCround-PT-07b"
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 DLCround-PT-07b, 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 r105-tall-167814481500694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07b.tgz
mv DLCround-PT-07b 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 ;