About the Execution of Marcie+red for ASLink-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10216.287 | 3600000.00 | 3705678.00 | 179.90 | FF?TTT??TTFFFT?F | 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.r010-oct2-167813598600118.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 marciexred
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 r010-oct2-167813598600118
=====================================================================
--------------------
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 1678667181873
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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 00:26:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:26:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:26:25] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-13 00:26:25] [INFO ] Transformed 3222 places.
[2023-03-13 00:26:25] [INFO ] Transformed 3986 transitions.
[2023-03-13 00:26:25] [INFO ] Found NUPN structural information;
[2023-03-13 00:26:25] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 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 14 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
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-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
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 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 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 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-13 00:26:27] [INFO ] Computed 316 place invariants in 111 ms
[2023-03-13 00:26:28] [INFO ] After 1642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 00:26:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 47 ms returned sat
[2023-03-13 00:26:30] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 300 ms returned sat
[2023-03-13 00:26:53] [INFO ] After 22581ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-13 00:26:53] [INFO ] After 22589ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 00:26:53] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA ASLink-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 286 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 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3222 transition count 3288
Reduce places removed 698 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 727 rules applied. Total rules applied 1425 place count 2524 transition count 3259
Reduce places removed 6 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 30 rules applied. Total rules applied 1455 place count 2518 transition count 3235
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 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 7 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 14 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 13 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 7 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 4 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 5 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 5 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 3 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 3 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 2243 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 2243 ms. Remains : 1197/3222 places, 1934/3986 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 8) seen :2
FORMULA ASLink-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1934 rows 1197 cols
[2023-03-13 00:26:57] [INFO ] Computed 206 place invariants in 36 ms
[2023-03-13 00:26:57] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:26:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 13 ms returned sat
[2023-03-13 00:26:57] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 173 ms returned sat
[2023-03-13 00:27:07] [INFO ] After 9292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:27:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 00:27:10] [INFO ] After 3062ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 00:27:11] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 9 ms to minimize.
[2023-03-13 00:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2023-03-13 00:27:11] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2023-03-13 00:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 559 ms
[2023-03-13 00:27:21] [INFO ] Deduced a trap composed of 83 places in 428 ms of which 20 ms to minimize.
[2023-03-13 00:27:21] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2023-03-13 00:27:22] [INFO ] Deduced a trap composed of 51 places in 434 ms of which 10 ms to minimize.
[2023-03-13 00:27:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1396 ms
[2023-03-13 00:27:22] [INFO ] After 15064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 00:27:22] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 36 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 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 26 place count 1184 transition count 1892
Deduced a syphon composed of 29 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 92 place count 1147 transition count 1892
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 94 place count 1146 transition count 1891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 1145 transition count 1891
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 95 place count 1145 transition count 1888
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 102 place count 1141 transition count 1888
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 4 with 18 rules applied. Total rules applied 120 place count 1132 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 1131 transition count 1871
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 1131 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 1130 transition count 1863
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 1130 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 1129 transition count 1855
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 1129 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 1128 transition count 1847
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 1128 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 1127 transition count 1839
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 1127 transition count 1839
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 1127 transition count 1837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 1125 transition count 1837
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 1123 transition count 1835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 1122 transition count 1835
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 137 place count 1122 transition count 1834
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 1121 transition count 1834
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 1120 transition count 1834
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 144 place count 1118 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 145 place count 1117 transition count 1831
Iterating global reduction 7 with 1 rules applied. Total rules applied 146 place count 1117 transition count 1831
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 147 place count 1117 transition count 1830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 148 place count 1116 transition count 1830
Applied a total of 148 rules in 545 ms. Remains 1116 /1197 variables (removed 81) and now considering 1830/1934 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 1116/1197 places, 1830/1934 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 115456 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115456 steps, saw 43635 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1830 rows 1116 cols
[2023-03-13 00:27:26] [INFO ] Computed 194 place invariants in 21 ms
[2023-03-13 00:27:27] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:27:27] [INFO ] [Nat]Absence check using 47 positive place invariants in 20 ms returned sat
[2023-03-13 00:27:27] [INFO ] [Nat]Absence check using 47 positive and 147 generalized place invariants in 67 ms returned sat
[2023-03-13 00:27:35] [INFO ] After 8261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:27:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 00:27:41] [INFO ] After 5151ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 00:27:41] [INFO ] Deduced a trap composed of 100 places in 261 ms of which 1 ms to minimize.
[2023-03-13 00:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2023-03-13 00:27:51] [INFO ] After 15613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 574 ms.
[2023-03-13 00:27:52] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 395 ms.
Support contains 36 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1830/1830 transitions.
Applied a total of 0 rules in 37 ms. Remains 1116 /1116 variables (removed 0) and now considering 1830/1830 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1116/1116 places, 1830/1830 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1830/1830 transitions.
Applied a total of 0 rules in 33 ms. Remains 1116 /1116 variables (removed 0) and now considering 1830/1830 (removed 0) transitions.
[2023-03-13 00:27:52] [INFO ] Invariant cache hit.
[2023-03-13 00:27:53] [INFO ] Implicit Places using invariants in 887 ms returned [1, 18, 19, 31, 48, 67, 138, 142, 152, 153, 157, 174, 192, 232, 249, 292, 293, 294, 295, 297, 314, 333, 410, 425, 426, 428, 445, 463, 536, 540, 541, 552, 553, 555, 572, 591, 668, 669, 682, 696, 699, 700, 702, 719, 737, 810, 814, 815, 826, 827, 829, 846, 864, 940, 945, 958, 959, 960, 978, 980, 984, 1002, 1003, 1004, 1005, 1017, 1023, 1029, 1035, 1041, 1047, 1053, 1059, 1065, 1071, 1077]
Discarding 76 places :
Implicit Place search using SMT only with invariants took 894 ms to find 76 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1040/1116 places, 1830/1830 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 1040 transition count 1705
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 136 rules applied. Total rules applied 261 place count 915 transition count 1694
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 270 place count 906 transition count 1694
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 270 place count 906 transition count 1657
Deduced a syphon composed of 37 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 75 rules applied. Total rules applied 345 place count 868 transition count 1657
Discarding 5 places :
Implicit places reduction removed 5 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 13 rules applied. Total rules applied 358 place count 863 transition count 1649
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 366 place count 855 transition count 1649
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 378 place count 843 transition count 1637
Iterating global reduction 5 with 12 rules applied. Total rules applied 390 place count 843 transition count 1637
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 392 place count 843 transition count 1635
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 395 place count 840 transition count 1629
Iterating global reduction 6 with 3 rules applied. Total rules applied 398 place count 840 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 399 place count 839 transition count 1628
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 839 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 401 place count 838 transition count 1626
Iterating global reduction 6 with 1 rules applied. Total rules applied 402 place count 838 transition count 1626
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 506 place count 786 transition count 1574
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 510 place count 782 transition count 1570
Iterating global reduction 6 with 4 rules applied. Total rules applied 514 place count 782 transition count 1570
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 518 place count 782 transition count 1566
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 522 place count 780 transition count 1567
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 523 place count 780 transition count 1566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 524 place count 779 transition count 1566
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 545 place count 779 transition count 1545
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 567 place count 757 transition count 1545
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 569 place count 757 transition count 1543
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 587 place count 757 transition count 1543
Applied a total of 587 rules in 409 ms. Remains 757 /1040 variables (removed 283) and now considering 1543/1830 (removed 287) transitions.
// Phase 1: matrix 1543 rows 757 cols
[2023-03-13 00:27:53] [INFO ] Computed 111 place invariants in 10 ms
[2023-03-13 00:27:54] [INFO ] Implicit Places using invariants in 788 ms returned [73, 90, 97, 104, 167, 194, 197, 199, 204, 209, 210, 280, 287, 290, 292, 304, 305, 359, 377, 384, 387, 389, 395, 396, 470, 476, 479, 494, 503, 557, 574, 581, 594, 595, 666, 672, 675, 677, 680, 754]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 790 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 717/1116 places, 1543/1830 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 717 transition count 1540
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 714 transition count 1540
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 20 place count 700 transition count 1526
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 700 transition count 1526
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 696 transition count 1522
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 696 transition count 1522
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 684 transition count 1510
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 84 place count 684 transition count 1492
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 102 place count 666 transition count 1492
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 666 transition count 1488
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 662 transition count 1488
Applied a total of 110 rules in 173 ms. Remains 662 /717 variables (removed 55) and now considering 1488/1543 (removed 55) transitions.
// Phase 1: matrix 1488 rows 662 cols
[2023-03-13 00:27:54] [INFO ] Computed 71 place invariants in 11 ms
[2023-03-13 00:27:55] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-13 00:27:55] [INFO ] Invariant cache hit.
[2023-03-13 00:27:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:27:56] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 662/1116 places, 1488/1830 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4430 ms. Remains : 662/1116 places, 1488/1830 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 208787 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{0=1}
Probabilistic random walk after 208787 steps, saw 53088 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :1
FORMULA ASLink-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-13 00:28:00] [INFO ] Invariant cache hit.
[2023-03-13 00:28:00] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:28:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-13 00:28:01] [INFO ] [Nat]Absence check using 17 positive and 54 generalized place invariants in 41 ms returned sat
[2023-03-13 00:28:12] [INFO ] After 10836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:28:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:28:12] [INFO ] After 351ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 00:28:12] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-13 00:28:12] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 0 ms to minimize.
[2023-03-13 00:28:13] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 1 ms to minimize.
[2023-03-13 00:28:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 921 ms
[2023-03-13 00:28:13] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 1 ms to minimize.
[2023-03-13 00:28:14] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 0 ms to minimize.
[2023-03-13 00:28:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 730 ms
[2023-03-13 00:28:14] [INFO ] After 2648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 509 ms.
[2023-03-13 00:28:15] [INFO ] After 14408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 99 ms.
Support contains 34 out of 662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 662/662 places, 1488/1488 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 662 transition count 1487
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 661 transition count 1487
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 659 transition count 1485
Applied a total of 6 rules in 56 ms. Remains 659 /662 variables (removed 3) and now considering 1485/1488 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 659/662 places, 1485/1488 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :1
FORMULA ASLink-PT-07b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1485 rows 659 cols
[2023-03-13 00:28:15] [INFO ] Computed 71 place invariants in 9 ms
[2023-03-13 00:28:15] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2023-03-13 00:28:15] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-13 00:28:15] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:28:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 00:28:16] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-13 00:28:24] [INFO ] After 8463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:28:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:28:29] [INFO ] After 4744ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 00:28:29] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-13 00:28:30] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 0 ms to minimize.
[2023-03-13 00:28:30] [INFO ] Deduced a trap composed of 16 places in 367 ms of which 1 ms to minimize.
[2023-03-13 00:28:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1774 ms
[2023-03-13 00:28:31] [INFO ] After 7435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 422 ms.
[2023-03-13 00:28:32] [INFO ] After 16553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 130 ms.
Support contains 33 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1485/1485 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 659 transition count 1484
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 658 transition count 1484
Applied a total of 2 rules in 28 ms. Remains 658 /659 variables (removed 1) and now considering 1484/1485 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 658/659 places, 1484/1485 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 187772 steps, run timeout after 3005 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187772 steps, saw 49006 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1484 rows 658 cols
[2023-03-13 00:28:35] [INFO ] Computed 71 place invariants in 12 ms
[2023-03-13 00:28:36] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-13 00:28:36] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 25 ms returned sat
[2023-03-13 00:28:36] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:28:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2023-03-13 00:28:36] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 34 ms returned sat
[2023-03-13 00:28:46] [INFO ] After 10207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:28:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:28:47] [INFO ] After 673ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 00:28:47] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 1 ms to minimize.
[2023-03-13 00:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-13 00:28:48] [INFO ] After 1354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 479 ms.
[2023-03-13 00:28:48] [INFO ] After 12357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 74 ms.
Support contains 33 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1484/1484 transitions.
Applied a total of 0 rules in 35 ms. Remains 658 /658 variables (removed 0) and now considering 1484/1484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 658/658 places, 1484/1484 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1484/1484 transitions.
Applied a total of 0 rules in 20 ms. Remains 658 /658 variables (removed 0) and now considering 1484/1484 (removed 0) transitions.
[2023-03-13 00:28:48] [INFO ] Invariant cache hit.
[2023-03-13 00:28:49] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-13 00:28:49] [INFO ] Invariant cache hit.
[2023-03-13 00:28:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:28:50] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
[2023-03-13 00:28:51] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-13 00:28:51] [INFO ] Invariant cache hit.
[2023-03-13 00:28:52] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3366 ms. Remains : 658/658 places, 1484/1484 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 658 transition count 1481
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 655 transition count 1481
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 0 with 2 rules applied. Total rules applied 8 place count 654 transition count 1480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 654 transition count 1479
Applied a total of 9 rules in 58 ms. Remains 654 /658 variables (removed 4) and now considering 1479/1484 (removed 5) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1479 rows 654 cols
[2023-03-13 00:28:52] [INFO ] Computed 71 place invariants in 26 ms
[2023-03-13 00:28:52] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 00:28:52] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 29 ms returned sat
[2023-03-13 00:28:53] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:28:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-13 00:28:53] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-13 00:29:03] [INFO ] After 9580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:29:03] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 0 ms to minimize.
[2023-03-13 00:29:04] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 1 ms to minimize.
[2023-03-13 00:29:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3303 ms
[2023-03-13 00:29:06] [INFO ] After 13455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 848 ms.
[2023-03-13 00:29:07] [INFO ] After 14593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 00:29:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 38 ms.
[2023-03-13 00:29:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 658 places, 1484 transitions and 6016 arcs took 26 ms.
[2023-03-13 00:29:08] [INFO ] Flatten gal took : 164 ms
Total runtime 162850 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ASLink_PT_07b
(NrP: 658 NrTr: 1484 NrArc: 6016)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.075sec
net check time: 0m 0.001sec
init dd package: 0m 3.023sec
before gc: list nodes free: 1019028
after gc: idd nodes used:26738, unused:63973262; list nodes free:265904236
before gc: list nodes free: 373178
after gc: idd nodes used:37263, unused:63962737; list nodes free:273807384
before gc: list nodes free: 1677236
after gc: idd nodes used:44035, unused:63955965; list nodes free:288135777
before gc: list nodes free: 723584
after gc: idd nodes used:81451, unused:63918549; list nodes free:301192218
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5931140 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099816 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.009sec
4841 5867 8624 9826 9884 10932 11482 12395 13771 15193 15280 17128 16596 19017 16686 19025 21866 17103 23540 27234 22940 27136 24559 30165 28230 31731 28018 35180 29760 36994 30925 37072 27280 34991 41738 42196 38040 43375 35779 45420 37574 48334 38699 50128 38189 51960 44343 56559 41542 53969 57644 47843 58558 53024 54881 61984 49303 64978 46069 66502 39622 68630 49832 70373 60827 78147 52417 73847 75104 63918 77618 78172 65526 86397 51940 77881 47851 80541 54225 86864 57250 89795 63830 96076 65419 93538 93486 83919 96125 97033 79768 98890 56274 95923 102811 97409
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="marciexred"
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 marciexred"
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 r010-oct2-167813598600118"
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 '
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 ;