Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597400102.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400102
=====================================================================

--------------------
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 1678610525454

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:42:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 08:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:42:08] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-12 08:42:08] [INFO ] Transformed 2826 places.
[2023-03-12 08:42:08] [INFO ] Transformed 3513 transitions.
[2023-03-12 08:42:08] [INFO ] Found NUPN structural information;
[2023-03-12 08:42:08] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 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 16 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 15) seen :9
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-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-02 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 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :1
FORMULA ASLink-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) 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 5) 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 5) seen :1
FORMULA ASLink-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 3513 rows 2826 cols
[2023-03-12 08:42:09] [INFO ] Computed 277 place invariants in 156 ms
[2023-03-12 08:42:11] [INFO ] After 1154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 08:42:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 129 ms returned sat
[2023-03-12 08:42:12] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 376 ms returned sat
[2023-03-12 08:42:36] [INFO ] After 23508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:42:36] [INFO ] After 23527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-12 08:42:36] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 47 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 2826 transition count 2885
Reduce places removed 628 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 658 rules applied. Total rules applied 1286 place count 2198 transition count 2855
Reduce places removed 8 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 21 rules applied. Total rules applied 1307 place count 2190 transition count 2842
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1320 place count 2177 transition count 2842
Performed 629 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 629 Pre rules applied. Total rules applied 1320 place count 2177 transition count 2213
Deduced a syphon composed of 629 places in 5 ms
Ensure Unique test removed 55 places
Reduce places removed 684 places and 0 transitions.
Iterating global reduction 4 with 1313 rules applied. Total rules applied 2633 place count 1493 transition count 2213
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 4 with 48 rules applied. Total rules applied 2681 place count 1480 transition count 2178
Reduce places removed 35 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 39 rules applied. Total rules applied 2720 place count 1445 transition count 2174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2724 place count 1441 transition count 2174
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2724 place count 1441 transition count 2153
Deduced a syphon composed of 21 places in 11 ms
Ensure Unique test removed 19 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 61 rules applied. Total rules applied 2785 place count 1401 transition count 2153
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2785 place count 1401 transition count 2134
Deduced a syphon composed of 19 places in 10 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2823 place count 1382 transition count 2134
Discarding 87 places :
Symmetric choice reduction at 7 with 87 rule applications. Total rules 2910 place count 1295 transition count 2047
Iterating global reduction 7 with 87 rules applied. Total rules applied 2997 place count 1295 transition count 2047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2998 place count 1295 transition count 2046
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 29 Pre rules applied. Total rules applied 2998 place count 1295 transition count 2017
Deduced a syphon composed of 29 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 59 rules applied. Total rules applied 3057 place count 1265 transition count 2017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3057 place count 1265 transition count 2016
Deduced a syphon composed of 1 places in 4 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 3060 place count 1263 transition count 2016
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3067 place count 1256 transition count 1971
Iterating global reduction 8 with 7 rules applied. Total rules applied 3074 place count 1256 transition count 1971
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 3074 place count 1256 transition count 1967
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3082 place count 1252 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3083 place count 1251 transition count 1959
Iterating global reduction 8 with 1 rules applied. Total rules applied 3084 place count 1251 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3085 place count 1250 transition count 1951
Iterating global reduction 8 with 1 rules applied. Total rules applied 3086 place count 1250 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3087 place count 1249 transition count 1943
Iterating global reduction 8 with 1 rules applied. Total rules applied 3088 place count 1249 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3089 place count 1248 transition count 1935
Iterating global reduction 8 with 1 rules applied. Total rules applied 3090 place count 1248 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3091 place count 1247 transition count 1927
Iterating global reduction 8 with 1 rules applied. Total rules applied 3092 place count 1247 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3093 place count 1246 transition count 1919
Iterating global reduction 8 with 1 rules applied. Total rules applied 3094 place count 1246 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3095 place count 1245 transition count 1911
Iterating global reduction 8 with 1 rules applied. Total rules applied 3096 place count 1245 transition count 1911
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 8 with 333 rules applied. Total rules applied 3429 place count 1077 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3430 place count 1076 transition count 1745
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 3432 place count 1075 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3433 place count 1074 transition count 1744
Iterating global reduction 8 with 1 rules applied. Total rules applied 3434 place count 1074 transition count 1744
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 3436 place count 1074 transition count 1742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3437 place count 1073 transition count 1742
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3439 place count 1072 transition count 1751
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3447 place count 1072 transition count 1743
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3455 place count 1064 transition count 1743
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3463 place count 1064 transition count 1735
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3471 place count 1056 transition count 1735
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3472 place count 1056 transition count 1735
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3473 place count 1055 transition count 1734
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 9 rules applied. Total rules applied 3482 place count 1048 transition count 1732
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3484 place count 1046 transition count 1732
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 10 Pre rules applied. Total rules applied 3484 place count 1046 transition count 1722
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 21 rules applied. Total rules applied 3505 place count 1035 transition count 1722
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 14 with 5 rules applied. Total rules applied 3510 place count 1030 transition count 1722
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3510 place count 1030 transition count 1721
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3512 place count 1029 transition count 1721
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 3532 place count 1019 transition count 1711
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 3536 place count 1015 transition count 1707
Iterating global reduction 15 with 4 rules applied. Total rules applied 3540 place count 1015 transition count 1707
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 3543 place count 1015 transition count 1704
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 3546 place count 1012 transition count 1704
Applied a total of 3546 rules in 1763 ms. Remains 1012 /2826 variables (removed 1814) and now considering 1704/3513 (removed 1809) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1764 ms. Remains : 1012/2826 places, 1704/3513 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :1
FORMULA ASLink-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1704 rows 1012 cols
[2023-03-12 08:42:38] [INFO ] Computed 171 place invariants in 32 ms
[2023-03-12 08:42:38] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:42:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-12 08:42:38] [INFO ] [Nat]Absence check using 45 positive and 126 generalized place invariants in 39 ms returned sat
[2023-03-12 08:42:47] [INFO ] After 8170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:42:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 08:42:58] [INFO ] After 11087ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 08:42:59] [INFO ] After 11820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 358 ms.
[2023-03-12 08:42:59] [INFO ] After 20737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 66 ms.
Support contains 38 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 1704/1704 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 0 with 3 rules applied. Total rules applied 3 place count 1012 transition count 1701
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1008 transition count 1701
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 7 place count 1008 transition count 1693
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 23 place count 1000 transition count 1693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 25 place count 999 transition count 1692
Applied a total of 25 rules in 70 ms. Remains 999 /1012 variables (removed 13) and now considering 1692/1704 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 999/1012 places, 1692/1704 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 157953 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 157953 steps, saw 63231 distinct states, run finished after 3003 ms. (steps per millisecond=52 ) properties seen :2
FORMULA ASLink-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1692 rows 999 cols
[2023-03-12 08:43:02] [INFO ] Computed 170 place invariants in 41 ms
[2023-03-12 08:43:03] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:43:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-12 08:43:03] [INFO ] [Nat]Absence check using 45 positive and 125 generalized place invariants in 40 ms returned sat
[2023-03-12 08:43:04] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 08:43:04] [INFO ] After 174ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:05] [INFO ] Deduced a trap composed of 24 places in 548 ms of which 1 ms to minimize.
[2023-03-12 08:43:06] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2023-03-12 08:43:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1072 ms
[2023-03-12 08:43:06] [INFO ] After 1467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-12 08:43:06] [INFO ] After 3224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 18 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 1692/1692 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 999 transition count 1687
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 993 transition count 1687
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 993 transition count 1672
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 44 place count 975 transition count 1672
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 974 transition count 1672
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 57 place count 968 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 967 transition count 1658
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 967 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 966 transition count 1650
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 966 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 965 transition count 1642
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 965 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 964 transition count 1634
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 964 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 963 transition count 1626
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 963 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 962 transition count 1618
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 962 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 961 transition count 1610
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 961 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 960 transition count 1602
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 960 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 959 transition count 1594
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 959 transition count 1594
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 959 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 958 transition count 1593
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 957 transition count 1592
Applied a total of 78 rules in 428 ms. Remains 957 /999 variables (removed 42) and now considering 1592/1692 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 957/999 places, 1592/1692 transitions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259432 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259432 steps, saw 83355 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1592 rows 957 cols
[2023-03-12 08:43:09] [INFO ] Computed 165 place invariants in 28 ms
[2023-03-12 08:43:10] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:43:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 47 ms returned sat
[2023-03-12 08:43:10] [INFO ] [Nat]Absence check using 44 positive and 121 generalized place invariants in 28 ms returned sat
[2023-03-12 08:43:11] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 08:43:11] [INFO ] After 176ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:11] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-12 08:43:11] [INFO ] After 1438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 18 out of 957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 1592/1592 transitions.
Applied a total of 0 rules in 40 ms. Remains 957 /957 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 957/957 places, 1592/1592 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 1592/1592 transitions.
Applied a total of 0 rules in 24 ms. Remains 957 /957 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2023-03-12 08:43:11] [INFO ] Invariant cache hit.
[2023-03-12 08:43:12] [INFO ] Implicit Places using invariants in 1124 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 153, 170, 188, 282, 283, 285, 306, 324, 398, 402, 403, 414, 415, 417, 434, 453, 522, 526, 527, 538, 539, 541, 558, 576, 651, 652, 664, 665, 667, 684, 702, 779, 783, 784, 787, 798, 800, 801, 802, 820, 822, 826, 844, 845, 846, 847, 859, 865, 871, 877, 883, 889, 895, 903, 909, 915, 921]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 1145 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 890/957 places, 1592/1592 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 890 transition count 1479
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 118 rules applied. Total rules applied 231 place count 777 transition count 1474
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 234 place count 774 transition count 1474
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 234 place count 774 transition count 1444
Deduced a syphon composed of 30 places in 1 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 295 place count 743 transition count 1444
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 311 place count 737 transition count 1434
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 321 place count 727 transition count 1434
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 336 place count 712 transition count 1419
Iterating global reduction 5 with 15 rules applied. Total rules applied 351 place count 712 transition count 1419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 354 place count 712 transition count 1416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 354 place count 712 transition count 1415
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 356 place count 711 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 360 place count 707 transition count 1408
Iterating global reduction 6 with 4 rules applied. Total rules applied 364 place count 707 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 365 place count 706 transition count 1407
Iterating global reduction 6 with 1 rules applied. Total rules applied 366 place count 706 transition count 1407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 367 place count 706 transition count 1406
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 461 place count 659 transition count 1359
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 465 place count 655 transition count 1355
Iterating global reduction 7 with 4 rules applied. Total rules applied 469 place count 655 transition count 1355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 473 place count 655 transition count 1351
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 475 place count 654 transition count 1353
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 476 place count 654 transition count 1352
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 477 place count 654 transition count 1351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 478 place count 653 transition count 1351
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 495 place count 653 transition count 1334
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 513 place count 635 transition count 1334
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 515 place count 635 transition count 1332
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 534 place count 635 transition count 1332
Applied a total of 534 rules in 434 ms. Remains 635 /890 variables (removed 255) and now considering 1332/1592 (removed 260) transitions.
// Phase 1: matrix 1332 rows 635 cols
[2023-03-12 08:43:13] [INFO ] Computed 90 place invariants in 9 ms
[2023-03-12 08:43:13] [INFO ] Implicit Places using invariants in 567 ms returned [72, 89, 96, 99, 101, 162, 191, 196, 201, 202, 259, 281, 297, 302, 303, 356, 373, 379, 382, 384, 389, 390, 460, 467, 470, 472, 480, 481, 533, 550, 557, 560, 563]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 570 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 602/957 places, 1332/1592 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 602 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 601 transition count 1331
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 589 transition count 1319
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 589 transition count 1319
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 586 transition count 1316
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 586 transition count 1316
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 577 transition count 1307
Free-agglomeration rule applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 64 place count 577 transition count 1293
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 78 place count 563 transition count 1293
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 563 transition count 1289
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 86 place count 559 transition count 1289
Applied a total of 86 rules in 134 ms. Remains 559 /602 variables (removed 43) and now considering 1289/1332 (removed 43) transitions.
// Phase 1: matrix 1289 rows 559 cols
[2023-03-12 08:43:13] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-12 08:43:14] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-12 08:43:14] [INFO ] Invariant cache hit.
[2023-03-12 08:43:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:43:16] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2632 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 559/957 places, 1289/1592 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4939 ms. Remains : 559/957 places, 1289/1592 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 353312 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353312 steps, saw 146436 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:43:19] [INFO ] Invariant cache hit.
[2023-03-12 08:43:19] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:43:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 08:43:19] [INFO ] [Nat]Absence check using 14 positive and 43 generalized place invariants in 40 ms returned sat
[2023-03-12 08:43:20] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:43:20] [INFO ] After 191ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:21] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 1 ms to minimize.
[2023-03-12 08:43:21] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 22 ms to minimize.
[2023-03-12 08:43:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 717 ms
[2023-03-12 08:43:21] [INFO ] After 1183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-12 08:43:21] [INFO ] After 2005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 18 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1289/1289 transitions.
Applied a total of 0 rules in 27 ms. Remains 559 /559 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 559/559 places, 1289/1289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1289/1289 transitions.
Applied a total of 0 rules in 17 ms. Remains 559 /559 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2023-03-12 08:43:21] [INFO ] Invariant cache hit.
[2023-03-12 08:43:22] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-12 08:43:22] [INFO ] Invariant cache hit.
[2023-03-12 08:43:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:43:24] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2023-03-12 08:43:24] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-12 08:43:24] [INFO ] Invariant cache hit.
[2023-03-12 08:43:25] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3323 ms. Remains : 559/559 places, 1289/1289 transitions.
Graph (complete) has 3147 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 558 transition count 1285
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 554 transition count 1285
Applied a total of 9 rules in 38 ms. Remains 554 /559 variables (removed 5) and now considering 1285/1289 (removed 4) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1285 rows 554 cols
[2023-03-12 08:43:25] [INFO ] Computed 56 place invariants in 10 ms
[2023-03-12 08:43:25] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:43:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 54 ms returned sat
[2023-03-12 08:43:25] [INFO ] [Nat]Absence check using 11 positive and 45 generalized place invariants in 51 ms returned sat
[2023-03-12 08:43:26] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:26] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 08:43:26] [INFO ] After 1374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:43:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-12 08:43:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 559 places, 1289 transitions and 5185 arcs took 9 ms.
[2023-03-12 08:43:27] [INFO ] Flatten gal took : 202 ms
Total runtime 78628 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/567/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12717460 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096128 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-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 r009-oct2-167813597400102"
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 ;