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

About the Execution of Smart+red for ASLink-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16151.115 3600000.00 3681253.00 419.20 TTT?TTFT?TFTTFFT 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.r011-oct2-167813599700102.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 smartxred
Input is ASLink-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599700102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:12 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.8K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:13 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 921K 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-06b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678724143725

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 16:15:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:15:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:15:45] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-13 16:15:45] [INFO ] Transformed 2826 places.
[2023-03-13 16:15:45] [INFO ] Transformed 3513 transitions.
[2023-03-13 16:15:45] [INFO ] Found NUPN structural information;
[2023-03-13 16:15:45] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 15) seen :8
FORMULA ASLink-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) 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 7) seen :1
FORMULA ASLink-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3513 rows 2826 cols
[2023-03-13 16:15:47] [INFO ] Computed 277 place invariants in 123 ms
[2023-03-13 16:15:48] [INFO ] After 1054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 16:15:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 50 ms returned sat
[2023-03-13 16:15:49] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 178 ms returned sat
[2023-03-13 16:16:13] [INFO ] After 23471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 16:16:13] [INFO ] After 23477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 16:16:13] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 71 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions removed 611 transitions
Trivial Post-agglo rules discarded 611 transitions
Performed 611 trivial Post agglomeration. Transition count delta: 611
Iterating post reduction 0 with 611 rules applied. Total rules applied 611 place count 2826 transition count 2902
Reduce places removed 611 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 641 rules applied. Total rules applied 1252 place count 2215 transition count 2872
Reduce places removed 8 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 28 rules applied. Total rules applied 1280 place count 2207 transition count 2852
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1300 place count 2187 transition count 2852
Performed 618 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 618 Pre rules applied. Total rules applied 1300 place count 2187 transition count 2234
Deduced a syphon composed of 618 places in 4 ms
Ensure Unique test removed 52 places
Reduce places removed 670 places and 0 transitions.
Iterating global reduction 4 with 1288 rules applied. Total rules applied 2588 place count 1517 transition count 2234
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 48 rules applied. Total rules applied 2636 place count 1502 transition count 2201
Reduce places removed 33 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 38 rules applied. Total rules applied 2674 place count 1469 transition count 2196
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2679 place count 1464 transition count 2196
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2679 place count 1464 transition count 2176
Deduced a syphon composed of 20 places in 15 ms
Ensure Unique test removed 16 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 2735 place count 1428 transition count 2176
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 2736 place count 1427 transition count 2176
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 2736 place count 1427 transition count 2159
Deduced a syphon composed of 17 places in 11 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2770 place count 1410 transition count 2159
Discarding 84 places :
Symmetric choice reduction at 8 with 84 rule applications. Total rules 2854 place count 1326 transition count 2075
Iterating global reduction 8 with 84 rules applied. Total rules applied 2938 place count 1326 transition count 2075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2939 place count 1326 transition count 2074
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 28 Pre rules applied. Total rules applied 2939 place count 1326 transition count 2046
Deduced a syphon composed of 28 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 57 rules applied. Total rules applied 2996 place count 1297 transition count 2046
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2996 place count 1297 transition count 2045
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 9 with 3 rules applied. Total rules applied 2999 place count 1295 transition count 2045
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 3006 place count 1288 transition count 2000
Iterating global reduction 9 with 7 rules applied. Total rules applied 3013 place count 1288 transition count 2000
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 3013 place count 1288 transition count 1996
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3021 place count 1284 transition count 1996
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3022 place count 1283 transition count 1988
Iterating global reduction 9 with 1 rules applied. Total rules applied 3023 place count 1283 transition count 1988
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3024 place count 1282 transition count 1980
Iterating global reduction 9 with 1 rules applied. Total rules applied 3025 place count 1282 transition count 1980
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3026 place count 1281 transition count 1972
Iterating global reduction 9 with 1 rules applied. Total rules applied 3027 place count 1281 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3028 place count 1280 transition count 1964
Iterating global reduction 9 with 1 rules applied. Total rules applied 3029 place count 1280 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3030 place count 1279 transition count 1956
Iterating global reduction 9 with 1 rules applied. Total rules applied 3031 place count 1279 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3032 place count 1278 transition count 1948
Iterating global reduction 9 with 1 rules applied. Total rules applied 3033 place count 1278 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3034 place count 1277 transition count 1940
Iterating global reduction 9 with 1 rules applied. Total rules applied 3035 place count 1277 transition count 1940
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 9 with 338 rules applied. Total rules applied 3373 place count 1106 transition count 1773
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3374 place count 1105 transition count 1772
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 3376 place count 1104 transition count 1772
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3377 place count 1103 transition count 1771
Iterating global reduction 9 with 1 rules applied. Total rules applied 3378 place count 1103 transition count 1771
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 9 with 2 rules applied. Total rules applied 3380 place count 1103 transition count 1769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3381 place count 1102 transition count 1769
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 11 with 2 rules applied. Total rules applied 3383 place count 1101 transition count 1778
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3391 place count 1101 transition count 1770
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3399 place count 1093 transition count 1770
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 3408 place count 1093 transition count 1761
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 3417 place count 1084 transition count 1761
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3418 place count 1084 transition count 1761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3419 place count 1083 transition count 1760
Reduce places removed 7 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 13 with 8 rules applied. Total rules applied 3427 place count 1076 transition count 1759
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 2 rules applied. Total rules applied 3429 place count 1075 transition count 1758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3430 place count 1074 transition count 1758
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 10 Pre rules applied. Total rules applied 3430 place count 1074 transition count 1748
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 3451 place count 1063 transition count 1748
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 16 with 5 rules applied. Total rules applied 3456 place count 1058 transition count 1748
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 3456 place count 1058 transition count 1747
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 3458 place count 1057 transition count 1747
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 3478 place count 1047 transition count 1737
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 3482 place count 1043 transition count 1733
Iterating global reduction 17 with 4 rules applied. Total rules applied 3486 place count 1043 transition count 1733
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 3489 place count 1043 transition count 1730
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 3492 place count 1040 transition count 1730
Applied a total of 3492 rules in 1942 ms. Remains 1040 /2826 variables (removed 1786) and now considering 1730/3513 (removed 1783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1946 ms. Remains : 1040/2826 places, 1730/3513 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :3
FORMULA ASLink-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1730 rows 1040 cols
[2023-03-13 16:16:15] [INFO ] Computed 173 place invariants in 36 ms
[2023-03-13 16:16:15] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 16:16:16] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-13 16:16:16] [INFO ] [Nat]Absence check using 44 positive and 129 generalized place invariants in 43 ms returned sat
[2023-03-13 16:16:23] [INFO ] After 7463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 16:16:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 16:16:33] [INFO ] After 9648ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 16:16:34] [INFO ] Deduced a trap composed of 108 places in 467 ms of which 22 ms to minimize.
[2023-03-13 16:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
[2023-03-13 16:16:34] [INFO ] After 10773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4117 ms.
[2023-03-13 16:16:38] [INFO ] After 22668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 173 ms.
Support contains 38 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 1730/1730 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1040 transition count 1719
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 1028 transition count 1719
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 23 place count 1028 transition count 1698
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 67 place count 1005 transition count 1698
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 1001 transition count 1694
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 999 transition count 1692
Applied a total of 77 rules in 93 ms. Remains 999 /1040 variables (removed 41) and now considering 1692/1730 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 999/1040 places, 1692/1730 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 193346 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193346 steps, saw 75019 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1692 rows 999 cols
[2023-03-13 16:16:42] [INFO ] Computed 170 place invariants in 41 ms
[2023-03-13 16:16:42] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 16:16:42] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-13 16:16:42] [INFO ] [Nat]Absence check using 45 positive and 125 generalized place invariants in 33 ms returned sat
[2023-03-13 16:16:53] [INFO ] After 10509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:16:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 16:16:53] [INFO ] After 491ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 16:16:54] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-13 16:16:54] [INFO ] After 12338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 38 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 1692/1692 transitions.
Applied a total of 0 rules in 59 ms. Remains 999 /999 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 999/999 places, 1692/1692 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 1692/1692 transitions.
Applied a total of 0 rules in 28 ms. Remains 999 /999 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
[2023-03-13 16:16:54] [INFO ] Invariant cache hit.
[2023-03-13 16:16:55] [INFO ] Implicit Places using invariants in 960 ms returned [1, 18, 19, 31, 48, 67, 139, 143, 152, 153, 156, 173, 191, 257, 290, 291, 293, 314, 333, 386, 410, 414, 415, 426, 427, 429, 446, 465, 537, 541, 542, 553, 554, 556, 573, 591, 645, 673, 688, 689, 692, 729, 810, 814, 815, 818, 829, 831, 832, 833, 861, 863, 867, 885, 886, 887, 888, 900, 906, 912, 919, 925, 931, 937, 945, 951, 957, 963]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 964 ms to find 68 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 931/999 places, 1692/1692 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 931 transition count 1601
Reduce places removed 91 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 108 rules applied. Total rules applied 199 place count 840 transition count 1584
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 217 place count 823 transition count 1583
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 217 place count 823 transition count 1553
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 278 place count 792 transition count 1553
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 16 rules applied. Total rules applied 294 place count 786 transition count 1543
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 304 place count 776 transition count 1543
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 318 place count 762 transition count 1529
Iterating global reduction 5 with 14 rules applied. Total rules applied 332 place count 762 transition count 1529
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 335 place count 762 transition count 1526
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 335 place count 762 transition count 1525
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 337 place count 761 transition count 1525
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 341 place count 757 transition count 1518
Iterating global reduction 6 with 4 rules applied. Total rules applied 345 place count 757 transition count 1518
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 756 transition count 1517
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 756 transition count 1517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 348 place count 756 transition count 1516
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 440 place count 710 transition count 1470
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 443 place count 707 transition count 1467
Iterating global reduction 7 with 3 rules applied. Total rules applied 446 place count 707 transition count 1467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 448 place count 707 transition count 1465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 450 place count 706 transition count 1467
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 451 place count 706 transition count 1466
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 452 place count 706 transition count 1465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 453 place count 705 transition count 1465
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 9 with 21 rules applied. Total rules applied 474 place count 705 transition count 1444
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 496 place count 683 transition count 1444
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 499 place count 683 transition count 1441
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 515 place count 683 transition count 1441
Applied a total of 515 rules in 348 ms. Remains 683 /931 variables (removed 248) and now considering 1441/1692 (removed 251) transitions.
// Phase 1: matrix 1441 rows 683 cols
[2023-03-13 16:16:56] [INFO ] Computed 94 place invariants in 11 ms
[2023-03-13 16:16:56] [INFO ] Implicit Places using invariants in 402 ms returned [74, 91, 98, 101, 103, 166, 197, 202, 207, 208, 266, 306, 311, 312, 383, 394, 396, 402, 403, 482, 485, 487, 492, 500, 501, 560, 583, 592, 599]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 404 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 654/999 places, 1441/1692 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 654 transition count 1440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 653 transition count 1440
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 646 transition count 1433
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 646 transition count 1433
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 644 transition count 1431
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 644 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 643 transition count 1430
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 643 transition count 1430
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 636 transition count 1423
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 636 transition count 1412
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 58 place count 625 transition count 1412
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 625 transition count 1410
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 623 transition count 1410
Applied a total of 62 rules in 174 ms. Remains 623 /654 variables (removed 31) and now considering 1410/1441 (removed 31) transitions.
// Phase 1: matrix 1410 rows 623 cols
[2023-03-13 16:16:56] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-13 16:16:57] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-13 16:16:57] [INFO ] Invariant cache hit.
[2023-03-13 16:16:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:16:58] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 623/999 places, 1410/1692 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4095 ms. Remains : 623/999 places, 1410/1692 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :1
FORMULA ASLink-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 16:16:59] [INFO ] Invariant cache hit.
[2023-03-13 16:16:59] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:16:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-13 16:16:59] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 26 ms returned sat
[2023-03-13 16:17:10] [INFO ] After 10813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:17:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:17:12] [INFO ] After 2187ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 16:17:14] [INFO ] After 4479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4037 ms.
[2023-03-13 16:17:18] [INFO ] After 19518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 51 ms.
Support contains 20 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1410/1410 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 623 transition count 1405
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 618 transition count 1404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 617 transition count 1404
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 617 transition count 1397
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 610 transition count 1397
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 609 transition count 1397
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 29 place count 607 transition count 1395
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 607 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 606 transition count 1393
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 606 transition count 1393
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 49 place count 598 transition count 1385
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 598 transition count 1383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 53 place count 596 transition count 1383
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 596 transition count 1382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 595 transition count 1381
Applied a total of 55 rules in 143 ms. Remains 595 /623 variables (removed 28) and now considering 1381/1410 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 595/623 places, 1381/1410 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 232262 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232262 steps, saw 138950 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1381 rows 595 cols
[2023-03-13 16:17:22] [INFO ] Computed 64 place invariants in 21 ms
[2023-03-13 16:17:22] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:17:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-13 16:17:22] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 19 ms returned sat
[2023-03-13 16:17:24] [INFO ] After 1965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:17:25] [INFO ] Deduced a trap composed of 63 places in 415 ms of which 1 ms to minimize.
[2023-03-13 16:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2023-03-13 16:17:25] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 0 ms to minimize.
[2023-03-13 16:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-13 16:17:26] [INFO ] After 3482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7976 ms.
[2023-03-13 16:17:34] [INFO ] After 11597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 20 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1381/1381 transitions.
Applied a total of 0 rules in 67 ms. Remains 595 /595 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 595/595 places, 1381/1381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1381/1381 transitions.
Applied a total of 0 rules in 35 ms. Remains 595 /595 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2023-03-13 16:17:34] [INFO ] Invariant cache hit.
[2023-03-13 16:17:34] [INFO ] Implicit Places using invariants in 424 ms returned [180, 185, 187, 267]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 426 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/595 places, 1381/1381 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 591 transition count 1377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 587 transition count 1377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 587 transition count 1376
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 586 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 585 transition count 1375
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 585 transition count 1375
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 581 transition count 1371
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 581 transition count 1370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 580 transition count 1370
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 580 transition count 1367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 577 transition count 1367
Applied a total of 28 rules in 117 ms. Remains 577 /591 variables (removed 14) and now considering 1367/1381 (removed 14) transitions.
// Phase 1: matrix 1367 rows 577 cols
[2023-03-13 16:17:34] [INFO ] Computed 60 place invariants in 27 ms
[2023-03-13 16:17:35] [INFO ] Implicit Places using invariants in 453 ms returned [91, 92, 160]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 455 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 574/595 places, 1367/1381 transitions.
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 2 place count 573 transition count 1366
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 573 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 572 transition count 1365
Applied a total of 4 rules in 57 ms. Remains 572 /574 variables (removed 2) and now considering 1365/1367 (removed 2) transitions.
// Phase 1: matrix 1365 rows 572 cols
[2023-03-13 16:17:35] [INFO ] Computed 57 place invariants in 15 ms
[2023-03-13 16:17:35] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-13 16:17:35] [INFO ] Invariant cache hit.
[2023-03-13 16:17:36] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 572/595 places, 1365/1381 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2638 ms. Remains : 572/595 places, 1365/1381 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 225704 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225704 steps, saw 147397 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 16:17:39] [INFO ] Invariant cache hit.
[2023-03-13 16:17:40] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:17:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 16:17:40] [INFO ] [Nat]Absence check using 16 positive and 41 generalized place invariants in 14 ms returned sat
[2023-03-13 16:17:40] [INFO ] After 717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:17:45] [INFO ] After 5106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9258 ms.
[2023-03-13 16:17:54] [INFO ] After 14490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 20 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1365/1365 transitions.
Applied a total of 0 rules in 24 ms. Remains 572 /572 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 572/572 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1365/1365 transitions.
Applied a total of 0 rules in 21 ms. Remains 572 /572 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2023-03-13 16:17:54] [INFO ] Invariant cache hit.
[2023-03-13 16:17:55] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-13 16:17:55] [INFO ] Invariant cache hit.
[2023-03-13 16:17:56] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
[2023-03-13 16:17:56] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-13 16:17:56] [INFO ] Invariant cache hit.
[2023-03-13 16:17:57] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2625 ms. Remains : 572/572 places, 1365/1365 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 572 transition count 1364
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 571 transition count 1364
Applied a total of 2 rules in 24 ms. Remains 571 /572 variables (removed 1) and now considering 1364/1365 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1364 rows 571 cols
[2023-03-13 16:17:57] [INFO ] Computed 57 place invariants in 26 ms
[2023-03-13 16:17:57] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:17:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-13 16:17:57] [INFO ] [Nat]Absence check using 17 positive and 40 generalized place invariants in 33 ms returned sat
[2023-03-13 16:18:16] [INFO ] After 18638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-13 16:18:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 14 ms.
[2023-03-13 16:18:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 572 places, 1365 transitions and 5498 arcs took 17 ms.
[2023-03-13 16:18:16] [INFO ] Flatten gal took : 139 ms
Total runtime 150799 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 06b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 572 places, 1365 transitions, 5498 arcs.
Final Score: 27559.103
Took : 66 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-06b-ReachabilityCardinality-03 (reachable & potential(( ( ( ( (tk(P303)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P303)) ) ) & ( ( (tk(P409)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P409)) ) ) ) & ( ( ( ( (tk(P326)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P326)) ) ) | ( ( (tk(P72)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P72)) ) ) ) & ( ( ( ( (tk(P193)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P193)) ) ) | ( ( ( (tk(P131)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P131)) ) ) | ( ( ( ( (tk(P147)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P147)) ) ) | ( ( (tk(P160)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P160)) ) ) ) & ( ( ( (tk(P165)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P165)) ) ) | ( ( (tk(P243)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P243)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P564)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P564)) ) ) & ( ( (tk(P525)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P525)) ) ) ) | ( ( ( (tk(P429)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P429)) ) ) & ( ( (tk(P403)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P403)) ) ) ) ) | ( ( ( ( (tk(P481)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P481)) ) ) & ( ( (tk(P436)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P436)) ) ) ) | ( ( ( (tk(P170)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P170)) ) ) & ( ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) & ( ( (tk(P471)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P471)) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-06b-ReachabilityCardinality-08 (reachable & potential(( ( (tk(P253)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P253)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 163556 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16250660 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
Caught signal 15, terminating.

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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ASLink-PT-06b, 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 r011-oct2-167813599700102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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