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.r009-oct2-167813597500118.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 ASLink-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 1.1M 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 ASLink-PT-07b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678613524540

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=ASLink-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:32:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 09:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:32:07] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-12 09:32:07] [INFO ] Transformed 3222 places.
[2023-03-12 09:32:07] [INFO ] Transformed 3986 transitions.
[2023-03-12 09:32:07] [INFO ] Found NUPN structural information;
[2023-03-12 09:32:07] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-07b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 14) seen :6
FORMULA ASLink-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-12 09:32:08] [INFO ] Computed 316 place invariants in 142 ms
[2023-03-12 09:32:09] [INFO ] After 1367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 09:32:10] [INFO ] [Nat]Absence check using 75 positive place invariants in 79 ms returned sat
[2023-03-12 09:32:11] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 259 ms returned sat
[2023-03-12 09:32:34] [INFO ] After 23198ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 09:32:35] [INFO ] After 23225ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 09:32:35] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ASLink-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 564 ms.
Support contains 88 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3222 transition count 3289
Reduce places removed 697 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 1 with 726 rules applied. Total rules applied 1423 place count 2525 transition count 3260
Reduce places removed 6 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 31 rules applied. Total rules applied 1454 place count 2519 transition count 3235
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1479 place count 2494 transition count 3235
Performed 712 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 712 Pre rules applied. Total rules applied 1479 place count 2494 transition count 2523
Deduced a syphon composed of 712 places in 6 ms
Ensure Unique test removed 60 places
Reduce places removed 772 places and 0 transitions.
Iterating global reduction 4 with 1484 rules applied. Total rules applied 2963 place count 1722 transition count 2523
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 4 with 48 rules applied. Total rules applied 3011 place count 1711 transition count 2486
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 39 rules applied. Total rules applied 3050 place count 1674 transition count 2484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3052 place count 1672 transition count 2484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 3052 place count 1672 transition count 2464
Deduced a syphon composed of 20 places in 15 ms
Ensure Unique test removed 15 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 55 rules applied. Total rules applied 3107 place count 1637 transition count 2464
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 3107 place count 1637 transition count 2450
Deduced a syphon composed of 14 places in 14 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 3135 place count 1623 transition count 2450
Discarding 97 places :
Symmetric choice reduction at 7 with 97 rule applications. Total rules 3232 place count 1526 transition count 2353
Iterating global reduction 7 with 97 rules applied. Total rules applied 3329 place count 1526 transition count 2353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3330 place count 1526 transition count 2352
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 30 Pre rules applied. Total rules applied 3330 place count 1526 transition count 2322
Deduced a syphon composed of 30 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 8 with 61 rules applied. Total rules applied 3391 place count 1495 transition count 2322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3391 place count 1495 transition count 2321
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 3394 place count 1493 transition count 2321
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3402 place count 1485 transition count 2270
Iterating global reduction 8 with 8 rules applied. Total rules applied 3410 place count 1485 transition count 2270
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 3410 place count 1485 transition count 2263
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 3424 place count 1478 transition count 2263
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3425 place count 1477 transition count 2255
Iterating global reduction 8 with 1 rules applied. Total rules applied 3426 place count 1477 transition count 2255
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3427 place count 1476 transition count 2247
Iterating global reduction 8 with 1 rules applied. Total rules applied 3428 place count 1476 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3429 place count 1475 transition count 2239
Iterating global reduction 8 with 1 rules applied. Total rules applied 3430 place count 1475 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3431 place count 1474 transition count 2231
Iterating global reduction 8 with 1 rules applied. Total rules applied 3432 place count 1474 transition count 2231
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3433 place count 1473 transition count 2223
Iterating global reduction 8 with 1 rules applied. Total rules applied 3434 place count 1473 transition count 2223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3435 place count 1472 transition count 2215
Iterating global reduction 8 with 1 rules applied. Total rules applied 3436 place count 1472 transition count 2215
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3437 place count 1471 transition count 2207
Iterating global reduction 8 with 1 rules applied. Total rules applied 3438 place count 1471 transition count 2207
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3439 place count 1470 transition count 2199
Iterating global reduction 8 with 1 rules applied. Total rules applied 3440 place count 1470 transition count 2199
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3441 place count 1469 transition count 2191
Iterating global reduction 8 with 1 rules applied. Total rules applied 3442 place count 1469 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3443 place count 1468 transition count 2183
Iterating global reduction 8 with 1 rules applied. Total rules applied 3444 place count 1468 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3445 place count 1467 transition count 2175
Iterating global reduction 8 with 1 rules applied. Total rules applied 3446 place count 1467 transition count 2175
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 4 ms
Ensure Unique test removed 6 places
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 8 with 388 rules applied. Total rules applied 3834 place count 1270 transition count 1984
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3835 place count 1269 transition count 1983
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 3837 place count 1268 transition count 1983
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3838 place count 1267 transition count 1982
Iterating global reduction 8 with 1 rules applied. Total rules applied 3839 place count 1267 transition count 1982
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 8 with 2 rules applied. Total rules applied 3841 place count 1267 transition count 1980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3842 place count 1266 transition count 1980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3844 place count 1265 transition count 1989
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3846 place count 1265 transition count 1987
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 10 with 4 rules applied. Total rules applied 3850 place count 1263 transition count 1985
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3852 place count 1261 transition count 1985
Free-agglomeration rule applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 3859 place count 1261 transition count 1978
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3866 place count 1254 transition count 1978
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 13 with 13 rules applied. Total rules applied 3879 place count 1254 transition count 1965
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 3892 place count 1241 transition count 1965
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 3893 place count 1241 transition count 1965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 3894 place count 1240 transition count 1964
Reduce places removed 7 places and 0 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 14 with 10 rules applied. Total rules applied 3904 place count 1233 transition count 1961
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 3907 place count 1230 transition count 1961
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 10 Pre rules applied. Total rules applied 3907 place count 1230 transition count 1951
Deduced a syphon composed of 10 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 21 rules applied. Total rules applied 3928 place count 1219 transition count 1951
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 16 with 5 rules applied. Total rules applied 3933 place count 1214 transition count 1951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 3933 place count 1214 transition count 1950
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 3935 place count 1213 transition count 1950
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 17 with 18 rules applied. Total rules applied 3953 place count 1204 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 3956 place count 1201 transition count 1938
Iterating global reduction 17 with 3 rules applied. Total rules applied 3959 place count 1201 transition count 1938
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 3963 place count 1201 transition count 1934
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 3967 place count 1197 transition count 1934
Applied a total of 3967 rules in 2471 ms. Remains 1197 /3222 variables (removed 2025) and now considering 1934/3986 (removed 2052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2472 ms. Remains : 1197/3222 places, 1934/3986 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :2
FORMULA ASLink-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1934 rows 1197 cols
[2023-03-12 09:32:38] [INFO ] Computed 206 place invariants in 48 ms
[2023-03-12 09:32:38] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:32:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2023-03-12 09:32:39] [INFO ] [Nat]Absence check using 50 positive and 156 generalized place invariants in 62 ms returned sat
[2023-03-12 09:32:49] [INFO ] After 10474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:32:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 09:32:56] [INFO ] After 6633ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 09:32:57] [INFO ] Deduced a trap composed of 15 places in 667 ms of which 7 ms to minimize.
[2023-03-12 09:32:57] [INFO ] Deduced a trap composed of 60 places in 418 ms of which 2 ms to minimize.
[2023-03-12 09:32:57] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 1 ms to minimize.
[2023-03-12 09:32:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1698 ms
[2023-03-12 09:32:58] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 14 ms to minimize.
[2023-03-12 09:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2023-03-12 09:32:59] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 13 ms to minimize.
[2023-03-12 09:32:59] [INFO ] Deduced a trap composed of 25 places in 598 ms of which 13 ms to minimize.
[2023-03-12 09:33:00] [INFO ] Deduced a trap composed of 23 places in 457 ms of which 2 ms to minimize.
[2023-03-12 09:33:00] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 10 ms to minimize.
[2023-03-12 09:33:01] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 1 ms to minimize.
[2023-03-12 09:33:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2661 ms
[2023-03-12 09:33:01] [INFO ] After 12186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 938 ms.
[2023-03-12 09:33:02] [INFO ] After 24119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 170 ms.
Support contains 35 out of 1197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1197/1197 places, 1934/1934 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1197 transition count 1921
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1184 transition count 1921
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 26 place count 1184 transition count 1891
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 94 place count 1146 transition count 1891
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 1145 transition count 1890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 1144 transition count 1890
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 97 place count 1144 transition count 1887
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 104 place count 1140 transition count 1887
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 122 place count 1131 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 1130 transition count 1870
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 1130 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 1129 transition count 1862
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 1129 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 1128 transition count 1854
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 1128 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 1127 transition count 1846
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 1127 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 1126 transition count 1838
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 1126 transition count 1838
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 1126 transition count 1836
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 136 place count 1124 transition count 1836
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 1122 transition count 1834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 1121 transition count 1834
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 139 place count 1121 transition count 1833
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 1120 transition count 1833
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 142 place count 1119 transition count 1833
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 146 place count 1117 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 147 place count 1116 transition count 1830
Iterating global reduction 7 with 1 rules applied. Total rules applied 148 place count 1116 transition count 1830
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 149 place count 1116 transition count 1829
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 150 place count 1115 transition count 1829
Applied a total of 150 rules in 569 ms. Remains 1115 /1197 variables (removed 82) and now considering 1829/1934 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 1115/1197 places, 1829/1934 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 149314 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149314 steps, saw 53580 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1829 rows 1115 cols
[2023-03-12 09:33:06] [INFO ] Computed 194 place invariants in 15 ms
[2023-03-12 09:33:07] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:33:07] [INFO ] [Nat]Absence check using 49 positive place invariants in 25 ms returned sat
[2023-03-12 09:33:07] [INFO ] [Nat]Absence check using 49 positive and 145 generalized place invariants in 139 ms returned sat
[2023-03-12 09:33:18] [INFO ] After 10433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:33:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 09:33:18] [INFO ] After 617ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 09:33:19] [INFO ] Deduced a trap composed of 119 places in 278 ms of which 1 ms to minimize.
[2023-03-12 09:33:19] [INFO ] Deduced a trap composed of 121 places in 215 ms of which 0 ms to minimize.
[2023-03-12 09:33:20] [INFO ] Deduced a trap composed of 118 places in 233 ms of which 0 ms to minimize.
[2023-03-12 09:33:20] [INFO ] Deduced a trap composed of 103 places in 320 ms of which 1 ms to minimize.
[2023-03-12 09:33:20] [INFO ] Deduced a trap composed of 106 places in 183 ms of which 0 ms to minimize.
[2023-03-12 09:33:21] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 0 ms to minimize.
[2023-03-12 09:33:21] [INFO ] Deduced a trap composed of 105 places in 243 ms of which 1 ms to minimize.
[2023-03-12 09:33:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2202 ms
[2023-03-12 09:33:22] [INFO ] After 3922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 396 ms.
[2023-03-12 09:33:22] [INFO ] After 15481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ASLink-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 117 ms.
Support contains 6 out of 1115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1115/1115 places, 1829/1829 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1115 transition count 1822
Reduce places removed 9 places and 0 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 10 rules applied. Total rules applied 17 place count 1106 transition count 1821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1105 transition count 1821
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 18 place count 1105 transition count 1802
Deduced a syphon composed of 19 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 58 place count 1084 transition count 1802
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 1083 transition count 1802
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 1083 transition count 1801
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 1081 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 1080 transition count 1800
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 1080 transition count 1800
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 82 place count 1070 transition count 1792
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 82 place count 1070 transition count 1788
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 90 place count 1066 transition count 1788
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 1065 transition count 1787
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 1065 transition count 1787
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 1063 transition count 1785
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 1063 transition count 1784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 1062 transition count 1784
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 1061 transition count 1783
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 102 place count 1059 transition count 1782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 103 place count 1058 transition count 1782
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 103 place count 1058 transition count 1779
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 109 place count 1055 transition count 1779
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 110 place count 1054 transition count 1779
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 114 place count 1052 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 115 place count 1051 transition count 1776
Iterating global reduction 8 with 1 rules applied. Total rules applied 116 place count 1051 transition count 1776
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 117 place count 1051 transition count 1775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 118 place count 1050 transition count 1775
Applied a total of 118 rules in 472 ms. Remains 1050 /1115 variables (removed 65) and now considering 1775/1829 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 1050/1115 places, 1775/1829 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 176602 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176602 steps, saw 53456 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1775 rows 1050 cols
[2023-03-12 09:33:26] [INFO ] Computed 183 place invariants in 16 ms
[2023-03-12 09:33:26] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 09:33:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 21 ms returned sat
[2023-03-12 09:33:27] [INFO ] [Nat]Absence check using 46 positive and 137 generalized place invariants in 67 ms returned sat
[2023-03-12 09:33:37] [INFO ] After 9899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:33:38] [INFO ] After 10919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7205 ms.
[2023-03-12 09:33:45] [INFO ] After 18524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 191 ms.
Support contains 6 out of 1050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1050/1050 places, 1775/1775 transitions.
Applied a total of 0 rules in 33 ms. Remains 1050 /1050 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1050/1050 places, 1775/1775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1050/1050 places, 1775/1775 transitions.
Applied a total of 0 rules in 54 ms. Remains 1050 /1050 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
[2023-03-12 09:33:45] [INFO ] Invariant cache hit.
[2023-03-12 09:33:46] [INFO ] Implicit Places using invariants in 827 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 224, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 506, 510, 511, 522, 523, 525, 542, 560, 630, 634, 635, 646, 647, 649, 666, 684, 753, 757, 758, 769, 770, 772, 789, 807, 876, 880, 881, 884, 895, 896, 897, 915, 917, 921, 939, 940, 941, 942, 954, 960, 966, 972, 978, 984, 990, 996, 1002, 1008, 1014]
Discarding 79 places :
Implicit Place search using SMT only with invariants took 833 ms to find 79 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 971/1050 places, 1775/1775 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 971 transition count 1634
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 150 rules applied. Total rules applied 291 place count 830 transition count 1625
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 293 place count 828 transition count 1625
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 293 place count 828 transition count 1590
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 364 place count 792 transition count 1590
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 376 place count 788 transition count 1582
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 384 place count 780 transition count 1582
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 399 place count 765 transition count 1567
Iterating global reduction 5 with 15 rules applied. Total rules applied 414 place count 765 transition count 1567
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 417 place count 765 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 417 place count 765 transition count 1563
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 419 place count 764 transition count 1563
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 422 place count 761 transition count 1557
Iterating global reduction 6 with 3 rules applied. Total rules applied 425 place count 761 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 426 place count 760 transition count 1556
Iterating global reduction 6 with 1 rules applied. Total rules applied 427 place count 760 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 759 transition count 1554
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 759 transition count 1554
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 527 place count 710 transition count 1505
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 534 place count 703 transition count 1498
Iterating global reduction 6 with 7 rules applied. Total rules applied 541 place count 703 transition count 1498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 547 place count 703 transition count 1492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 548 place count 702 transition count 1491
Iterating global reduction 7 with 1 rules applied. Total rules applied 549 place count 702 transition count 1491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 550 place count 702 transition count 1490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 554 place count 700 transition count 1491
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 570 place count 700 transition count 1475
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 587 place count 683 transition count 1475
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 606 place count 683 transition count 1475
Applied a total of 606 rules in 284 ms. Remains 683 /971 variables (removed 288) and now considering 1475/1775 (removed 300) transitions.
// Phase 1: matrix 1475 rows 683 cols
[2023-03-12 09:33:46] [INFO ] Computed 98 place invariants in 10 ms
[2023-03-12 09:33:47] [INFO ] Implicit Places using invariants in 811 ms returned [72, 89, 95, 97, 100, 103, 104, 156, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272, 277, 278, 330, 348, 355, 358, 360, 365, 366, 418, 436, 442, 445, 447, 452, 453, 505, 522, 528, 531, 533, 538, 539, 591, 608, 614, 617, 619]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 814 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 636/1050 places, 1475/1775 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 636 transition count 1474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 635 transition count 1474
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 617 transition count 1456
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 617 transition count 1456
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 611 transition count 1450
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 611 transition count 1450
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 80 place count 596 transition count 1435
Free-agglomeration rule applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 101 place count 596 transition count 1414
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 122 place count 575 transition count 1414
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 575 transition count 1408
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 134 place count 569 transition count 1408
Applied a total of 134 rules in 118 ms. Remains 569 /636 variables (removed 67) and now considering 1408/1475 (removed 67) transitions.
// Phase 1: matrix 1408 rows 569 cols
[2023-03-12 09:33:47] [INFO ] Computed 51 place invariants in 22 ms
[2023-03-12 09:33:48] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-12 09:33:48] [INFO ] Invariant cache hit.
[2023-03-12 09:33:49] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 569/1050 places, 1408/1775 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3867 ms. Remains : 569/1050 places, 1408/1775 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 182615 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{0=1}
Probabilistic random walk after 182615 steps, saw 126477 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :1
FORMULA ASLink-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-12 09:33:52] [INFO ] Invariant cache hit.
[2023-03-12 09:33:52] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2023-03-12 09:33:52] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-12 09:33:53] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:33:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 09:33:53] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 31 ms returned sat
[2023-03-12 09:33:54] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:33:55] [INFO ] After 1621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-12 09:33:55] [INFO ] After 2064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1408/1408 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 1407
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 1407
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 568 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 567 transition count 1406
Applied a total of 4 rules in 42 ms. Remains 567 /569 variables (removed 2) and now considering 1406/1408 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 567/569 places, 1406/1408 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 239704 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239704 steps, saw 84547 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1406 rows 567 cols
[2023-03-12 09:33:58] [INFO ] Computed 51 place invariants in 12 ms
[2023-03-12 09:33:58] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-12 09:33:58] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 26 ms returned sat
[2023-03-12 09:33:58] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:33:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 09:33:59] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-12 09:34:05] [INFO ] After 6690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:34:06] [INFO ] After 6955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1396 ms.
[2023-03-12 09:34:07] [INFO ] After 8536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 1406/1406 transitions.
Applied a total of 0 rules in 20 ms. Remains 567 /567 variables (removed 0) and now considering 1406/1406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 567/567 places, 1406/1406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 1406/1406 transitions.
Applied a total of 0 rules in 20 ms. Remains 567 /567 variables (removed 0) and now considering 1406/1406 (removed 0) transitions.
[2023-03-12 09:34:07] [INFO ] Invariant cache hit.
[2023-03-12 09:34:08] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-12 09:34:08] [INFO ] Invariant cache hit.
[2023-03-12 09:34:09] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2023-03-12 09:34:09] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-12 09:34:09] [INFO ] Invariant cache hit.
[2023-03-12 09:34:09] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2194 ms. Remains : 567/567 places, 1406/1406 transitions.
Applied a total of 0 rules in 18 ms. Remains 567 /567 variables (removed 0) and now considering 1406/1406 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-12 09:34:09] [INFO ] Invariant cache hit.
[2023-03-12 09:34:09] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 09:34:09] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 44 ms returned sat
[2023-03-12 09:34:09] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:34:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 09:34:10] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 19 ms returned sat
[2023-03-12 09:34:19] [INFO ] After 9678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:34:20] [INFO ] After 9862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 09:34:20] [INFO ] After 10167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:34:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 09:34:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 567 places, 1406 transitions and 5730 arcs took 18 ms.
[2023-03-12 09:34:20] [INFO ] Flatten gal took : 160 ms
Total runtime 133541 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/601/inv_0_ --invariant=/tmp/601/inv_1_ --invariant=/tmp/601/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13366764 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096184 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="ASLink-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 ASLink-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 r009-oct2-167813597500118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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