MCC'2023- Execution of r007-oct2-167813595100155

About the Execution of LoLa+red for ASLink-PT-10a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1245.348	303652.00	361704.00	65.60	TFFFFFFFTFTF?FTF	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.r007-oct2-167813595100155.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 lolaxred
Input is ASLink-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595100155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 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.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 920K 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-10a-LTLCardinality-00
FORMULA_NAME ASLink-PT-10a-LTLCardinality-01
FORMULA_NAME ASLink-PT-10a-LTLCardinality-02
FORMULA_NAME ASLink-PT-10a-LTLCardinality-03
FORMULA_NAME ASLink-PT-10a-LTLCardinality-04
FORMULA_NAME ASLink-PT-10a-LTLCardinality-05
FORMULA_NAME ASLink-PT-10a-LTLCardinality-06
FORMULA_NAME ASLink-PT-10a-LTLCardinality-07
FORMULA_NAME ASLink-PT-10a-LTLCardinality-08
FORMULA_NAME ASLink-PT-10a-LTLCardinality-09
FORMULA_NAME ASLink-PT-10a-LTLCardinality-10
FORMULA_NAME ASLink-PT-10a-LTLCardinality-11
FORMULA_NAME ASLink-PT-10a-LTLCardinality-12
FORMULA_NAME ASLink-PT-10a-LTLCardinality-13
FORMULA_NAME ASLink-PT-10a-LTLCardinality-14
FORMULA_NAME ASLink-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678342944211

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 06:22:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 06:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:22:26] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-09 06:22:27] [INFO ] Transformed 2186 places.
[2023-03-09 06:22:27] [INFO ] Transformed 3192 transitions.
[2023-03-09 06:22:27] [INFO ] Found NUPN structural information;
[2023-03-09 06:22:27] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2126 transition count 3158
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 75 place count 2111 transition count 3085
Ensure Unique test removed 1 places
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 2110 transition count 3085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 2110 transition count 3083
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 2109 transition count 3075
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 2109 transition count 3075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 2108 transition count 3067
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 2108 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 2107 transition count 3059
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 2107 transition count 3059
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 2106 transition count 3051
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 2106 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 2105 transition count 3043
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 2105 transition count 3043
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 2104 transition count 3035
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 2104 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 2103 transition count 3027
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 2103 transition count 3027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 2102 transition count 3019
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 2102 transition count 3019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 2101 transition count 3011
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 2101 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 2100 transition count 3003
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 2100 transition count 3003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 2099 transition count 2995
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 2099 transition count 2995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 2098 transition count 2987
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 2098 transition count 2987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 2097 transition count 2979
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 2097 transition count 2979
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 2096 transition count 2971
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 2096 transition count 2971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 2095 transition count 2963
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 2095 transition count 2963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 2094 transition count 2955
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 2094 transition count 2955
Applied a total of 125 rules in 1853 ms. Remains 2094 /2186 variables (removed 92) and now considering 2955/3158 (removed 203) transitions.
// Phase 1: matrix 2955 rows 2094 cols
[2023-03-09 06:22:29] [INFO ] Computed 361 place invariants in 163 ms
[2023-03-09 06:22:31] [INFO ] Implicit Places using invariants in 2534 ms returned [1, 19, 23, 33, 51, 69, 198, 220, 221, 239, 257, 386, 408, 409, 427, 445, 574, 596, 597, 615, 633, 762, 784, 785, 803, 821, 950, 972, 973, 1009, 1138, 1160, 1161, 1179, 1197, 1326, 1348, 1349, 1367, 1385, 1514, 1536, 1537, 1555, 1573, 1702, 1718, 1724, 1725, 1743, 1761, 1895, 1913, 1934, 1937, 1955, 1957]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 2613 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2037/2186 places, 2955/3158 transitions.
Applied a total of 0 rules in 78 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4546 ms. Remains : 2037/2186 places, 2955/3158 transitions.
Support contains 33 out of 2037 places after structural reductions.
[2023-03-09 06:22:32] [INFO ] Flatten gal took : 222 ms
[2023-03-09 06:22:32] [INFO ] Flatten gal took : 147 ms
[2023-03-09 06:22:32] [INFO ] Input system was already deterministic with 2955 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:22:33] [INFO ] Computed 304 place invariants in 51 ms
[2023-03-09 06:22:34] [INFO ] [Real]Absence check using 67 positive place invariants in 55 ms returned sat
[2023-03-09 06:22:34] [INFO ] [Real]Absence check using 67 positive and 237 generalized place invariants in 99 ms returned sat
[2023-03-09 06:22:34] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 06:22:35] [INFO ] [Nat]Absence check using 67 positive place invariants in 39 ms returned sat
[2023-03-09 06:22:35] [INFO ] [Nat]Absence check using 67 positive and 237 generalized place invariants in 88 ms returned sat
[2023-03-09 06:22:59] [INFO ] After 23692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 06:22:59] [INFO ] After 23708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 06:22:59] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 337 ms.
Support contains 18 out of 2037 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 2037 transition count 2577
Reduce places removed 378 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 379 rules applied. Total rules applied 757 place count 1659 transition count 2576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 758 place count 1658 transition count 2576
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 758 place count 1658 transition count 2371
Deduced a syphon composed of 205 places in 4 ms
Ensure Unique test removed 80 places
Reduce places removed 285 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 1248 place count 1373 transition count 2371
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 1250 place count 1372 transition count 2370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1251 place count 1371 transition count 2370
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 7 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 5 with 232 rules applied. Total rules applied 1483 place count 1255 transition count 2254
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1484 place count 1255 transition count 2253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1485 place count 1254 transition count 2253
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 6 with 81 rules applied. Total rules applied 1566 place count 1254 transition count 2172
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 1647 place count 1173 transition count 2172
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1648 place count 1173 transition count 2171
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 1675 place count 1173 transition count 2171
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1676 place count 1173 transition count 2171
Applied a total of 1676 rules in 678 ms. Remains 1173 /2037 variables (removed 864) and now considering 2171/2955 (removed 784) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 1173/2037 places, 2171/2955 transitions.
Incomplete random walk after 10000 steps, including 119 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2171 rows 1173 cols
[2023-03-09 06:23:00] [INFO ] Computed 223 place invariants in 18 ms
[2023-03-09 06:23:01] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 06:23:01] [INFO ] [Nat]Absence check using 71 positive place invariants in 31 ms returned sat
[2023-03-09 06:23:01] [INFO ] [Nat]Absence check using 71 positive and 152 generalized place invariants in 60 ms returned sat
[2023-03-09 06:23:12] [INFO ] After 10511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 06:23:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 06:23:26] [INFO ] After 13888ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 06:23:26] [INFO ] After 13893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 06:23:26] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 710 ms.
Support contains 16 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 2171/2171 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 0 with 1 rules applied. Total rules applied 1 place count 1173 transition count 2170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1172 transition count 2170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1172 transition count 2169
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 1170 transition count 2169
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1170 transition count 2168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 1169 transition count 2168
Applied a total of 7 rules in 100 ms. Remains 1169 /1173 variables (removed 4) and now considering 2168/2171 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1169/1173 places, 2168/2171 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2168 rows 1169 cols
[2023-03-09 06:23:27] [INFO ] Computed 222 place invariants in 18 ms
[2023-03-09 06:23:27] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 06:23:28] [INFO ] [Nat]Absence check using 70 positive place invariants in 36 ms returned sat
[2023-03-09 06:23:28] [INFO ] [Nat]Absence check using 70 positive and 152 generalized place invariants in 96 ms returned sat
[2023-03-09 06:23:52] [INFO ] After 24490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:23:52] [INFO ] State equation strengthened by 59 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 06:23:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 06:23:52] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 10 out of 1169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1169/1169 places, 2168/2168 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 0 with 2 rules applied. Total rules applied 2 place count 1169 transition count 2166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1167 transition count 2166
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1167 transition count 2163
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 1162 transition count 2163
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 1159 transition count 2160
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 1159 transition count 2159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1158 transition count 2159
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 1158 transition count 2159
Applied a total of 21 rules in 210 ms. Remains 1158 /1169 variables (removed 11) and now considering 2159/2168 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 1158/1169 places, 2159/2168 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 202778 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202778 steps, saw 41129 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2159 rows 1158 cols
[2023-03-09 06:23:56] [INFO ] Computed 220 place invariants in 25 ms
[2023-03-09 06:23:56] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 06:23:57] [INFO ] [Nat]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-09 06:23:57] [INFO ] [Nat]Absence check using 67 positive and 153 generalized place invariants in 55 ms returned sat
[2023-03-09 06:24:15] [INFO ] After 18071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 06:24:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-09 06:24:21] [INFO ] After 6394ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 06:24:21] [INFO ] After 6409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 06:24:21] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 100 ms.
Support contains 10 out of 1158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1158/1158 places, 2159/2159 transitions.
Applied a total of 0 rules in 49 ms. Remains 1158 /1158 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1158/1158 places, 2159/2159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1158/1158 places, 2159/2159 transitions.
Applied a total of 0 rules in 40 ms. Remains 1158 /1158 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2023-03-09 06:24:22] [INFO ] Invariant cache hit.
[2023-03-09 06:24:23] [INFO ] Implicit Places using invariants in 1290 ms returned [18, 83, 91, 97, 100, 102, 109, 116, 117, 118, 119, 120, 182, 190, 196, 199, 201, 208, 215, 216, 217, 218, 219, 281, 289, 295, 298, 300, 307, 314, 315, 316, 317, 318, 380, 388, 394, 397, 399, 406, 413, 414, 415, 416, 417, 479, 487, 493, 496, 498, 505, 512, 513, 514, 515, 516, 534, 579, 591, 599, 605, 612, 619, 620, 621, 622, 623, 688, 696, 702, 705, 707, 714, 721, 722, 723, 724, 725, 787, 795, 801, 804, 806, 813, 820, 821, 822, 823, 824, 885, 893, 899, 902, 904, 907, 920, 921, 983, 992, 998, 1001, 1003, 1010, 1024, 1025, 1026, 1027, 1045, 1066, 1067, 1077, 1082, 1087, 1092, 1097, 1102, 1107, 1112, 1117, 1122, 1127]
Discarding 121 places :
Implicit Place search using SMT only with invariants took 1306 ms to find 121 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1037/1158 places, 2159/2159 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1037 transition count 2144
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1022 transition count 2144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 30 place count 1022 transition count 2109
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 101 place count 986 transition count 2109
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 21 rules applied. Total rules applied 122 place count 973 transition count 2101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 130 place count 965 transition count 2101
Discarding 72 places :
Symmetric choice reduction at 4 with 72 rule applications. Total rules 202 place count 893 transition count 2029
Iterating global reduction 4 with 72 rules applied. Total rules applied 274 place count 893 transition count 2029
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 287 place count 893 transition count 2016
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 287 place count 893 transition count 2015
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 289 place count 892 transition count 2015
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 303 place count 878 transition count 2001
Iterating global reduction 5 with 14 rules applied. Total rules applied 317 place count 878 transition count 2001
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 319 place count 876 transition count 1999
Iterating global reduction 5 with 2 rules applied. Total rules applied 321 place count 876 transition count 1999
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 322 place count 875 transition count 1998
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 875 transition count 1998
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 389 place count 842 transition count 1965
Free-agglomeration rule applied 39 times.
Iterating global reduction 5 with 39 rules applied. Total rules applied 428 place count 842 transition count 1926
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 476 place count 803 transition count 1917
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 477 place count 803 transition count 1916
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 479 place count 801 transition count 1916
Applied a total of 479 rules in 347 ms. Remains 801 /1037 variables (removed 236) and now considering 1916/2159 (removed 243) transitions.
// Phase 1: matrix 1916 rows 801 cols
[2023-03-09 06:24:23] [INFO ] Computed 84 place invariants in 39 ms
[2023-03-09 06:24:24] [INFO ] Implicit Places using invariants in 550 ms returned [72, 87, 143, 158, 214, 229, 285, 300, 356, 371, 427, 442, 498, 517, 573, 588, 644, 659, 721, 738]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 568 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 781/1158 places, 1916/2159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 780 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 780 transition count 1915
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 770 transition count 1905
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 32 place count 770 transition count 1895
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 760 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 760 transition count 1895
Applied a total of 43 rules in 158 ms. Remains 760 /781 variables (removed 21) and now considering 1895/1916 (removed 21) transitions.
// Phase 1: matrix 1895 rows 760 cols
[2023-03-09 06:24:24] [INFO ] Computed 64 place invariants in 15 ms
[2023-03-09 06:24:24] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-09 06:24:24] [INFO ] Invariant cache hit.
[2023-03-09 06:24:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 06:24:27] [INFO ] Implicit Places using invariants and state equation in 2937 ms returned []
Implicit Place search using SMT with State Equation took 3407 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 760/1158 places, 1895/2159 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5827 ms. Remains : 760/1158 places, 1895/2159 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 87 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:24:28] [INFO ] Computed 304 place invariants in 65 ms
[2023-03-09 06:24:29] [INFO ] Implicit Places using invariants in 1551 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1306, 1311, 1489, 1494, 1676, 1839, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1571 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2000/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1987 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1987 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1977 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1977 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1972 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1972 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1970 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1970 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1968 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1968 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1967 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1965 transition count 2920
Applied a total of 70 rules in 674 ms. Remains 1965 /2000 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2023-03-09 06:24:30] [INFO ] Computed 267 place invariants in 62 ms
[2023-03-09 06:24:31] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2023-03-09 06:24:31] [INFO ] Invariant cache hit.
[2023-03-09 06:24:36] [INFO ] Implicit Places using invariants and state equation in 4637 ms returned []
Implicit Place search using SMT with State Equation took 5916 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8248 ms. Remains : 1965/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s497 0) (NEQ s1140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 185 steps with 0 reset in 10 ms.
FORMULA ASLink-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-01 finished in 8702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 133 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:24:37] [INFO ] Computed 304 place invariants in 61 ms
[2023-03-09 06:24:38] [INFO ] Implicit Places using invariants in 1520 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1306, 1311, 1489, 1494, 1676, 1839, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1528 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2000/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1987 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1987 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1977 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1977 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1972 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1972 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1970 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1970 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1968 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1968 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1967 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1965 transition count 2920
Applied a total of 70 rules in 642 ms. Remains 1965 /2000 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2023-03-09 06:24:39] [INFO ] Computed 267 place invariants in 63 ms
[2023-03-09 06:24:40] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2023-03-09 06:24:40] [INFO ] Invariant cache hit.
[2023-03-09 06:24:44] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 5229 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7532 ms. Remains : 1965/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1241 0) (EQ s1747 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 399 steps with 1 reset in 11 ms.
FORMULA ASLink-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-03 finished in 7772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 3 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 102 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:24:44] [INFO ] Computed 304 place invariants in 56 ms
[2023-03-09 06:24:46] [INFO ] Implicit Places using invariants in 1480 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1311, 1489, 1494, 1676, 1839, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1483 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2001/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1988 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1988 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1978 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1978 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1973 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1973 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1971 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1971 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1969 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1969 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1968 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1968 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1967 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1967 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1966 transition count 2920
Applied a total of 70 rules in 577 ms. Remains 1966 /2001 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2023-03-09 06:24:46] [INFO ] Computed 268 place invariants in 54 ms
[2023-03-09 06:24:48] [INFO ] Implicit Places using invariants in 1371 ms returned []
[2023-03-09 06:24:48] [INFO ] Invariant cache hit.
[2023-03-09 06:24:52] [INFO ] Implicit Places using invariants and state equation in 4464 ms returned []
Implicit Place search using SMT with State Equation took 5844 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1966/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8007 ms. Remains : 1966/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1559 1), p1:(OR (EQ s1292 0) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 229 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-04 finished in 8246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2036 transition count 2567
Reduce places removed 407 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 417 rules applied. Total rules applied 804 place count 1629 transition count 2557
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 814 place count 1619 transition count 2557
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 814 place count 1619 transition count 2316
Deduced a syphon composed of 241 places in 2 ms
Ensure Unique test removed 83 places
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 3 with 565 rules applied. Total rules applied 1379 place count 1295 transition count 2316
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 45 rules applied. Total rules applied 1424 place count 1271 transition count 2295
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1445 place count 1250 transition count 2295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1445 place count 1250 transition count 2294
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1447 place count 1249 transition count 2294
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1459 place count 1237 transition count 2282
Iterating global reduction 5 with 12 rules applied. Total rules applied 1471 place count 1237 transition count 2282
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1481 place count 1237 transition count 2272
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1483 place count 1235 transition count 2270
Iterating global reduction 6 with 2 rules applied. Total rules applied 1485 place count 1235 transition count 2270
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1487 place count 1233 transition count 2268
Iterating global reduction 6 with 2 rules applied. Total rules applied 1489 place count 1233 transition count 2268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1491 place count 1233 transition count 2266
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 2 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 7 with 256 rules applied. Total rules applied 1747 place count 1105 transition count 2138
Applied a total of 1747 rules in 362 ms. Remains 1105 /2037 variables (removed 932) and now considering 2138/2955 (removed 817) transitions.
// Phase 1: matrix 2138 rows 1105 cols
[2023-03-09 06:24:53] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-09 06:24:54] [INFO ] Implicit Places using invariants in 802 ms returned [17, 75, 115, 167, 201, 210, 262, 296, 305, 357, 391, 400, 452, 486, 495, 513, 548, 589, 598, 650, 663, 687, 696, 748, 782, 791, 843, 877, 889, 941, 975, 976, 988, 989, 1007, 1028, 1039, 1044, 1049, 1054, 1059, 1064, 1069, 1074, 1079, 1084, 1089, 1095, 1101]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 818 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1056/2037 places, 2138/2955 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1056 transition count 2118
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 1036 transition count 2117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 1035 transition count 2117
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 42 place count 1035 transition count 2076
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 124 place count 994 transition count 2076
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 993 transition count 2074
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 991 transition count 2074
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 142 place count 978 transition count 2061
Iterating global reduction 5 with 13 rules applied. Total rules applied 155 place count 978 transition count 2061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 978 transition count 2060
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 156 place count 978 transition count 2059
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 158 place count 977 transition count 2059
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 161 place count 974 transition count 2056
Iterating global reduction 6 with 3 rules applied. Total rules applied 164 place count 974 transition count 2056
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 165 place count 973 transition count 2055
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 973 transition count 2055
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 972 transition count 2054
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 972 transition count 2054
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 220 place count 946 transition count 2028
Applied a total of 220 rules in 225 ms. Remains 946 /1056 variables (removed 110) and now considering 2028/2138 (removed 110) transitions.
// Phase 1: matrix 2028 rows 946 cols
[2023-03-09 06:24:54] [INFO ] Computed 127 place invariants in 35 ms
[2023-03-09 06:24:55] [INFO ] Implicit Places using invariants in 797 ms returned [87, 93, 98, 172, 178, 183, 259, 265, 270, 346, 352, 357, 433, 439, 444, 520, 526, 531, 609, 615, 620, 696, 702, 707, 783, 789, 794, 870, 876, 881]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 801 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 916/2037 places, 2028/2955 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 896 transition count 2008
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 896 transition count 2008
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 876 transition count 1988
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 876 transition count 1988
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 866 transition count 1978
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 866 transition count 1978
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 856 transition count 1968
Applied a total of 120 rules in 119 ms. Remains 856 /916 variables (removed 60) and now considering 1968/2028 (removed 60) transitions.
// Phase 1: matrix 1968 rows 856 cols
[2023-03-09 06:24:55] [INFO ] Computed 97 place invariants in 37 ms
[2023-03-09 06:24:55] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-09 06:24:55] [INFO ] Invariant cache hit.
[2023-03-09 06:24:57] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2513 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 856/2037 places, 1968/2955 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4838 ms. Remains : 856/2037 places, 1968/2955 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s547 0) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-10a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-07 finished in 4941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G((p1||X(p2)))))))'
Support contains 8 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 104 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:24:57] [INFO ] Computed 304 place invariants in 56 ms
[2023-03-09 06:24:59] [INFO ] Implicit Places using invariants in 1540 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1306, 1311, 1489, 1494, 1676, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1545 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2001/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1988 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1988 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1978 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1978 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1973 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1973 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1971 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1971 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1969 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1969 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1968 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1968 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1967 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1967 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1966 transition count 2920
Applied a total of 70 rules in 568 ms. Remains 1966 /2001 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2023-03-09 06:25:00] [INFO ] Computed 268 place invariants in 53 ms
[2023-03-09 06:25:01] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2023-03-09 06:25:01] [INFO ] Invariant cache hit.
[2023-03-09 06:25:05] [INFO ] Implicit Places using invariants and state equation in 4482 ms returned []
Implicit Place search using SMT with State Equation took 5693 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1966/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7910 ms. Remains : 1966/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s1745 0) (EQ s434 1)), p1:(AND (EQ s716 0) (EQ s709 1)), p2:(OR (EQ s1695 0) (EQ s1820 1) (EQ s1119 0) (EQ s594 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1470 ms.
Product exploration explored 100000 steps with 33333 reset in 1167 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1) p2)
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-08 finished in 11244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 4 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 90 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:25:09] [INFO ] Computed 304 place invariants in 55 ms
[2023-03-09 06:25:10] [INFO ] Implicit Places using invariants in 1411 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1306, 1311, 1489, 1494, 1676, 1839, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1430 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2000/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1987 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1987 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1977 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1977 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1972 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1972 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1970 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1970 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1968 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1968 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1967 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1965 transition count 2920
Applied a total of 70 rules in 611 ms. Remains 1965 /2000 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2023-03-09 06:25:11] [INFO ] Computed 267 place invariants in 53 ms
[2023-03-09 06:25:12] [INFO ] Implicit Places using invariants in 998 ms returned []
[2023-03-09 06:25:12] [INFO ] Invariant cache hit.
[2023-03-09 06:25:17] [INFO ] Implicit Places using invariants and state equation in 5474 ms returned []
Implicit Place search using SMT with State Equation took 6512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8643 ms. Remains : 1965/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1835 0) (EQ s1192 1)), p1:(AND (EQ s1295 0) (EQ s1773 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-09 finished in 8827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 2 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 73 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:25:17] [INFO ] Computed 304 place invariants in 45 ms
[2023-03-09 06:25:19] [INFO ] Implicit Places using invariants in 1476 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1306, 1311, 1489, 1494, 1676, 1839, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1479 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2000/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1987 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1987 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1977 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1977 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1972 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1972 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1970 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1970 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1968 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1968 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1967 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1965 transition count 2920
Applied a total of 70 rules in 675 ms. Remains 1965 /2000 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2023-03-09 06:25:20] [INFO ] Computed 267 place invariants in 39 ms
[2023-03-09 06:25:21] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-09 06:25:21] [INFO ] Invariant cache hit.
[2023-03-09 06:25:25] [INFO ] Implicit Places using invariants and state equation in 4260 ms returned []
Implicit Place search using SMT with State Equation took 5513 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7742 ms. Remains : 1965/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1647 0) (EQ s919 1)), p0:(OR (EQ s919 0) (EQ s1647 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-11 finished in 8019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
Support contains 4 out of 2037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 384 transitions
Trivial Post-agglo rules discarded 384 transitions
Performed 384 trivial Post agglomeration. Transition count delta: 384
Iterating post reduction 0 with 384 rules applied. Total rules applied 384 place count 2036 transition count 2570
Reduce places removed 404 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 414 rules applied. Total rules applied 798 place count 1632 transition count 2560
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 808 place count 1622 transition count 2560
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 808 place count 1622 transition count 2319
Deduced a syphon composed of 241 places in 6 ms
Ensure Unique test removed 83 places
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 3 with 565 rules applied. Total rules applied 1373 place count 1298 transition count 2319
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 45 rules applied. Total rules applied 1418 place count 1274 transition count 2298
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1439 place count 1253 transition count 2298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1439 place count 1253 transition count 2297
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1441 place count 1252 transition count 2297
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1453 place count 1240 transition count 2285
Iterating global reduction 5 with 12 rules applied. Total rules applied 1465 place count 1240 transition count 2285
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1475 place count 1240 transition count 2275
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1477 place count 1238 transition count 2273
Iterating global reduction 6 with 2 rules applied. Total rules applied 1479 place count 1238 transition count 2273
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1481 place count 1236 transition count 2271
Iterating global reduction 6 with 2 rules applied. Total rules applied 1483 place count 1236 transition count 2271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1485 place count 1236 transition count 2269
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 5 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 7 with 252 rules applied. Total rules applied 1737 place count 1110 transition count 2143
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1738 place count 1110 transition count 2143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1739 place count 1109 transition count 2142
Iterating global reduction 7 with 1 rules applied. Total rules applied 1740 place count 1109 transition count 2142
Applied a total of 1740 rules in 467 ms. Remains 1109 /2037 variables (removed 928) and now considering 2142/2955 (removed 813) transitions.
// Phase 1: matrix 2142 rows 1109 cols
[2023-03-09 06:25:26] [INFO ] Computed 177 place invariants in 49 ms
[2023-03-09 06:25:27] [INFO ] Implicit Places using invariants in 1303 ms returned [17, 75, 116, 168, 202, 211, 263, 297, 306, 358, 392, 401, 453, 487, 496, 514, 549, 590, 599, 651, 670, 687, 696, 748, 784, 793, 845, 879, 891, 943, 977, 978, 990, 991, 1009, 1030, 1041, 1048, 1053, 1058, 1063, 1068, 1073, 1078, 1083, 1088, 1093, 1099, 1105]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1317 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1060/2037 places, 2142/2955 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1060 transition count 2122
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1040 transition count 2122
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 40 place count 1040 transition count 2081
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 122 place count 999 transition count 2081
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 998 transition count 2079
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 996 transition count 2079
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 139 place count 984 transition count 2067
Iterating global reduction 4 with 12 rules applied. Total rules applied 151 place count 984 transition count 2067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 984 transition count 2066
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 981 transition count 2063
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 981 transition count 2063
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 980 transition count 2062
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 980 transition count 2062
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 979 transition count 2061
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 979 transition count 2061
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 214 place count 953 transition count 2035
Applied a total of 214 rules in 185 ms. Remains 953 /1060 variables (removed 107) and now considering 2035/2142 (removed 107) transitions.
// Phase 1: matrix 2035 rows 953 cols
[2023-03-09 06:25:27] [INFO ] Computed 127 place invariants in 64 ms
[2023-03-09 06:25:28] [INFO ] Implicit Places using invariants in 804 ms returned [87, 93, 98, 173, 179, 184, 260, 266, 271, 347, 353, 358, 434, 440, 445, 521, 527, 532, 616, 621, 697, 703, 710, 786, 792, 797, 873, 879, 884]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 818 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 924/2037 places, 2035/2955 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 924 transition count 2034
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 923 transition count 2034
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 905 transition count 2016
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 905 transition count 2016
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 887 transition count 1998
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 887 transition count 1998
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 878 transition count 1989
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 878 transition count 1989
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 112 place count 868 transition count 1979
Applied a total of 112 rules in 128 ms. Remains 868 /924 variables (removed 56) and now considering 1979/2035 (removed 56) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2023-03-09 06:25:28] [INFO ] Computed 98 place invariants in 37 ms
[2023-03-09 06:25:29] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-09 06:25:29] [INFO ] Invariant cache hit.
[2023-03-09 06:25:31] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2732 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 868/2037 places, 1979/2955 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5661 ms. Remains : 868/2037 places, 1979/2955 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (EQ s95 0) (EQ s556 1)) (NOT (OR (EQ s640 0) (EQ s855 1)))), p0:(OR (EQ s95 0) (EQ s556 1) (AND (NEQ s640 0) (NEQ s855 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1223 reset in 406 ms.
Product exploration explored 100000 steps with 1257 reset in 411 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 134 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 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228063 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 228063 steps, saw 157670 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:25:35] [INFO ] Invariant cache hit.
[2023-03-09 06:25:36] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:25:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 46 ms returned sat
[2023-03-09 06:25:36] [INFO ] [Nat]Absence check using 17 positive and 81 generalized place invariants in 28 ms returned sat
[2023-03-09 06:25:37] [INFO ] After 1389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:25:37] [INFO ] After 1546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-09 06:25:37] [INFO ] After 1847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 868 transition count 1940
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 88 place count 829 transition count 1930
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 118 place count 829 transition count 1900
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 148 place count 799 transition count 1900
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 799 transition count 1900
Applied a total of 151 rules in 117 ms. Remains 799 /868 variables (removed 69) and now considering 1900/1979 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 799/868 places, 1900/1979 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 5566 steps, including 7 resets, run visited all 1 properties in 9 ms. (steps per millisecond=618 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 30 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2023-03-09 06:25:38] [INFO ] Invariant cache hit.
[2023-03-09 06:25:39] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-09 06:25:39] [INFO ] Invariant cache hit.
[2023-03-09 06:25:41] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 2969 ms to find 0 implicit places.
[2023-03-09 06:25:41] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-09 06:25:41] [INFO ] Invariant cache hit.
[2023-03-09 06:25:42] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4047 ms. Remains : 868/868 places, 1979/1979 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 118 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 225313 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225313 steps, saw 155734 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 06:25:45] [INFO ] Invariant cache hit.
[2023-03-09 06:25:46] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:25:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-09 06:25:46] [INFO ] [Nat]Absence check using 17 positive and 81 generalized place invariants in 40 ms returned sat
[2023-03-09 06:25:46] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:25:47] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-09 06:25:47] [INFO ] After 1133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 868 transition count 1940
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 88 place count 829 transition count 1930
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 118 place count 829 transition count 1900
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 148 place count 799 transition count 1900
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 799 transition count 1900
Applied a total of 151 rules in 116 ms. Remains 799 /868 variables (removed 69) and now considering 1900/1979 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 799/868 places, 1900/1979 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 231842 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231842 steps, saw 127857 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1900 rows 799 cols
[2023-03-09 06:25:50] [INFO ] Computed 98 place invariants in 36 ms
[2023-03-09 06:25:50] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:25:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-09 06:25:50] [INFO ] [Nat]Absence check using 16 positive and 82 generalized place invariants in 30 ms returned sat
[2023-03-09 06:25:52] [INFO ] After 1614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:25:52] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 14 ms to minimize.
[2023-03-09 06:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-09 06:25:52] [INFO ] After 1996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-09 06:25:52] [INFO ] After 2341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 799/799 places, 1900/1900 transitions.
Applied a total of 0 rules in 37 ms. Remains 799 /799 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 799/799 places, 1900/1900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 799/799 places, 1900/1900 transitions.
Applied a total of 0 rules in 26 ms. Remains 799 /799 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2023-03-09 06:25:52] [INFO ] Invariant cache hit.
[2023-03-09 06:25:53] [INFO ] Implicit Places using invariants in 568 ms returned [88, 90, 160, 161, 231, 232, 302, 303, 373, 374, 444, 445, 522, 523, 596, 597, 667, 668]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 571 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 781/799 places, 1900/1900 transitions.
Applied a total of 0 rules in 26 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 624 ms. Remains : 781/799 places, 1900/1900 transitions.
Incomplete random walk after 10000 steps, including 155 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 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 256074 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256074 steps, saw 107193 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1900 rows 781 cols
[2023-03-09 06:25:56] [INFO ] Computed 80 place invariants in 36 ms
[2023-03-09 06:25:56] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:25:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-09 06:25:57] [INFO ] [Nat]Absence check using 15 positive and 65 generalized place invariants in 119 ms returned sat
[2023-03-09 06:25:57] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:25:57] [INFO ] After 667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-09 06:25:57] [INFO ] After 1069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1900/1900 transitions.
Applied a total of 0 rules in 29 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 781/781 places, 1900/1900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1900/1900 transitions.
Applied a total of 0 rules in 26 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2023-03-09 06:25:57] [INFO ] Invariant cache hit.
[2023-03-09 06:25:58] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-09 06:25:58] [INFO ] Invariant cache hit.
[2023-03-09 06:26:00] [INFO ] Implicit Places using invariants and state equation in 2244 ms returned []
Implicit Place search using SMT with State Equation took 2941 ms to find 0 implicit places.
[2023-03-09 06:26:00] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-09 06:26:00] [INFO ] Invariant cache hit.
[2023-03-09 06:26:01] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3919 ms. Remains : 781/781 places, 1900/1900 transitions.
Applied a total of 0 rules in 24 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 06:26:01] [INFO ] Invariant cache hit.
[2023-03-09 06:26:01] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 06:26:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-09 06:26:02] [INFO ] [Nat]Absence check using 15 positive and 65 generalized place invariants in 79 ms returned sat
[2023-03-09 06:26:03] [INFO ] After 1448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:26:03] [INFO ] After 1594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 06:26:03] [INFO ] After 1926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1203 reset in 349 ms.
Product exploration explored 100000 steps with 1181 reset in 349 ms.
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 26 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2023-03-09 06:26:05] [INFO ] Computed 98 place invariants in 36 ms
[2023-03-09 06:26:05] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-09 06:26:05] [INFO ] Invariant cache hit.
[2023-03-09 06:26:08] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 3111 ms to find 0 implicit places.
[2023-03-09 06:26:08] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-09 06:26:08] [INFO ] Invariant cache hit.
[2023-03-09 06:26:09] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4081 ms. Remains : 868/868 places, 1979/1979 transitions.
Treatment of property ASLink-PT-10a-LTLCardinality-12 finished in 43476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 2037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 2036 transition count 2568
Reduce places removed 405 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 414 rules applied. Total rules applied 800 place count 1631 transition count 2559
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 810 place count 1622 transition count 2558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 811 place count 1621 transition count 2558
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 239 Pre rules applied. Total rules applied 811 place count 1621 transition count 2319
Deduced a syphon composed of 239 places in 2 ms
Ensure Unique test removed 83 places
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 4 with 561 rules applied. Total rules applied 1372 place count 1299 transition count 2319
Discarding 23 places :
Implicit places reduction removed 23 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 42 rules applied. Total rules applied 1414 place count 1276 transition count 2300
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1433 place count 1257 transition count 2300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1433 place count 1257 transition count 2299
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1435 place count 1256 transition count 2299
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1446 place count 1245 transition count 2288
Iterating global reduction 6 with 11 rules applied. Total rules applied 1457 place count 1245 transition count 2288
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1466 place count 1245 transition count 2279
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1468 place count 1243 transition count 2277
Iterating global reduction 7 with 2 rules applied. Total rules applied 1470 place count 1243 transition count 2277
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1472 place count 1241 transition count 2275
Iterating global reduction 7 with 2 rules applied. Total rules applied 1474 place count 1241 transition count 2275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1476 place count 1241 transition count 2273
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 3 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 8 with 256 rules applied. Total rules applied 1732 place count 1113 transition count 2145
Applied a total of 1732 rules in 277 ms. Remains 1113 /2037 variables (removed 924) and now considering 2145/2955 (removed 810) transitions.
// Phase 1: matrix 2145 rows 1113 cols
[2023-03-09 06:26:09] [INFO ] Computed 179 place invariants in 38 ms
[2023-03-09 06:26:10] [INFO ] Implicit Places using invariants in 1266 ms returned [17, 75, 115, 167, 201, 210, 262, 282, 299, 308, 411, 463, 497, 506, 524, 559, 600, 609, 661, 695, 704, 756, 790, 799, 851, 885, 897, 949, 983, 984, 996, 997, 1015, 1036, 1047, 1052, 1057, 1062, 1067, 1072, 1077, 1082, 1087, 1092, 1097, 1103, 1109]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1268 ms to find 47 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1066/2037 places, 2145/2955 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1066 transition count 2125
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 1046 transition count 2124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 1045 transition count 2124
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 42 place count 1045 transition count 2083
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 124 place count 1004 transition count 2083
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 1003 transition count 2081
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 1001 transition count 2081
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 142 place count 988 transition count 2068
Iterating global reduction 5 with 13 rules applied. Total rules applied 155 place count 988 transition count 2068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 988 transition count 2067
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 156 place count 988 transition count 2066
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 987 transition count 2066
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 161 place count 984 transition count 2063
Iterating global reduction 6 with 3 rules applied. Total rules applied 164 place count 984 transition count 2063
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 165 place count 983 transition count 2062
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 983 transition count 2062
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 982 transition count 2061
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 982 transition count 2061
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 218 place count 957 transition count 2036
Applied a total of 218 rules in 258 ms. Remains 957 /1066 variables (removed 109) and now considering 2036/2145 (removed 109) transitions.
// Phase 1: matrix 2036 rows 957 cols
[2023-03-09 06:26:11] [INFO ] Computed 131 place invariants in 18 ms
[2023-03-09 06:26:12] [INFO ] Implicit Places using invariants in 1013 ms returned [87, 93, 98, 172, 178, 183, 267, 272, 351, 357, 362, 446, 452, 457, 533, 539, 544, 620, 626, 631, 707, 713, 718, 794, 800, 805, 881, 887, 892]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1033 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 928/2037 places, 2036/2955 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 909 transition count 2017
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 909 transition count 2017
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 890 transition count 1998
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 890 transition count 1998
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 881 transition count 1989
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 881 transition count 1989
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 114 place count 871 transition count 1979
Applied a total of 114 rules in 115 ms. Remains 871 /928 variables (removed 57) and now considering 1979/2036 (removed 57) transitions.
// Phase 1: matrix 1979 rows 871 cols
[2023-03-09 06:26:12] [INFO ] Computed 102 place invariants in 39 ms
[2023-03-09 06:26:12] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-09 06:26:12] [INFO ] Invariant cache hit.
[2023-03-09 06:26:15] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 871/2037 places, 1979/2955 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5835 ms. Remains : 871/2037 places, 1979/2955 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s357 0) (EQ s134 1)), p1:(AND (EQ s243 0) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 440 steps with 17 reset in 3 ms.
FORMULA ASLink-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-13 finished in 5955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2037/2037 places, 2955/2955 transitions.
Applied a total of 0 rules in 74 ms. Remains 2037 /2037 variables (removed 0) and now considering 2955/2955 (removed 0) transitions.
// Phase 1: matrix 2955 rows 2037 cols
[2023-03-09 06:26:15] [INFO ] Computed 304 place invariants in 21 ms
[2023-03-09 06:26:16] [INFO ] Implicit Places using invariants in 1331 ms returned [18, 207, 212, 390, 395, 573, 578, 757, 761, 939, 944, 962, 1123, 1128, 1306, 1311, 1489, 1494, 1676, 1839, 1855, 1860, 1861, 1879, 1900, 1901, 1918, 1926, 1934, 1940, 1946, 1952, 1958, 1966, 1972, 1978, 1986]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1343 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2000/2037 places, 2955/2955 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1987 transition count 2942
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1987 transition count 2942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1977 transition count 2932
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1977 transition count 2932
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1972 transition count 2927
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1972 transition count 2927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1970 transition count 2925
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1970 transition count 2925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1968 transition count 2923
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1968 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1967 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1965 transition count 2920
Applied a total of 70 rules in 572 ms. Remains 1965 /2000 variables (removed 35) and now considering 2920/2955 (removed 35) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2023-03-09 06:26:17] [INFO ] Computed 267 place invariants in 19 ms
[2023-03-09 06:26:18] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-09 06:26:18] [INFO ] Invariant cache hit.
[2023-03-09 06:26:22] [INFO ] Implicit Places using invariants and state equation in 4583 ms returned []
Implicit Place search using SMT with State Equation took 5691 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/2037 places, 2920/2955 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7680 ms. Remains : 1965/2037 places, 2920/2955 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1865 0) (EQ s1591 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1586 ms.
Product exploration explored 100000 steps with 50000 reset in 1547 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-14 finished in 11084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
[2023-03-09 06:26:26] [INFO ] Flatten gal took : 132 ms
[2023-03-09 06:26:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 06:26:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2037 places, 2955 transitions and 10453 arcs took 15 ms.
Total runtime 240118 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-10a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

BK_STOP 1678343247863

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ASLink-PT-10a-LTLCardinality-12
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 3/32 ASLink-PT-10a-LTLCardinality-12 244159 m, 48831 m/sec, 324046 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 6/32 ASLink-PT-10a-LTLCardinality-12 537779 m, 58724 m/sec, 725940 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 9/32 ASLink-PT-10a-LTLCardinality-12 832340 m, 58912 m/sec, 1121096 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 12/32 ASLink-PT-10a-LTLCardinality-12 1140052 m, 61542 m/sec, 1528821 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 15/32 ASLink-PT-10a-LTLCardinality-12 1422815 m, 56552 m/sec, 1927318 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 18/32 ASLink-PT-10a-LTLCardinality-12 1720200 m, 59477 m/sec, 2327624 t fired, .

Time elapsed: 30 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 20/32 ASLink-PT-10a-LTLCardinality-12 2023096 m, 60579 m/sec, 2734854 t fired, .

Time elapsed: 35 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 23/32 ASLink-PT-10a-LTLCardinality-12 2316152 m, 58611 m/sec, 3130663 t fired, .

Time elapsed: 40 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 26/32 ASLink-PT-10a-LTLCardinality-12 2574943 m, 51758 m/sec, 3459620 t fired, .

Time elapsed: 45 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 28/32 ASLink-PT-10a-LTLCardinality-12 2833475 m, 51706 m/sec, 3788031 t fired, .

Time elapsed: 50 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3599 31/32 ASLink-PT-10a-LTLCardinality-12 3103759 m, 54056 m/sec, 4145817 t fired, .

Time elapsed: 55 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for ASLink-PT-10a-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-10a-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-10a-LTLCardinality-12: LTL unknown AGGR

Time elapsed: 60 secs. Pages in use: 32

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-10a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ASLink-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595100155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;