Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 6.1K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 516K May 10 09:33 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-05a-LTLFireability-00
FORMULA_NAME ASLink-PT-05a-LTLFireability-01
FORMULA_NAME ASLink-PT-05a-LTLFireability-02
FORMULA_NAME ASLink-PT-05a-LTLFireability-03
FORMULA_NAME ASLink-PT-05a-LTLFireability-04
FORMULA_NAME ASLink-PT-05a-LTLFireability-05
FORMULA_NAME ASLink-PT-05a-LTLFireability-06
FORMULA_NAME ASLink-PT-05a-LTLFireability-07
FORMULA_NAME ASLink-PT-05a-LTLFireability-08
FORMULA_NAME ASLink-PT-05a-LTLFireability-09
FORMULA_NAME ASLink-PT-05a-LTLFireability-10
FORMULA_NAME ASLink-PT-05a-LTLFireability-11
FORMULA_NAME ASLink-PT-05a-LTLFireability-12
FORMULA_NAME ASLink-PT-05a-LTLFireability-13
FORMULA_NAME ASLink-PT-05a-LTLFireability-14
FORMULA_NAME ASLink-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652648285361

Running Version 202205111006
[2022-05-15 20:58:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:58:06] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2022-05-15 20:58:06] [INFO ] Transformed 1211 places.
[2022-05-15 20:58:06] [INFO ] Transformed 1827 transitions.
[2022-05-15 20:58:06] [INFO ] Found NUPN structural information;
[2022-05-15 20:58:06] [INFO ] Parsed PT model containing 1211 places and 1827 transitions in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1181 transition count 1808
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 1172 transition count 1771
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 1171 transition count 1771
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 1171 transition count 1769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1170 transition count 1761
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1170 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1753
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1168 transition count 1745
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1167 transition count 1737
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1167 transition count 1737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1166 transition count 1729
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1166 transition count 1729
Applied a total of 61 rules in 533 ms. Remains 1166 /1211 variables (removed 45) and now considering 1729/1808 (removed 79) transitions.
// Phase 1: matrix 1729 rows 1166 cols
[2022-05-15 20:58:07] [INFO ] Computed 201 place invariants in 124 ms
[2022-05-15 20:58:08] [INFO ] Implicit Places using invariants in 989 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 598, 616, 634, 763, 779, 785, 786, 804, 822, 951, 956, 968, 973, 974, 975, 1004, 1009, 1027, 1028, 1029, 1030, 1047, 1055, 1063, 1069, 1075, 1081, 1087, 1095, 1101, 1107]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 54 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1112/1211 places, 1729/1808 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1101 transition count 1718
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1101 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 1093 transition count 1710
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1093 transition count 1710
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 1088 transition count 1705
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 1088 transition count 1705
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1086 transition count 1703
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1086 transition count 1703
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1084 transition count 1701
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1084 transition count 1701
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1083 transition count 1700
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1083 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1082 transition count 1699
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1082 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1081 transition count 1698
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1081 transition count 1698
Applied a total of 62 rules in 206 ms. Remains 1081 /1112 variables (removed 31) and now considering 1698/1729 (removed 31) transitions.
// Phase 1: matrix 1698 rows 1081 cols
[2022-05-15 20:58:08] [INFO ] Computed 147 place invariants in 49 ms
[2022-05-15 20:58:09] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 1698 rows 1081 cols
[2022-05-15 20:58:09] [INFO ] Computed 147 place invariants in 15 ms
[2022-05-15 20:58:10] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1081/1211 places, 1698/1808 transitions.
Finished structural reductions, in 2 iterations. Remains : 1081/1211 places, 1698/1808 transitions.
Support contains 62 out of 1081 places after structural reductions.
[2022-05-15 20:58:11] [INFO ] Flatten gal took : 194 ms
[2022-05-15 20:58:11] [INFO ] Flatten gal took : 125 ms
[2022-05-15 20:58:11] [INFO ] Input system was already deterministic with 1698 transitions.
Support contains 60 out of 1081 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 36) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 1698 rows 1081 cols
[2022-05-15 20:58:12] [INFO ] Computed 147 place invariants in 14 ms
[2022-05-15 20:58:12] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2022-05-15 20:58:12] [INFO ] [Real]Absence check using 33 positive and 114 generalized place invariants in 26 ms returned sat
[2022-05-15 20:58:12] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-15 20:58:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-05-15 20:58:13] [INFO ] [Nat]Absence check using 33 positive and 114 generalized place invariants in 39 ms returned sat
[2022-05-15 20:58:38] [INFO ] After 24136ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :14
[2022-05-15 20:58:38] [INFO ] After 24140ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :14
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 20:58:38] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :14
Fused 23 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 31 out of 1081 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1081 transition count 1506
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 193 rules applied. Total rules applied 385 place count 889 transition count 1505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 888 transition count 1505
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 386 place count 888 transition count 1374
Deduced a syphon composed of 131 places in 17 ms
Ensure Unique test removed 42 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 690 place count 715 transition count 1374
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 707 place count 707 transition count 1365
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 716 place count 698 transition count 1365
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 716 place count 698 transition count 1354
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 738 place count 687 transition count 1354
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 744 place count 681 transition count 1341
Iterating global reduction 5 with 6 rules applied. Total rules applied 750 place count 681 transition count 1341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 754 place count 681 transition count 1337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 755 place count 680 transition count 1337
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 757 place count 678 transition count 1328
Iterating global reduction 7 with 2 rules applied. Total rules applied 759 place count 678 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 760 place count 677 transition count 1320
Iterating global reduction 7 with 1 rules applied. Total rules applied 761 place count 677 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 762 place count 676 transition count 1312
Iterating global reduction 7 with 1 rules applied. Total rules applied 763 place count 676 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 764 place count 675 transition count 1304
Iterating global reduction 7 with 1 rules applied. Total rules applied 765 place count 675 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 766 place count 674 transition count 1296
Iterating global reduction 7 with 1 rules applied. Total rules applied 767 place count 674 transition count 1296
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 885 place count 615 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 886 place count 614 transition count 1236
Iterating global reduction 7 with 1 rules applied. Total rules applied 887 place count 614 transition count 1236
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 891 place count 614 transition count 1232
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 895 place count 610 transition count 1232
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 914 place count 610 transition count 1213
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 934 place count 590 transition count 1213
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 937 place count 590 transition count 1210
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 952 place count 590 transition count 1210
Applied a total of 952 rules in 409 ms. Remains 590 /1081 variables (removed 491) and now considering 1210/1698 (removed 488) transitions.
Finished structural reductions, in 1 iterations. Remains : 590/1081 places, 1210/1698 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 153230 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{0=1, 10=1, 15=1}
Probabilistic random walk after 153230 steps, saw 40124 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :3
Running SMT prover for 13 properties.
// Phase 1: matrix 1210 rows 590 cols
[2022-05-15 20:58:42] [INFO ] Computed 96 place invariants in 9 ms
[2022-05-15 20:58:42] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 20:58:42] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-15 20:58:42] [INFO ] [Nat]Absence check using 25 positive and 71 generalized place invariants in 20 ms returned sat
[2022-05-15 20:58:43] [INFO ] After 1039ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :3
[2022-05-15 20:58:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 20:58:44] [INFO ] After 313ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :10 sat :3
[2022-05-15 20:58:44] [INFO ] After 771ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :3
Attempting to minimize the solution found.
Minimization took 250 ms.
[2022-05-15 20:58:44] [INFO ] After 2430ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :3
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 32 ms.
Support contains 2 out of 590 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 590/590 places, 1210/1210 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 590 transition count 1204
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 584 transition count 1204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 584 transition count 1200
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 23 place count 577 transition count 1200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 577 transition count 1199
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 576 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 575 transition count 1191
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 575 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 574 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 574 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 573 transition count 1175
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 573 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 572 transition count 1167
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 572 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 571 transition count 1159
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 571 transition count 1159
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 567 transition count 1155
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 567 transition count 1149
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 561 transition count 1149
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 561 transition count 1149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 560 transition count 1148
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 64 place count 554 transition count 1147
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 64 place count 554 transition count 1133
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 97 place count 535 transition count 1133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 102 place count 530 transition count 1128
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 530 transition count 1128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 112 place count 530 transition count 1123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 114 place count 529 transition count 1122
Applied a total of 114 rules in 339 ms. Remains 529 /590 variables (removed 61) and now considering 1122/1210 (removed 88) transitions.
Finished structural reductions, in 1 iterations. Remains : 529/590 places, 1122/1210 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 286622 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286622 steps, saw 79113 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1122 rows 529 cols
[2022-05-15 20:58:48] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-15 20:58:48] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:58:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2022-05-15 20:58:48] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 16 ms returned sat
[2022-05-15 20:58:49] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:58:49] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 134 ms.
[2022-05-15 20:58:49] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 529/529 places, 1122/1122 transitions.
Applied a total of 0 rules in 53 ms. Remains 529 /529 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 529/529 places, 1122/1122 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 529/529 places, 1122/1122 transitions.
Applied a total of 0 rules in 52 ms. Remains 529 /529 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
// Phase 1: matrix 1122 rows 529 cols
[2022-05-15 20:58:49] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-15 20:58:49] [INFO ] Implicit Places using invariants in 532 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 161, 182, 188, 191, 193, 194, 198, 203, 204, 256, 273, 279, 282, 284, 285, 290, 291, 343, 352, 360, 366, 369, 371, 372, 377, 378, 379, 431, 448, 454, 457, 459, 460, 489, 524, 526]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 542 ms to find 44 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 485/529 places, 1122/1122 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 485 transition count 1120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 483 transition count 1120
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 23 place count 464 transition count 1101
Iterating global reduction 2 with 19 rules applied. Total rules applied 42 place count 464 transition count 1101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 42 place count 464 transition count 1100
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 463 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 458 transition count 1095
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 458 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 74 place count 448 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 447 transition count 1083
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 447 transition count 1083
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 447 transition count 1067
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 108 place count 431 transition count 1067
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 431 transition count 1063
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 427 transition count 1063
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 427 transition count 1063
Applied a total of 117 rules in 111 ms. Remains 427 /485 variables (removed 58) and now considering 1063/1122 (removed 59) transitions.
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:50] [INFO ] Computed 38 place invariants in 9 ms
[2022-05-15 20:58:50] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:50] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-15 20:58:51] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 427/529 places, 1063/1122 transitions.
Finished structural reductions, in 2 iterations. Remains : 427/529 places, 1063/1122 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 276751 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276751 steps, saw 196431 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:54] [INFO ] Computed 38 place invariants in 9 ms
[2022-05-15 20:58:54] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:58:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-15 20:58:54] [INFO ] [Nat]Absence check using 10 positive and 28 generalized place invariants in 12 ms returned sat
[2022-05-15 20:58:54] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:58:54] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-15 20:58:55] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 427/427 places, 1063/1063 transitions.
Applied a total of 0 rules in 34 ms. Remains 427 /427 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 427/427 places, 1063/1063 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 427/427 places, 1063/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 427 /427 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:55] [INFO ] Computed 38 place invariants in 11 ms
[2022-05-15 20:58:55] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:55] [INFO ] Computed 38 place invariants in 10 ms
[2022-05-15 20:58:56] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2022-05-15 20:58:56] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:56] [INFO ] Computed 38 place invariants in 13 ms
[2022-05-15 20:58:56] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 427/427 places, 1063/1063 transitions.
Applied a total of 0 rules in 12 ms. Remains 427 /427 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1063 rows 427 cols
[2022-05-15 20:58:56] [INFO ] Computed 38 place invariants in 14 ms
[2022-05-15 20:58:56] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:58:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 20:58:57] [INFO ] [Nat]Absence check using 10 positive and 28 generalized place invariants in 11 ms returned sat
[2022-05-15 20:58:57] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:58:57] [INFO ] After 463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-15 20:58:57] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:58:57] [INFO ] Flatten gal took : 70 ms
[2022-05-15 20:58:57] [INFO ] Flatten gal took : 83 ms
[2022-05-15 20:58:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18278389598371491010.gal : 42 ms
[2022-05-15 20:58:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16217941730745958756.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12210999063043103745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18278389598371491010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16217941730745958756.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16217941730745958756.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2448 after 112608
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :112608 after 163872
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163872 after 168440
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :168440 after 169207
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :169207 after 3.40401e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.40401e+06 after 2.67822e+07
Reachability property AtomicPropp12 is true.
Reachability property AtomicPropp10 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.38884e+08,1.19063,38000,2,28056,17,87266,6,0,2774,64530,0
Total reachable state count : 238883905

Verifying 2 reachability properties.
Reachability property AtomicPropp10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,6,1.19602,38000,2,542,17,87266,7,0,2780,64530,0
Reachability property AtomicPropp12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp12,6,1.19732,38000,2,542,17,87266,7,0,2780,64530,0
Successfully simplified 16 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-05a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(F(p0))))))'
Support contains 1 out of 1081 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1080 transition count 1500
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 206 rules applied. Total rules applied 403 place count 878 transition count 1496
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 407 place count 874 transition count 1496
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 407 place count 874 transition count 1353
Deduced a syphon composed of 143 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 3 with 331 rules applied. Total rules applied 738 place count 686 transition count 1353
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 37 rules applied. Total rules applied 775 place count 672 transition count 1330
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 26 rules applied. Total rules applied 801 place count 648 transition count 1328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 803 place count 646 transition count 1328
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 803 place count 646 transition count 1311
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 837 place count 629 transition count 1311
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 849 place count 617 transition count 1287
Iterating global reduction 6 with 12 rules applied. Total rules applied 861 place count 617 transition count 1287
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
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 6 with 10 rules applied. Total rules applied 871 place count 616 transition count 1278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 872 place count 615 transition count 1278
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 874 place count 613 transition count 1269
Iterating global reduction 8 with 2 rules applied. Total rules applied 876 place count 613 transition count 1269
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 877 place count 612 transition count 1261
Iterating global reduction 8 with 1 rules applied. Total rules applied 878 place count 612 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 879 place count 611 transition count 1253
Iterating global reduction 8 with 1 rules applied. Total rules applied 880 place count 611 transition count 1253
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 881 place count 610 transition count 1245
Iterating global reduction 8 with 1 rules applied. Total rules applied 882 place count 610 transition count 1245
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 883 place count 609 transition count 1237
Iterating global reduction 8 with 1 rules applied. Total rules applied 884 place count 609 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 885 place count 608 transition count 1229
Iterating global reduction 8 with 1 rules applied. Total rules applied 886 place count 608 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 887 place count 607 transition count 1221
Iterating global reduction 8 with 1 rules applied. Total rules applied 888 place count 607 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 889 place count 606 transition count 1213
Iterating global reduction 8 with 1 rules applied. Total rules applied 890 place count 606 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 891 place count 605 transition count 1205
Iterating global reduction 8 with 1 rules applied. Total rules applied 892 place count 605 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 893 place count 604 transition count 1197
Iterating global reduction 8 with 1 rules applied. Total rules applied 894 place count 604 transition count 1197
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 1010 place count 546 transition count 1139
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1012 place count 544 transition count 1137
Iterating global reduction 8 with 2 rules applied. Total rules applied 1014 place count 544 transition count 1137
Applied a total of 1014 rules in 233 ms. Remains 544 /1081 variables (removed 537) and now considering 1137/1698 (removed 561) transitions.
// Phase 1: matrix 1137 rows 544 cols
[2022-05-15 20:58:59] [INFO ] Computed 81 place invariants in 8 ms
[2022-05-15 20:59:00] [INFO ] Implicit Places using invariants in 460 ms returned [72, 89, 95, 101, 109, 162, 183, 189, 194, 196, 256, 273, 279, 284, 286, 346, 380, 389, 441, 458, 464, 469, 471, 501, 536, 541]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 480 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 518/1081 places, 1137/1698 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 518 transition count 1130
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 511 transition count 1130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 511 transition count 1126
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 507 transition count 1126
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 498 transition count 1117
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 498 transition count 1117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 498 transition count 1116
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 497 transition count 1116
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 49 place count 490 transition count 1109
Iterating global reduction 2 with 7 rules applied. Total rules applied 56 place count 490 transition count 1109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 486 transition count 1105
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 486 transition count 1105
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 475 transition count 1094
Applied a total of 86 rules in 64 ms. Remains 475 /518 variables (removed 43) and now considering 1094/1137 (removed 43) transitions.
// Phase 1: matrix 1094 rows 475 cols
[2022-05-15 20:59:00] [INFO ] Computed 55 place invariants in 6 ms
[2022-05-15 20:59:00] [INFO ] Implicit Places using invariants in 322 ms returned [321, 327, 332]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 323 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 472/1081 places, 1094/1698 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 470 transition count 1092
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 470 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 468 transition count 1090
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 468 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 467 transition count 1089
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 467 transition count 1089
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 466 transition count 1088
Applied a total of 12 rules in 40 ms. Remains 466 /472 variables (removed 6) and now considering 1088/1094 (removed 6) transitions.
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:00] [INFO ] Computed 52 place invariants in 6 ms
[2022-05-15 20:59:00] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:00] [INFO ] Computed 52 place invariants in 9 ms
[2022-05-15 20:59:01] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 466/1081 places, 1088/1698 transitions.
Finished structural reductions, in 3 iterations. Remains : 466/1081 places, 1088/1698 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s89 0)], 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 1421 reset in 356 ms.
Product exploration explored 100000 steps with 1480 reset in 259 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 146 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468654 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468654 steps, saw 151969 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:05] [INFO ] Computed 52 place invariants in 17 ms
[2022-05-15 20:59:05] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:59:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 20:59:05] [INFO ] [Nat]Absence check using 10 positive and 42 generalized place invariants in 13 ms returned sat
[2022-05-15 20:59:06] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:59:06] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-15 20:59:06] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 466 transition count 1068
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 45 place count 446 transition count 1063
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 446 transition count 1049
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 73 place count 432 transition count 1049
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 432 transition count 1049
Applied a total of 74 rules in 110 ms. Remains 432 /466 variables (removed 34) and now considering 1049/1088 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/466 places, 1049/1088 transitions.
Finished random walk after 856 steps, including 17 resets, run visited all 1 properties in 4 ms. (steps per millisecond=214 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Applied a total of 0 rules in 14 ms. Remains 466 /466 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:06] [INFO ] Computed 52 place invariants in 19 ms
[2022-05-15 20:59:06] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:06] [INFO ] Computed 52 place invariants in 11 ms
[2022-05-15 20:59:07] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2022-05-15 20:59:07] [INFO ] Redundant transitions in 145 ms returned []
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:07] [INFO ] Computed 52 place invariants in 6 ms
[2022-05-15 20:59:08] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/466 places, 1088/1088 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 165 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 504335 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 504335 steps, saw 162855 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 20:59:11] [INFO ] Computed 52 place invariants in 16 ms
[2022-05-15 20:59:11] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:59:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 20:59:11] [INFO ] [Nat]Absence check using 10 positive and 42 generalized place invariants in 11 ms returned sat
[2022-05-15 20:59:11] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:59:11] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 20:59:11] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 466 transition count 1068
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 45 place count 446 transition count 1063
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 446 transition count 1049
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 73 place count 432 transition count 1049
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 432 transition count 1049
Applied a total of 74 rules in 65 ms. Remains 432 /466 variables (removed 34) and now considering 1049/1088 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/466 places, 1049/1088 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 505274 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505274 steps, saw 189663 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1049 rows 432 cols
[2022-05-15 20:59:14] [INFO ] Computed 52 place invariants in 17 ms
[2022-05-15 20:59:14] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:59:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 20:59:15] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-15 20:59:15] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:59:15] [INFO ] After 729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 20:59:15] [INFO ] After 857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 17 ms. Remains 432 /432 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1049/1049 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 16 ms. Remains 432 /432 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
// Phase 1: matrix 1049 rows 432 cols
[2022-05-15 20:59:15] [INFO ] Computed 52 place invariants in 14 ms
[2022-05-15 20:59:16] [INFO ] Implicit Places using invariants in 355 ms returned [90, 91, 161, 162, 232, 233, 303, 304]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 357 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 424/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 424/432 places, 1049/1049 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 547906 steps, run timeout after 3008 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 547906 steps, saw 201817 distinct states, run finished after 3008 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1049 rows 424 cols
[2022-05-15 20:59:19] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-15 20:59:19] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:59:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 20:59:19] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 16 ms returned sat
[2022-05-15 20:59:19] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:59:20] [INFO ] After 569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-15 20:59:20] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 23 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 424/424 places, 1049/1049 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 19 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
// Phase 1: matrix 1049 rows 424 cols
[2022-05-15 20:59:20] [INFO ] Computed 44 place invariants in 15 ms
[2022-05-15 20:59:20] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 1049 rows 424 cols
[2022-05-15 20:59:20] [INFO ] Computed 44 place invariants in 8 ms
[2022-05-15 20:59:21] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2022-05-15 20:59:21] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1049 rows 424 cols
[2022-05-15 20:59:21] [INFO ] Computed 44 place invariants in 16 ms
[2022-05-15 20:59:21] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1049 rows 424 cols
[2022-05-15 20:59:21] [INFO ] Computed 44 place invariants in 5 ms
[2022-05-15 20:59:21] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:59:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-15 20:59:21] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 9 ms returned sat
[2022-05-15 20:59:22] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:59:22] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 20:59:22] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:59:22] [INFO ] Flatten gal took : 50 ms
[2022-05-15 20:59:22] [INFO ] Flatten gal took : 41 ms
[2022-05-15 20:59:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16512693447865996189.gal : 18 ms
[2022-05-15 20:59:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15833135662832412529.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12950738892219062193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16512693447865996189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15833135662832412529.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15833135662832412529.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2448 after 97920
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :97920 after 149184
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :149184 after 153774
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :153774 after 154433
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :154433 after 3.15226e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.15226e+06 after 2.37597e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.37597e+07 after 2.29185e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.29185e+08 after 4.00745e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.00745e+09 after 4.42037e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.42037e+10 after 3.62875e+11
Detected timeout of ITS tools.
[2022-05-15 20:59:37] [INFO ] Flatten gal took : 82 ms
[2022-05-15 20:59:37] [INFO ] Applying decomposition
[2022-05-15 20:59:37] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15745324362916003227.txt' '-o' '/tmp/graph15745324362916003227.bin' '-w' '/tmp/graph15745324362916003227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15745324362916003227.bin' '-l' '-1' '-v' '-w' '/tmp/graph15745324362916003227.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:59:37] [INFO ] Decomposing Gal with order
[2022-05-15 20:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:59:38] [INFO ] Removed a total of 2172 redundant transitions.
[2022-05-15 20:59:38] [INFO ] Flatten gal took : 191 ms
[2022-05-15 20:59:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 25 ms.
[2022-05-15 20:59:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11497432869375594891.gal : 8 ms
[2022-05-15 20:59:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11228772527900918317.prop : 14 ms
Invoking ITS tools like this :cd /tmp/redAtoms12950738892219062193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11497432869375594891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11228772527900918317.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality11228772527900918317.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :24 after 176
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :176 after 28864
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28864 after 1.22475e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.22475e+06 after 2.6627e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.6627e+06 after 3.32887e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.32887e+06 after 1.4327e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.4327e+07 after 2.35904e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.48467e+09 after 7.48981e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15199197406667539518
[2022-05-15 20:59:53] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15199197406667539518
Running compilation step : cd /tmp/ltsmin15199197406667539518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2120 ms.
Running link step : cd /tmp/ltsmin15199197406667539518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin15199197406667539518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1458 reset in 260 ms.
Product exploration explored 100000 steps with 1454 reset in 236 ms.
Built C files in :
/tmp/ltsmin5541093142863426638
[2022-05-15 21:00:09] [INFO ] Computing symmetric may disable matrix : 1088 transitions.
[2022-05-15 21:00:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:00:09] [INFO ] Computing symmetric may enable matrix : 1088 transitions.
[2022-05-15 21:00:09] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:00:09] [INFO ] Computing Do-Not-Accords matrix : 1088 transitions.
[2022-05-15 21:00:09] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:00:09] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5541093142863426638
Running compilation step : cd /tmp/ltsmin5541093142863426638;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2878 ms.
Running link step : cd /tmp/ltsmin5541093142863426638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5541093142863426638;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14985919454061545881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Applied a total of 0 rules in 14 ms. Remains 466 /466 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 21:00:24] [INFO ] Computed 52 place invariants in 10 ms
[2022-05-15 21:00:24] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 21:00:24] [INFO ] Computed 52 place invariants in 6 ms
[2022-05-15 21:00:26] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
[2022-05-15 21:00:26] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1088 rows 466 cols
[2022-05-15 21:00:26] [INFO ] Computed 52 place invariants in 8 ms
[2022-05-15 21:00:26] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/466 places, 1088/1088 transitions.
Built C files in :
/tmp/ltsmin7656618064406348198
[2022-05-15 21:00:26] [INFO ] Computing symmetric may disable matrix : 1088 transitions.
[2022-05-15 21:00:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:00:26] [INFO ] Computing symmetric may enable matrix : 1088 transitions.
[2022-05-15 21:00:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:00:26] [INFO ] Computing Do-Not-Accords matrix : 1088 transitions.
[2022-05-15 21:00:26] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:00:26] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7656618064406348198
Running compilation step : cd /tmp/ltsmin7656618064406348198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2909 ms.
Running link step : cd /tmp/ltsmin7656618064406348198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin7656618064406348198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2949016333254327736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 21:00:41] [INFO ] Flatten gal took : 37 ms
[2022-05-15 21:00:41] [INFO ] Flatten gal took : 72 ms
[2022-05-15 21:00:41] [INFO ] Time to serialize gal into /tmp/LTL8064133240320094095.gal : 17 ms
[2022-05-15 21:00:41] [INFO ] Time to serialize properties into /tmp/LTL11711850871417142861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8064133240320094095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11711850871417142861.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8064133...267
Read 1 LTL properties
Checking formula 0 : !((F(G(G(F(F("(p172==0)")))))))
Formula 0 simplified : !FGF"(p172==0)"
Detected timeout of ITS tools.
[2022-05-15 21:00:56] [INFO ] Flatten gal took : 67 ms
[2022-05-15 21:00:56] [INFO ] Applying decomposition
[2022-05-15 21:00:56] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5671782413592646828.txt' '-o' '/tmp/graph5671782413592646828.bin' '-w' '/tmp/graph5671782413592646828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5671782413592646828.bin' '-l' '-1' '-v' '-w' '/tmp/graph5671782413592646828.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:00:57] [INFO ] Decomposing Gal with order
[2022-05-15 21:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:00:57] [INFO ] Removed a total of 2180 redundant transitions.
[2022-05-15 21:00:57] [INFO ] Flatten gal took : 129 ms
[2022-05-15 21:00:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 24 ms.
[2022-05-15 21:00:57] [INFO ] Time to serialize gal into /tmp/LTL9614296710466299634.gal : 8 ms
[2022-05-15 21:00:57] [INFO ] Time to serialize properties into /tmp/LTL9960799307949148739.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9614296710466299634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9960799307949148739.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9614296...245
Read 1 LTL properties
Checking formula 0 : !((F(G(G(F(F("(i3.u25.p172==0)")))))))
Formula 0 simplified : !FGF"(i3.u25.p172==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4361490018183971572
[2022-05-15 21:01:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4361490018183971572
Running compilation step : cd /tmp/ltsmin4361490018183971572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1728 ms.
Running link step : cd /tmp/ltsmin4361490018183971572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4361490018183971572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]([](<>(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-05a-LTLFireability-02 finished in 148118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(((F(p1)||p0)&&p2)))&&F(p3)))'
Support contains 5 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1079 transition count 1689
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1079 transition count 1689
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1077 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1077 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1076 transition count 1672
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1076 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1075 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1075 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1074 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1074 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1073 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1073 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1072 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1072 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1071 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1071 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1070 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1070 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1069 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1069 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1068 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1068 transition count 1608
Applied a total of 26 rules in 371 ms. Remains 1068 /1081 variables (removed 13) and now considering 1608/1698 (removed 90) transitions.
// Phase 1: matrix 1608 rows 1068 cols
[2022-05-15 21:01:27] [INFO ] Computed 147 place invariants in 23 ms
[2022-05-15 21:01:28] [INFO ] Implicit Places using invariants in 579 ms returned [574, 756, 956, 1017]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 582 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1064/1081 places, 1608/1698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1063 transition count 1607
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1063 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1062 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1062 transition count 1606
Applied a total of 4 rules in 90 ms. Remains 1062 /1064 variables (removed 2) and now considering 1606/1608 (removed 2) transitions.
// Phase 1: matrix 1606 rows 1062 cols
[2022-05-15 21:01:28] [INFO ] Computed 143 place invariants in 25 ms
[2022-05-15 21:01:28] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 1606 rows 1062 cols
[2022-05-15 21:01:29] [INFO ] Computed 143 place invariants in 13 ms
[2022-05-15 21:01:30] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1062/1081 places, 1606/1698 transitions.
Finished structural reductions, in 2 iterations. Remains : 1062/1081 places, 1606/1698 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p3), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s673 1), p2:(OR (EQ s211 0) (EQ s278 0)), p0:(OR (EQ s211 0) (EQ s278 0)), p1:(AND (EQ s926 1) (EQ s969 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-05 finished in 3314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((F(G(!p0)) U F(G(p0)))||(G(p2)&&p1)))))'
Support contains 3 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1078 transition count 1683
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1078 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1076 transition count 1674
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1076 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1075 transition count 1666
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1075 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1074 transition count 1658
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1074 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1073 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1073 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1072 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1072 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1071 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1071 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1070 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1070 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1069 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1069 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1068 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1068 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1067 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1067 transition count 1602
Applied a total of 28 rules in 296 ms. Remains 1067 /1081 variables (removed 14) and now considering 1602/1698 (removed 96) transitions.
// Phase 1: matrix 1602 rows 1067 cols
[2022-05-15 21:01:31] [INFO ] Computed 147 place invariants in 9 ms
[2022-05-15 21:01:31] [INFO ] Implicit Places using invariants in 462 ms returned [210, 573, 755, 955, 1016]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 463 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1062/1081 places, 1602/1698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1061 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1061 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1060 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1060 transition count 1600
Applied a total of 4 rules in 57 ms. Remains 1060 /1062 variables (removed 2) and now considering 1600/1602 (removed 2) transitions.
// Phase 1: matrix 1600 rows 1060 cols
[2022-05-15 21:01:31] [INFO ] Computed 142 place invariants in 9 ms
[2022-05-15 21:01:32] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 1600 rows 1060 cols
[2022-05-15 21:01:32] [INFO ] Computed 142 place invariants in 9 ms
[2022-05-15 21:01:33] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1060/1081 places, 1600/1698 transitions.
Finished structural reductions, in 2 iterations. Remains : 1060/1081 places, 1600/1698 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s707 1) (EQ s745 1)), p1:(AND (EQ s707 1) (EQ s745 1)), p2:(EQ s265 1)], nbAcceptance=2, 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 101 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-08 finished in 3291 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((!(p0 U p1)||X(p2))) U (F(p2)&&p3)))'
Support contains 5 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1078 transition count 1683
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1078 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1076 transition count 1674
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1076 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1075 transition count 1666
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1075 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1074 transition count 1658
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1074 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1073 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1073 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1072 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1072 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1071 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1071 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1070 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1070 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1069 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1069 transition count 1618
Applied a total of 24 rules in 209 ms. Remains 1069 /1081 variables (removed 12) and now considering 1618/1698 (removed 80) transitions.
// Phase 1: matrix 1618 rows 1069 cols
[2022-05-15 21:01:34] [INFO ] Computed 147 place invariants in 19 ms
[2022-05-15 21:01:34] [INFO ] Implicit Places using invariants in 574 ms returned [210, 755, 957, 1018]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 576 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1065/1081 places, 1618/1698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1064 transition count 1617
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1064 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1063 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1063 transition count 1616
Applied a total of 4 rules in 55 ms. Remains 1063 /1065 variables (removed 2) and now considering 1616/1618 (removed 2) transitions.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:01:34] [INFO ] Computed 143 place invariants in 10 ms
[2022-05-15 21:01:35] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:01:35] [INFO ] Computed 143 place invariants in 13 ms
[2022-05-15 21:01:36] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1063/1081 places, 1616/1698 transitions.
Finished structural reductions, in 2 iterations. Remains : 1063/1081 places, 1616/1698 transitions.
Stuttering acceptance computed with spot in 359 ms :[(AND p2 p3), true, p2, (AND p2 p3), (AND p2 p3), (AND (NOT p1) p2 p3), (OR (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=4 dest: 6}, { cond=(OR (AND p1 p3 p2) (AND p0 p3 p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(OR p1 p0), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(OR p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=8 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(AND (EQ s769 1) (EQ s952 1)), p2:(AND (EQ s547 1) (EQ s572 1)), p1:(EQ s868 1), p0:(AND (EQ s769 1) (EQ s952 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 726 reset in 467 ms.
Product exploration explored 100000 steps with 776 reset in 348 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 (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2))))), (X (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2384 ms. Reduced automaton from 11 states, 45 edges and 4 AP to 9 states, 38 edges and 4 AP.
Stuttering acceptance computed with spot in 445 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND (NOT p1) p2 p3), (OR (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 20) seen :9
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:01:42] [INFO ] Computed 143 place invariants in 8 ms
[2022-05-15 21:01:42] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-15 21:01:42] [INFO ] [Real]Absence check using 33 positive and 110 generalized place invariants in 28 ms returned sat
[2022-05-15 21:01:42] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2022-05-15 21:01:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-15 21:01:43] [INFO ] [Nat]Absence check using 33 positive and 110 generalized place invariants in 27 ms returned sat
[2022-05-15 21:01:45] [INFO ] After 2657ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-05-15 21:01:49] [INFO ] After 6686ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 5285 ms.
[2022-05-15 21:01:55] [INFO ] After 12258ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 345 ms.
Support contains 5 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1063/1063 places, 1616/1616 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 203 place count 1063 transition count 1413
Reduce places removed 203 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 204 rules applied. Total rules applied 407 place count 860 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 408 place count 859 transition count 1412
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 408 place count 859 transition count 1276
Deduced a syphon composed of 136 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 317 rules applied. Total rules applied 725 place count 678 transition count 1276
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 743 place count 669 transition count 1267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 752 place count 660 transition count 1267
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 752 place count 660 transition count 1251
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 784 place count 644 transition count 1251
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 789 place count 639 transition count 1246
Iterating global reduction 5 with 5 rules applied. Total rules applied 794 place count 639 transition count 1246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 798 place count 639 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 799 place count 638 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 799 place count 638 transition count 1241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 801 place count 637 transition count 1241
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 921 place count 577 transition count 1181
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 926 place count 577 transition count 1176
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 931 place count 572 transition count 1176
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 951 place count 572 transition count 1156
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 972 place count 551 transition count 1156
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 976 place count 551 transition count 1152
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 992 place count 551 transition count 1152
Applied a total of 992 rules in 164 ms. Remains 551 /1063 variables (removed 512) and now considering 1152/1616 (removed 464) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/1063 places, 1152/1616 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 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 26 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 344836 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{1=1, 4=1}
Probabilistic random walk after 344836 steps, saw 80562 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :2
Running SMT prover for 5 properties.
// Phase 1: matrix 1152 rows 551 cols
[2022-05-15 21:01:59] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-15 21:01:59] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-15 21:01:59] [INFO ] [Real]Absence check using 23 positive and 65 generalized place invariants in 12 ms returned sat
[2022-05-15 21:02:00] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:02:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2022-05-15 21:02:00] [INFO ] [Nat]Absence check using 23 positive and 65 generalized place invariants in 21 ms returned sat
[2022-05-15 21:02:03] [INFO ] After 3124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:02:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 21:02:04] [INFO ] After 850ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:02:06] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 1 ms to minimize.
[2022-05-15 21:02:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2022-05-15 21:02:06] [INFO ] After 2540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1911 ms.
[2022-05-15 21:02:08] [INFO ] After 7789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1152/1152 transitions.
Applied a total of 0 rules in 13 ms. Remains 551 /551 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 1152/1152 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 338093 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338093 steps, saw 79003 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1152 rows 551 cols
[2022-05-15 21:02:11] [INFO ] Computed 88 place invariants in 7 ms
[2022-05-15 21:02:11] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-15 21:02:11] [INFO ] [Real]Absence check using 23 positive and 65 generalized place invariants in 13 ms returned sat
[2022-05-15 21:02:12] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:02:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2022-05-15 21:02:12] [INFO ] [Nat]Absence check using 23 positive and 65 generalized place invariants in 17 ms returned sat
[2022-05-15 21:02:15] [INFO ] After 3086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:02:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 21:02:16] [INFO ] After 1156ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:02:18] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 1 ms to minimize.
[2022-05-15 21:02:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2022-05-15 21:02:18] [INFO ] After 3151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1986 ms.
[2022-05-15 21:02:20] [INFO ] After 8424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 176 ms.
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1152/1152 transitions.
Applied a total of 0 rules in 17 ms. Remains 551 /551 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 1152/1152 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1152/1152 transitions.
Applied a total of 0 rules in 15 ms. Remains 551 /551 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
// Phase 1: matrix 1152 rows 551 cols
[2022-05-15 21:02:20] [INFO ] Computed 88 place invariants in 7 ms
[2022-05-15 21:02:21] [INFO ] Implicit Places using invariants in 399 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 288, 297, 304, 305, 306, 376, 382, 385, 387, 390, 397, 398, 399, 468, 475, 478, 480, 483, 496]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 401 ms to find 35 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 516/551 places, 1152/1152 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 516 transition count 1151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 515 transition count 1151
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 515 transition count 1141
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 505 transition count 1141
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 38 place count 489 transition count 1125
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 489 transition count 1125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 59 place count 489 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 485 transition count 1116
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 485 transition count 1116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 75 place count 481 transition count 1112
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 87 place count 481 transition count 1100
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 99 place count 469 transition count 1100
Applied a total of 99 rules in 71 ms. Remains 469 /516 variables (removed 47) and now considering 1100/1152 (removed 52) transitions.
// Phase 1: matrix 1100 rows 469 cols
[2022-05-15 21:02:21] [INFO ] Computed 53 place invariants in 7 ms
[2022-05-15 21:02:21] [INFO ] Implicit Places using invariants in 538 ms returned [72, 89, 145, 162, 218, 256, 313, 330, 386, 404]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 541 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 459/551 places, 1100/1152 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 458 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 1099
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 453 transition count 1094
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 453 transition count 1089
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 22 place count 448 transition count 1089
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 448 transition count 1089
Applied a total of 23 rules in 53 ms. Remains 448 /459 variables (removed 11) and now considering 1089/1100 (removed 11) transitions.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:21] [INFO ] Computed 43 place invariants in 9 ms
[2022-05-15 21:02:22] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:22] [INFO ] Computed 43 place invariants in 16 ms
[2022-05-15 21:02:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:02:23] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 448/551 places, 1089/1152 transitions.
Finished structural reductions, in 3 iterations. Remains : 448/551 places, 1089/1152 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 250870 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{1=1, 4=1}
Probabilistic random walk after 250870 steps, saw 93558 distinct states, run finished after 3003 ms. (steps per millisecond=83 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:26] [INFO ] Computed 43 place invariants in 7 ms
[2022-05-15 21:02:26] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:02:26] [INFO ] [Real]Absence check using 11 positive and 32 generalized place invariants in 11 ms returned sat
[2022-05-15 21:02:26] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:02:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:02:27] [INFO ] [Nat]Absence check using 11 positive and 32 generalized place invariants in 11 ms returned sat
[2022-05-15 21:02:28] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:02:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:02:29] [INFO ] After 1564ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 21:02:40] [INFO ] After 11729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 733 ms.
[2022-05-15 21:02:40] [INFO ] After 13885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 91 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1089/1089 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 269601 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269601 steps, saw 97894 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:44] [INFO ] Computed 43 place invariants in 17 ms
[2022-05-15 21:02:44] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-15 21:02:44] [INFO ] [Real]Absence check using 11 positive and 32 generalized place invariants in 19 ms returned sat
[2022-05-15 21:02:44] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:02:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-15 21:02:44] [INFO ] [Nat]Absence check using 11 positive and 32 generalized place invariants in 15 ms returned sat
[2022-05-15 21:02:45] [INFO ] After 1222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:02:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:02:47] [INFO ] After 1313ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 21:02:56] [INFO ] After 11131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1039 ms.
[2022-05-15 21:02:57] [INFO ] After 13554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 89 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1089/1089 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:58] [INFO ] Computed 43 place invariants in 19 ms
[2022-05-15 21:02:58] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:58] [INFO ] Computed 43 place invariants in 9 ms
[2022-05-15 21:02:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:02:59] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2022-05-15 21:02:59] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:59] [INFO ] Computed 43 place invariants in 9 ms
[2022-05-15 21:02:59] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:02:59] [INFO ] Computed 43 place invariants in 6 ms
[2022-05-15 21:02:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 21:02:59] [INFO ] [Real]Absence check using 11 positive and 32 generalized place invariants in 9 ms returned sat
[2022-05-15 21:02:59] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:03:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 21:03:00] [INFO ] [Nat]Absence check using 11 positive and 32 generalized place invariants in 9 ms returned sat
[2022-05-15 21:03:01] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:03:01] [INFO ] After 1722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9516 ms.
[2022-05-15 21:03:11] [INFO ] After 11334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:03:11] [INFO ] Flatten gal took : 55 ms
[2022-05-15 21:03:11] [INFO ] Flatten gal took : 50 ms
[2022-05-15 21:03:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6492335791108475643.gal : 6 ms
[2022-05-15 21:03:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6611839286509327479.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6889670722350829053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6492335791108475643.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6611839286509327479.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6611839286509327479.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 45
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :45 after 89
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :89 after 353
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :353 after 9241
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :9241 after 429529
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :429529 after 458173
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :458173 after 470629
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :470629 after 552505
Reachability property apf18 is true.
Reachability property apf11 is true.
Reachability property apf7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.14465e+07,1.16769,28140,2,21014,17,55781,6,0,2883,32108,0
Total reachable state count : 11446480

Verifying 3 reachability properties.
Reachability property apf7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,1040,1.28809,28140,2,1158,17,55781,7,0,2898,32108,0
Reachability property apf11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf11,520,1.34336,28140,2,1093,17,55781,8,0,2901,32108,0
Reachability property apf18 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf18,1040,1.34421,28140,2,1158,17,55781,8,0,2901,32108,0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2))))), (X (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND p3 p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p3) p0 (NOT p1)))), (G (NOT (AND (NOT p3) p2 p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p3) p2 (NOT p0) (NOT p1))), (F (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F (AND p3 (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (OR (AND p3 p0) (AND p3 p1))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (F (OR (AND p2 p0) (AND p2 p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))]
Knowledge based reduction with 40 factoid took 2614 ms. Reduced automaton from 9 states, 38 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 424 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 403 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Support contains 5 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1616/1616 transitions.
Applied a total of 0 rules in 35 ms. Remains 1063 /1063 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:03:16] [INFO ] Computed 143 place invariants in 18 ms
[2022-05-15 21:03:16] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:03:16] [INFO ] Computed 143 place invariants in 12 ms
[2022-05-15 21:03:18] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:03:18] [INFO ] Computed 143 place invariants in 26 ms
[2022-05-15 21:03:19] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1616/1616 transitions.
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 (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (OR (AND p1 p2) (AND p2 p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1131 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 358 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:03:21] [INFO ] Computed 143 place invariants in 9 ms
[2022-05-15 21:03:21] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-15 21:03:21] [INFO ] [Real]Absence check using 33 positive and 110 generalized place invariants in 27 ms returned sat
[2022-05-15 21:03:21] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 21:03:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-15 21:03:22] [INFO ] [Nat]Absence check using 33 positive and 110 generalized place invariants in 27 ms returned sat
[2022-05-15 21:03:29] [INFO ] After 7525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 21:03:31] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 1 ms to minimize.
[2022-05-15 21:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2022-05-15 21:03:33] [INFO ] After 11036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4935 ms.
[2022-05-15 21:03:38] [INFO ] After 16254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 186 ms.
Support contains 5 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1063/1063 places, 1616/1616 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 203 place count 1063 transition count 1413
Reduce places removed 203 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 204 rules applied. Total rules applied 407 place count 860 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 408 place count 859 transition count 1412
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 408 place count 859 transition count 1276
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 317 rules applied. Total rules applied 725 place count 678 transition count 1276
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 743 place count 669 transition count 1267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 752 place count 660 transition count 1267
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 752 place count 660 transition count 1251
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 784 place count 644 transition count 1251
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 789 place count 639 transition count 1246
Iterating global reduction 5 with 5 rules applied. Total rules applied 794 place count 639 transition count 1246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 798 place count 639 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 799 place count 638 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 799 place count 638 transition count 1241
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 801 place count 637 transition count 1241
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 921 place count 577 transition count 1181
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 926 place count 577 transition count 1176
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 931 place count 572 transition count 1176
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 951 place count 572 transition count 1156
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 972 place count 551 transition count 1156
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 976 place count 551 transition count 1152
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 992 place count 551 transition count 1152
Applied a total of 992 rules in 153 ms. Remains 551 /1063 variables (removed 512) and now considering 1152/1616 (removed 464) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/1063 places, 1152/1616 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 333945 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{1=1}
Probabilistic random walk after 333945 steps, saw 78109 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 1152 rows 551 cols
[2022-05-15 21:03:42] [INFO ] Computed 88 place invariants in 7 ms
[2022-05-15 21:03:42] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-15 21:03:42] [INFO ] [Real]Absence check using 23 positive and 65 generalized place invariants in 13 ms returned sat
[2022-05-15 21:03:42] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:03:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-15 21:03:42] [INFO ] [Nat]Absence check using 23 positive and 65 generalized place invariants in 13 ms returned sat
[2022-05-15 21:03:45] [INFO ] After 2804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:03:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 21:03:46] [INFO ] After 931ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:03:46] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 0 ms to minimize.
[2022-05-15 21:03:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2022-05-15 21:03:49] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 1 ms to minimize.
[2022-05-15 21:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2022-05-15 21:03:49] [INFO ] After 3946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 672 ms.
[2022-05-15 21:03:49] [INFO ] After 7573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 56 ms.
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1152/1152 transitions.
Applied a total of 0 rules in 21 ms. Remains 551 /551 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 1152/1152 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 317899 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317899 steps, saw 74686 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1152 rows 551 cols
[2022-05-15 21:03:53] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-15 21:03:53] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-15 21:03:53] [INFO ] [Real]Absence check using 23 positive and 65 generalized place invariants in 13 ms returned sat
[2022-05-15 21:03:53] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:03:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-15 21:03:53] [INFO ] [Nat]Absence check using 23 positive and 65 generalized place invariants in 14 ms returned sat
[2022-05-15 21:03:56] [INFO ] After 2987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:03:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-15 21:03:57] [INFO ] After 1009ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:03:58] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 1 ms to minimize.
[2022-05-15 21:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2022-05-15 21:04:00] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 0 ms to minimize.
[2022-05-15 21:04:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2022-05-15 21:04:01] [INFO ] After 4451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 857 ms.
[2022-05-15 21:04:01] [INFO ] After 8443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1152/1152 transitions.
Applied a total of 0 rules in 16 ms. Remains 551 /551 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 1152/1152 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1152/1152 transitions.
Applied a total of 0 rules in 15 ms. Remains 551 /551 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
// Phase 1: matrix 1152 rows 551 cols
[2022-05-15 21:04:02] [INFO ] Computed 88 place invariants in 12 ms
[2022-05-15 21:04:02] [INFO ] Implicit Places using invariants in 463 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 288, 297, 304, 305, 306, 376, 382, 385, 387, 390, 397, 398, 399, 468, 475, 478, 480, 483, 496]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 466 ms to find 35 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 516/551 places, 1152/1152 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 516 transition count 1151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 515 transition count 1151
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 515 transition count 1141
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 505 transition count 1141
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 38 place count 489 transition count 1125
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 489 transition count 1125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 59 place count 489 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 485 transition count 1116
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 485 transition count 1116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 75 place count 481 transition count 1112
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 87 place count 481 transition count 1100
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 99 place count 469 transition count 1100
Applied a total of 99 rules in 77 ms. Remains 469 /516 variables (removed 47) and now considering 1100/1152 (removed 52) transitions.
// Phase 1: matrix 1100 rows 469 cols
[2022-05-15 21:04:02] [INFO ] Computed 53 place invariants in 18 ms
[2022-05-15 21:04:02] [INFO ] Implicit Places using invariants in 351 ms returned [72, 89, 145, 162, 218, 256, 313, 330, 386, 404]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 352 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 459/551 places, 1100/1152 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 458 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 1099
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 453 transition count 1094
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 453 transition count 1089
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 22 place count 448 transition count 1089
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 448 transition count 1089
Applied a total of 23 rules in 58 ms. Remains 448 /459 variables (removed 11) and now considering 1089/1100 (removed 11) transitions.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:02] [INFO ] Computed 43 place invariants in 14 ms
[2022-05-15 21:04:03] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:03] [INFO ] Computed 43 place invariants in 6 ms
[2022-05-15 21:04:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:04:04] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 448/551 places, 1089/1152 transitions.
Finished structural reductions, in 3 iterations. Remains : 448/551 places, 1089/1152 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 275477 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{1=1, 4=1}
Probabilistic random walk after 275477 steps, saw 99341 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:07] [INFO ] Computed 43 place invariants in 6 ms
[2022-05-15 21:04:07] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 21:04:07] [INFO ] [Real]Absence check using 11 positive and 32 generalized place invariants in 9 ms returned sat
[2022-05-15 21:04:07] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:04:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:04:07] [INFO ] [Nat]Absence check using 11 positive and 32 generalized place invariants in 11 ms returned sat
[2022-05-15 21:04:09] [INFO ] After 1370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:04:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:04:09] [INFO ] After 591ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 21:04:10] [INFO ] After 1528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1308 ms.
[2022-05-15 21:04:12] [INFO ] After 4308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 236 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1089/1089 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 311343 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311343 steps, saw 107260 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:15] [INFO ] Computed 43 place invariants in 14 ms
[2022-05-15 21:04:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:04:15] [INFO ] [Real]Absence check using 11 positive and 32 generalized place invariants in 12 ms returned sat
[2022-05-15 21:04:15] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:04:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:04:15] [INFO ] [Nat]Absence check using 11 positive and 32 generalized place invariants in 11 ms returned sat
[2022-05-15 21:04:17] [INFO ] After 1349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:04:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:04:17] [INFO ] After 549ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 21:04:18] [INFO ] After 1492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1321 ms.
[2022-05-15 21:04:20] [INFO ] After 4275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 235 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1089/1089 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:20] [INFO ] Computed 43 place invariants in 17 ms
[2022-05-15 21:04:20] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:20] [INFO ] Computed 43 place invariants in 7 ms
[2022-05-15 21:04:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:04:21] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2022-05-15 21:04:21] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:21] [INFO ] Computed 43 place invariants in 9 ms
[2022-05-15 21:04:22] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1089/1089 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1089 rows 448 cols
[2022-05-15 21:04:22] [INFO ] Computed 43 place invariants in 10 ms
[2022-05-15 21:04:22] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:04:22] [INFO ] [Real]Absence check using 11 positive and 32 generalized place invariants in 13 ms returned sat
[2022-05-15 21:04:22] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:04:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:04:22] [INFO ] [Nat]Absence check using 11 positive and 32 generalized place invariants in 13 ms returned sat
[2022-05-15 21:04:24] [INFO ] After 1406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:04:24] [INFO ] After 2078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 906 ms.
[2022-05-15 21:04:25] [INFO ] After 3146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 21:04:25] [INFO ] Flatten gal took : 57 ms
[2022-05-15 21:04:25] [INFO ] Flatten gal took : 44 ms
[2022-05-15 21:04:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7384665322907600701.gal : 4 ms
[2022-05-15 21:04:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16489987830017497609.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11432624865134469113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7384665322907600701.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16489987830017497609.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16489987830017497609.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 45
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :45 after 89
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :89 after 353
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :353 after 9241
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :9241 after 429529
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :429529 after 458173
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :458173 after 470629
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :470629 after 552505
Reachability property apf12 is true.
Reachability property apf7 is true.
Reachability property apf4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.14465e+07,1.21872,27876,2,21014,17,55391,6,0,2883,32106,0
Total reachable state count : 11446480

Verifying 3 reachability properties.
Reachability property apf4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1040,1.32324,27876,2,1158,17,55391,7,0,2898,32106,0
Reachability property apf7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,520,1.37099,27876,2,1093,17,55391,8,0,2898,32106,0
Reachability property apf12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf12,1040,1.37186,27876,2,1158,17,55391,8,0,2898,32106,0
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (OR (AND p1 p2) (AND p2 p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p3)), (F (OR (AND p1 p2) (AND p2 p3))), (F (AND p1 p2 (NOT p3))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (OR (AND p1 p3) (AND p0 p3))), (F (AND p1 (NOT p3))), (F (AND (NOT p1) p0 (NOT p2))), (F (OR p1 p0)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 p3))]
Knowledge based reduction with 19 factoid took 1877 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 533 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 428 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 382 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 786 reset in 344 ms.
Product exploration explored 100000 steps with 838 reset in 370 ms.
Built C files in :
/tmp/ltsmin13542176152155955966
[2022-05-15 21:04:31] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13542176152155955966
Running compilation step : cd /tmp/ltsmin13542176152155955966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2844 ms.
Running link step : cd /tmp/ltsmin13542176152155955966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13542176152155955966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1079377256803383120.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1616/1616 transitions.
Applied a total of 0 rules in 19 ms. Remains 1063 /1063 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:04:46] [INFO ] Computed 143 place invariants in 8 ms
[2022-05-15 21:04:46] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:04:46] [INFO ] Computed 143 place invariants in 8 ms
[2022-05-15 21:04:48] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
// Phase 1: matrix 1616 rows 1063 cols
[2022-05-15 21:04:48] [INFO ] Computed 143 place invariants in 8 ms
[2022-05-15 21:04:48] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1616/1616 transitions.
Built C files in :
/tmp/ltsmin1226248738549815687
[2022-05-15 21:04:48] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1226248738549815687
Running compilation step : cd /tmp/ltsmin1226248738549815687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2526 ms.
Running link step : cd /tmp/ltsmin1226248738549815687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1226248738549815687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6589152455336916155.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 21:05:03] [INFO ] Flatten gal took : 55 ms
[2022-05-15 21:05:03] [INFO ] Flatten gal took : 46 ms
[2022-05-15 21:05:03] [INFO ] Time to serialize gal into /tmp/LTL1785391796279469694.gal : 5 ms
[2022-05-15 21:05:03] [INFO ] Time to serialize properties into /tmp/LTL1973750125317960488.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1785391796279469694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1973750125317960488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1785391...266
Read 1 LTL properties
Checking formula 0 : !((!((G((!(("((p831==1)&&(p1042==1))")U("(p934==1)")))||(X("((p586==1)&&(p618==1))"))))U(((F("((p586==1)&&(p618==1))"))&&("(p831==1)")...176
Formula 0 simplified : G(!("((p831==1)&&(p1042==1))" U "(p934==1)") | X"((p586==1)&&(p618==1))") U ("(p831==1)" & "(p1042==1)" & F"((p586==1)&&(p618==1))")
Detected timeout of ITS tools.
[2022-05-15 21:05:19] [INFO ] Flatten gal took : 40 ms
[2022-05-15 21:05:19] [INFO ] Applying decomposition
[2022-05-15 21:05:19] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17108180595775327037.txt' '-o' '/tmp/graph17108180595775327037.bin' '-w' '/tmp/graph17108180595775327037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17108180595775327037.bin' '-l' '-1' '-v' '-w' '/tmp/graph17108180595775327037.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:05:19] [INFO ] Decomposing Gal with order
[2022-05-15 21:05:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:05:19] [INFO ] Removed a total of 2233 redundant transitions.
[2022-05-15 21:05:19] [INFO ] Flatten gal took : 138 ms
[2022-05-15 21:05:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 27 ms.
[2022-05-15 21:05:19] [INFO ] Time to serialize gal into /tmp/LTL6870088084033781375.gal : 35 ms
[2022-05-15 21:05:19] [INFO ] Time to serialize properties into /tmp/LTL15222767749594532051.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6870088084033781375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15222767749594532051.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6870088...246
Read 1 LTL properties
Checking formula 0 : !((!((G((!(("((i12.u235.p831==1)&&(i12.u294.p1042==1))")U("(i13.u266.p934==1)")))||(X("((i7.u170.p586==1)&&(i7.u169.p618==1))"))))U(((...253
Formula 0 simplified : G(!("((i12.u235.p831==1)&&(i12.u294.p1042==1))" U "(i13.u266.p934==1)") | X"((i7.u170.p586==1)&&(i7.u169.p618==1))") U ("(i12.u235.p...232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin396611020689365178
[2022-05-15 21:05:34] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin396611020689365178
Running compilation step : cd /tmp/ltsmin396611020689365178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2754 ms.
Running link step : cd /tmp/ltsmin396611020689365178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin396611020689365178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!([]((!((LTLAPp0==true) U (LTLAPp1==true))||X((LTLAPp2==true)))) U (<>((LTLAPp2==true))&&(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-05a-LTLFireability-09 finished in 255610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((G(p1)||p0)))&&p2)))'
Support contains 6 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1078 transition count 1683
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1078 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1076 transition count 1674
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1076 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1075 transition count 1666
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1075 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1074 transition count 1658
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1074 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1073 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1073 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1072 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1072 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1071 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1071 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1070 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1070 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1069 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1069 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1068 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1068 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1067 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1067 transition count 1602
Applied a total of 28 rules in 252 ms. Remains 1067 /1081 variables (removed 14) and now considering 1602/1698 (removed 96) transitions.
// Phase 1: matrix 1602 rows 1067 cols
[2022-05-15 21:05:49] [INFO ] Computed 147 place invariants in 19 ms
[2022-05-15 21:05:50] [INFO ] Implicit Places using invariants in 434 ms returned [210, 573, 755, 955, 1016]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 436 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1062/1081 places, 1602/1698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1061 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1061 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1060 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1060 transition count 1600
Applied a total of 4 rules in 56 ms. Remains 1060 /1062 variables (removed 2) and now considering 1600/1602 (removed 2) transitions.
// Phase 1: matrix 1600 rows 1060 cols
[2022-05-15 21:05:50] [INFO ] Computed 142 place invariants in 25 ms
[2022-05-15 21:05:50] [INFO ] Implicit Places using invariants in 387 ms returned []
// Phase 1: matrix 1600 rows 1060 cols
[2022-05-15 21:05:50] [INFO ] Computed 142 place invariants in 8 ms
[2022-05-15 21:05:52] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1060/1081 places, 1600/1698 transitions.
Finished structural reductions, in 2 iterations. Remains : 1060/1081 places, 1600/1698 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s54 0) (EQ s195 0)), p0:(OR (EQ s397 0) (EQ s612 0)), p1:(OR (EQ s233 0) (EQ s376 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1057 ms.
Product exploration explored 100000 steps with 50000 reset in 906 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 p2 p0 p1), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (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 p2 p0 p1)
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ASLink-PT-05a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLFireability-14 finished in 4888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(F(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((!(p0 U p1)||X(p2))) U (F(p2)&&p3)))'
Found a CL insensitive property : ASLink-PT-05a-LTLFireability-09
Stuttering acceptance computed with spot in 421 ms :[(AND p2 p3), true, p2, (AND p2 p3), (AND p2 p3), (AND (NOT p1) p2 p3), (OR (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (NOT p1)]
Support contains 5 out of 1081 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1081/1081 places, 1698/1698 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1081 transition count 1502
Reduce places removed 196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 197 rules applied. Total rules applied 393 place count 885 transition count 1501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 884 transition count 1501
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 394 place count 884 transition count 1369
Deduced a syphon composed of 132 places in 6 ms
Ensure Unique test removed 45 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 309 rules applied. Total rules applied 703 place count 707 transition count 1369
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 720 place count 699 transition count 1360
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 729 place count 690 transition count 1360
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 729 place count 690 transition count 1348
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 753 place count 678 transition count 1348
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 760 place count 671 transition count 1329
Iterating global reduction 5 with 7 rules applied. Total rules applied 767 place count 671 transition count 1329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 5 with 5 rules applied. Total rules applied 772 place count 670 transition count 1325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 773 place count 669 transition count 1325
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 775 place count 667 transition count 1316
Iterating global reduction 7 with 2 rules applied. Total rules applied 777 place count 667 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 778 place count 666 transition count 1308
Iterating global reduction 7 with 1 rules applied. Total rules applied 779 place count 666 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 780 place count 665 transition count 1300
Iterating global reduction 7 with 1 rules applied. Total rules applied 781 place count 665 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 782 place count 664 transition count 1292
Iterating global reduction 7 with 1 rules applied. Total rules applied 783 place count 664 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 784 place count 663 transition count 1284
Iterating global reduction 7 with 1 rules applied. Total rules applied 785 place count 663 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 786 place count 662 transition count 1276
Iterating global reduction 7 with 1 rules applied. Total rules applied 787 place count 662 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 788 place count 661 transition count 1268
Iterating global reduction 7 with 1 rules applied. Total rules applied 789 place count 661 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 790 place count 660 transition count 1260
Iterating global reduction 7 with 1 rules applied. Total rules applied 791 place count 660 transition count 1260
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 7 with 126 rules applied. Total rules applied 917 place count 597 transition count 1197
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 919 place count 595 transition count 1195
Iterating global reduction 7 with 2 rules applied. Total rules applied 921 place count 595 transition count 1195
Applied a total of 921 rules in 193 ms. Remains 595 /1081 variables (removed 486) and now considering 1195/1698 (removed 503) transitions.
// Phase 1: matrix 1195 rows 595 cols
[2022-05-15 21:05:55] [INFO ] Computed 93 place invariants in 17 ms
[2022-05-15 21:05:55] [INFO ] Implicit Places using invariants in 466 ms returned [90, 96, 101, 117, 118, 193, 199, 204, 220, 327, 429, 430, 500, 507, 512, 531, 552, 587, 592]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 467 ms to find 19 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 576/1081 places, 1195/1698 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 576 transition count 1188
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 569 transition count 1188
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 569 transition count 1174
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 555 transition count 1174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 49 place count 548 transition count 1167
Iterating global reduction 2 with 7 rules applied. Total rules applied 56 place count 548 transition count 1167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 548 transition count 1166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 547 transition count 1166
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 541 transition count 1160
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 541 transition count 1160
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 538 transition count 1157
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 538 transition count 1157
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 528 transition count 1147
Applied a total of 96 rules in 52 ms. Remains 528 /576 variables (removed 48) and now considering 1147/1195 (removed 48) transitions.
// Phase 1: matrix 1147 rows 528 cols
[2022-05-15 21:05:55] [INFO ] Computed 74 place invariants in 11 ms
[2022-05-15 21:05:56] [INFO ] Implicit Places using invariants in 265 ms returned [93, 96, 177, 180, 280, 283, 361, 367, 372, 374, 377, 459, 462]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 266 ms to find 13 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 515/1081 places, 1147/1698 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 515 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 510 transition count 1142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 17 place count 503 transition count 1135
Iterating global reduction 2 with 7 rules applied. Total rules applied 24 place count 503 transition count 1135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 29 place count 503 transition count 1130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 501 transition count 1128
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 501 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 500 transition count 1127
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 500 transition count 1127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 498 transition count 1125
Applied a total of 39 rules in 43 ms. Remains 498 /515 variables (removed 17) and now considering 1125/1147 (removed 22) transitions.
// Phase 1: matrix 1125 rows 498 cols
[2022-05-15 21:05:56] [INFO ] Computed 61 place invariants in 10 ms
[2022-05-15 21:05:56] [INFO ] Implicit Places using invariants in 228 ms returned [72, 151, 231, 331, 411]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 230 ms to find 5 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 493/1081 places, 1125/1698 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 488 transition count 1120
Applied a total of 10 rules in 21 ms. Remains 488 /493 variables (removed 5) and now considering 1120/1125 (removed 5) transitions.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:05:56] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-15 21:05:56] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:05:56] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-15 21:05:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:05:57] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 4 : 488/1081 places, 1120/1698 transitions.
Finished structural reductions, in 4 iterations. Remains : 488/1081 places, 1120/1698 transitions.
Running random walk in product with property : ASLink-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=4 dest: 6}, { cond=(OR (AND p1 p3 p2) (AND p0 p3 p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(OR p1 p0), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(OR p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=8 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(AND (EQ s367 1) (EQ s451 1)), p2:(AND (EQ s264 1) (EQ s273 1)), p1:(EQ s418 1), p0:(AND (EQ s367 1) (EQ s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1847 reset in 273 ms.
Product exploration explored 100000 steps with 1869 reset in 292 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 (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2))))), (X (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2042 ms. Reduced automaton from 11 states, 45 edges and 4 AP to 9 states, 38 edges and 4 AP.
Stuttering acceptance computed with spot in 415 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND (NOT p1) p2 p3), (OR (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 136 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 20) seen :9
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:06:01] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-15 21:06:01] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-15 21:06:01] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 9 ms returned sat
[2022-05-15 21:06:01] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2022-05-15 21:06:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-15 21:06:02] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 21:06:04] [INFO ] After 2568ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-05-15 21:06:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:06:07] [INFO ] After 2687ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2022-05-15 21:06:18] [INFO ] After 14010ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 2701 ms.
[2022-05-15 21:06:21] [INFO ] After 19435ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 232 ms.
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 488/488 places, 1120/1120 transitions.
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 488 transition count 1103
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 38 place count 471 transition count 1099
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 471 transition count 1085
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 66 place count 457 transition count 1085
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 457 transition count 1085
Applied a total of 70 rules in 62 ms. Remains 457 /488 variables (removed 31) and now considering 1085/1120 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/488 places, 1085/1120 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 220945 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{1=1, 4=1}
Probabilistic random walk after 220945 steps, saw 91078 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :2
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 457 cols
[2022-05-15 21:06:25] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-15 21:06:25] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-15 21:06:25] [INFO ] [Real]Absence check using 12 positive and 44 generalized place invariants in 10 ms returned sat
[2022-05-15 21:06:25] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:06:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:06:25] [INFO ] [Nat]Absence check using 12 positive and 44 generalized place invariants in 9 ms returned sat
[2022-05-15 21:06:27] [INFO ] After 1753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:06:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:06:29] [INFO ] After 1891ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:06:30] [INFO ] After 3421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1515 ms.
[2022-05-15 21:06:32] [INFO ] After 6803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 46 ms.
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 10 ms. Remains 457 /457 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/457 places, 1085/1085 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 234961 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234961 steps, saw 94180 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 457 cols
[2022-05-15 21:06:35] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-15 21:06:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:06:35] [INFO ] [Real]Absence check using 12 positive and 44 generalized place invariants in 11 ms returned sat
[2022-05-15 21:06:35] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:06:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:06:35] [INFO ] [Nat]Absence check using 12 positive and 44 generalized place invariants in 9 ms returned sat
[2022-05-15 21:06:37] [INFO ] After 1488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:06:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:06:39] [INFO ] After 1893ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:06:40] [INFO ] After 3314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1770 ms.
[2022-05-15 21:06:42] [INFO ] After 6684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 121 ms.
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 16 ms. Remains 457 /457 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/457 places, 1085/1085 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 10 ms. Remains 457 /457 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
// Phase 1: matrix 1085 rows 457 cols
[2022-05-15 21:06:42] [INFO ] Computed 56 place invariants in 19 ms
[2022-05-15 21:06:42] [INFO ] Implicit Places using invariants in 432 ms returned [89, 90, 160, 161, 242, 253, 254, 325, 326]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 433 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 448/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 448/457 places, 1085/1085 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 224292 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224292 steps, saw 91828 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:06:46] [INFO ] Computed 47 place invariants in 10 ms
[2022-05-15 21:06:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 21:06:46] [INFO ] [Real]Absence check using 11 positive and 36 generalized place invariants in 10 ms returned sat
[2022-05-15 21:06:46] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:06:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:06:46] [INFO ] [Nat]Absence check using 11 positive and 36 generalized place invariants in 18 ms returned sat
[2022-05-15 21:06:56] [INFO ] After 9920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 21:06:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:06:58] [INFO ] After 1658ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:06:59] [INFO ] After 3323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1570 ms.
[2022-05-15 21:07:01] [INFO ] After 14987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 124 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1085/1085 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1085/1085 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1085/1085 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:07:01] [INFO ] Computed 47 place invariants in 10 ms
[2022-05-15 21:07:01] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:07:01] [INFO ] Computed 47 place invariants in 9 ms
[2022-05-15 21:07:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:07:02] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2022-05-15 21:07:02] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:07:02] [INFO ] Computed 47 place invariants in 7 ms
[2022-05-15 21:07:03] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1085/1085 transitions.
Applied a total of 0 rules in 9 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:07:03] [INFO ] Computed 47 place invariants in 6 ms
[2022-05-15 21:07:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:07:03] [INFO ] [Real]Absence check using 11 positive and 36 generalized place invariants in 16 ms returned sat
[2022-05-15 21:07:03] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:07:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:07:03] [INFO ] [Nat]Absence check using 11 positive and 36 generalized place invariants in 16 ms returned sat
[2022-05-15 21:07:13] [INFO ] After 9765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 21:07:15] [INFO ] After 11521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 714 ms.
[2022-05-15 21:07:15] [INFO ] After 12390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:07:15] [INFO ] Flatten gal took : 57 ms
[2022-05-15 21:07:15] [INFO ] Flatten gal took : 44 ms
[2022-05-15 21:07:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2399457700945213237.gal : 4 ms
[2022-05-15 21:07:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18251293265499480890.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11581512790683739879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2399457700945213237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18251293265499480890.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18251293265499480890.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 45
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :45 after 221
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :221 after 485
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :485 after 9241
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :9241 after 409157
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :409157 after 433601
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :433601 after 434390
Reachability property apf19 is true.
Reachability property apf18 is true.
Reachability property apf11 is true.
Reachability property apf7 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :434390 after 7.38891e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.38891e+06 after 7.42751e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.42751e+06 after 5.92106e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.92106e+07 after 6.04771e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.04771e+08 after 9.38604e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.38604e+09 after 4.07412e+10
Reachability property apf9 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Detected timeout of ITS tools.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p3 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2))))), (X (X (NOT (OR (AND p1 p3 p2) (AND p0 p3 p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND p3 p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p3) p0 (NOT p1)))), (G (NOT (AND (NOT p3) p2 p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p3) p2 (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F (AND p3 (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (OR (AND p3 p0) (AND p3 p1))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))]
Knowledge based reduction with 40 factoid took 1895 ms. Reduced automaton from 9 states, 38 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 381 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 422 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 1120/1120 transitions.
Applied a total of 0 rules in 10 ms. Remains 488 /488 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:07:33] [INFO ] Computed 56 place invariants in 16 ms
[2022-05-15 21:07:34] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:07:34] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-15 21:07:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:07:35] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:07:35] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-15 21:07:35] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/488 places, 1120/1120 transitions.
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 (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (OR (AND p1 p2) (AND p2 p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1338 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 435 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Incomplete random walk after 10000 steps, including 143 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:07:38] [INFO ] Computed 56 place invariants in 12 ms
[2022-05-15 21:07:38] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-15 21:07:38] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 14 ms returned sat
[2022-05-15 21:07:38] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 21:07:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-15 21:07:38] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 14 ms returned sat
[2022-05-15 21:07:42] [INFO ] After 4046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 21:07:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:07:44] [INFO ] After 2539ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 21:07:47] [INFO ] After 5015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5137 ms.
[2022-05-15 21:07:52] [INFO ] After 14368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 253 ms.
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 488/488 places, 1120/1120 transitions.
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 488 transition count 1103
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 38 place count 471 transition count 1099
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 471 transition count 1085
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 66 place count 457 transition count 1085
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 457 transition count 1085
Applied a total of 70 rules in 74 ms. Remains 457 /488 variables (removed 31) and now considering 1085/1120 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/488 places, 1085/1120 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 225441 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{1=1}
Probabilistic random walk after 225441 steps, saw 92106 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 457 cols
[2022-05-15 21:07:56] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-15 21:07:56] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:07:56] [INFO ] [Real]Absence check using 12 positive and 44 generalized place invariants in 9 ms returned sat
[2022-05-15 21:07:56] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:07:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:07:56] [INFO ] [Nat]Absence check using 12 positive and 44 generalized place invariants in 10 ms returned sat
[2022-05-15 21:07:58] [INFO ] After 1800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:07:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:08:13] [INFO ] After 14565ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:08:14] [INFO ] After 16394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1004 ms.
[2022-05-15 21:08:15] [INFO ] After 19304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 116 ms.
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 14 ms. Remains 457 /457 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/457 places, 1085/1085 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 221401 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221401 steps, saw 91230 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 457 cols
[2022-05-15 21:08:19] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-15 21:08:19] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:08:19] [INFO ] [Real]Absence check using 12 positive and 44 generalized place invariants in 10 ms returned sat
[2022-05-15 21:08:19] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:08:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-15 21:08:19] [INFO ] [Nat]Absence check using 12 positive and 44 generalized place invariants in 9 ms returned sat
[2022-05-15 21:08:21] [INFO ] After 1500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:08:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:08:31] [INFO ] After 9866ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:08:32] [INFO ] After 11453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1619 ms.
[2022-05-15 21:08:34] [INFO ] After 14676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 169 ms.
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 14 ms. Remains 457 /457 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/457 places, 1085/1085 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 13 ms. Remains 457 /457 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
// Phase 1: matrix 1085 rows 457 cols
[2022-05-15 21:08:34] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-15 21:08:34] [INFO ] Implicit Places using invariants in 324 ms returned [89, 90, 160, 161, 242, 253, 254, 325, 326]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 326 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 448/457 places, 1085/1085 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 448/457 places, 1085/1085 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 196391 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196391 steps, saw 85372 distinct states, run finished after 3002 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:08:38] [INFO ] Computed 47 place invariants in 22 ms
[2022-05-15 21:08:38] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 21:08:38] [INFO ] [Real]Absence check using 11 positive and 36 generalized place invariants in 10 ms returned sat
[2022-05-15 21:08:38] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:08:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-15 21:08:38] [INFO ] [Nat]Absence check using 11 positive and 36 generalized place invariants in 17 ms returned sat
[2022-05-15 21:08:40] [INFO ] After 2259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:08:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:08:43] [INFO ] After 3021ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 21:08:45] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 1 ms to minimize.
[2022-05-15 21:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2022-05-15 21:08:46] [INFO ] After 5825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1395 ms.
[2022-05-15 21:08:48] [INFO ] After 9672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 108 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1085/1085 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1085/1085 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 1085/1085 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:08:48] [INFO ] Computed 47 place invariants in 19 ms
[2022-05-15 21:08:48] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:08:48] [INFO ] Computed 47 place invariants in 8 ms
[2022-05-15 21:08:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:08:49] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2022-05-15 21:08:49] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:08:49] [INFO ] Computed 47 place invariants in 9 ms
[2022-05-15 21:08:49] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1085/1085 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 1085/1085 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1085 rows 448 cols
[2022-05-15 21:08:49] [INFO ] Computed 47 place invariants in 6 ms
[2022-05-15 21:08:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-15 21:08:49] [INFO ] [Real]Absence check using 11 positive and 36 generalized place invariants in 11 ms returned sat
[2022-05-15 21:08:50] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:08:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-15 21:08:50] [INFO ] [Nat]Absence check using 11 positive and 36 generalized place invariants in 15 ms returned sat
[2022-05-15 21:08:52] [INFO ] After 2427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 21:08:54] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 0 ms to minimize.
[2022-05-15 21:08:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2022-05-15 21:08:54] [INFO ] After 4322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10475 ms.
[2022-05-15 21:09:04] [INFO ] After 14957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:09:04] [INFO ] Flatten gal took : 29 ms
[2022-05-15 21:09:05] [INFO ] Flatten gal took : 28 ms
[2022-05-15 21:09:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8540105162330361726.gal : 2 ms
[2022-05-15 21:09:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6206485045955143872.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17906239883653343146;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8540105162330361726.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6206485045955143872.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6206485045955143872.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 45
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :45 after 221
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :221 after 485
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :485 after 9241
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :9241 after 409157
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :409157 after 433601
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :433601 after 434390
Reachability property apf13 is true.
Reachability property apf12 is true.
Reachability property apf7 is true.
Reachability property apf4 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :434390 after 7.38891e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.38891e+06 after 7.42751e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.42751e+06 after 5.92106e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.92106e+07 after 6.04771e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.04771e+08 after 9.38604e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.38604e+09 after 4.07412e+10
Reachability property apf6 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.01529e+12,14.6516,285364,2,78100,23,753944,6,0,2879,822273,0
Total reachable state count : 2015289769394

Verifying 5 reachability properties.
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND p1 p3) (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (OR (AND p1 p2) (AND p2 p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND p1 p3) (AND p0 p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (OR (AND p1 p3) (AND p0 p3))), (F (AND p1 (NOT p3))), (F (AND (NOT p1) p0 (NOT p2))), (F (OR p1 p0)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 p3))]
Knowledge based reduction with 19 factoid took 1548 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 471 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 464 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 445 ms :[(OR (AND p1 p2 p3) (AND p0 p2 p3)), (OR (AND p1 p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 p2)), (OR (AND p2 (NOT p3)) (AND p0 p2) (AND p1 p2)), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 1873 reset in 352 ms.
Product exploration explored 100000 steps with 1896 reset in 327 ms.
Built C files in :
/tmp/ltsmin8573267171610441881
[2022-05-15 21:09:23] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8573267171610441881
Running compilation step : cd /tmp/ltsmin8573267171610441881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2144 ms.
Running link step : cd /tmp/ltsmin8573267171610441881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8573267171610441881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7901454255464426754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 1120/1120 transitions.
Applied a total of 0 rules in 12 ms. Remains 488 /488 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:09:38] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-15 21:09:39] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:09:39] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-15 21:09:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 21:09:40] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
// Phase 1: matrix 1120 rows 488 cols
[2022-05-15 21:09:40] [INFO ] Computed 56 place invariants in 18 ms
[2022-05-15 21:09:40] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/488 places, 1120/1120 transitions.
Built C files in :
/tmp/ltsmin5041538939901461754
[2022-05-15 21:09:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5041538939901461754
Running compilation step : cd /tmp/ltsmin5041538939901461754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1635 ms.
Running link step : cd /tmp/ltsmin5041538939901461754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5041538939901461754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14860999424193097693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 21:09:55] [INFO ] Flatten gal took : 30 ms
[2022-05-15 21:09:55] [INFO ] Flatten gal took : 30 ms
[2022-05-15 21:09:55] [INFO ] Time to serialize gal into /tmp/LTL8451919518207098280.gal : 3 ms
[2022-05-15 21:09:55] [INFO ] Time to serialize properties into /tmp/LTL9246996417449570845.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8451919518207098280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9246996417449570845.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8451919...266
Read 1 LTL properties
Checking formula 0 : !((!((G((!(("((p831==1)&&(p1042==1))")U("(p934==1)")))||(X("((p586==1)&&(p618==1))"))))U(((F("((p586==1)&&(p618==1))"))&&("(p831==1)")...176
Formula 0 simplified : G(!("((p831==1)&&(p1042==1))" U "(p934==1)") | X"((p586==1)&&(p618==1))") U ("(p831==1)" & "(p1042==1)" & F"((p586==1)&&(p618==1))")
Detected timeout of ITS tools.
[2022-05-15 21:10:11] [INFO ] Flatten gal took : 67 ms
[2022-05-15 21:10:11] [INFO ] Applying decomposition
[2022-05-15 21:10:11] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5348163045458540779.txt' '-o' '/tmp/graph5348163045458540779.bin' '-w' '/tmp/graph5348163045458540779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5348163045458540779.bin' '-l' '-1' '-v' '-w' '/tmp/graph5348163045458540779.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:10:11] [INFO ] Decomposing Gal with order
[2022-05-15 21:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:10:11] [INFO ] Removed a total of 2245 redundant transitions.
[2022-05-15 21:10:11] [INFO ] Flatten gal took : 88 ms
[2022-05-15 21:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 15 ms.
[2022-05-15 21:10:11] [INFO ] Time to serialize gal into /tmp/LTL2800421146257316586.gal : 22 ms
[2022-05-15 21:10:11] [INFO ] Time to serialize properties into /tmp/LTL2485702375116111062.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2800421146257316586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2485702375116111062.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2800421...245
Read 1 LTL properties
Checking formula 0 : !((!((G((!(("((i10.u94.p831==1)&&(i10.u116.p1042==1))")U("(i9.i0.u103.p934==1)")))||(X("((i6.i0.u69.p586==1)&&(i6.i0.u69.p618==1))")))...261
Formula 0 simplified : G(!("((i10.u94.p831==1)&&(i10.u116.p1042==1))" U "(i9.i0.u103.p934==1)") | X"((i6.i0.u69.p586==1)&&(i6.i0.u69.p618==1))") U ("(i10.u...240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13252648913365055706
[2022-05-15 21:10:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13252648913365055706
Running compilation step : cd /tmp/ltsmin13252648913365055706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1911 ms.
Running link step : cd /tmp/ltsmin13252648913365055706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin13252648913365055706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!([]((!((LTLAPp0==true) U (LTLAPp1==true))||X((LTLAPp2==true)))) U (<>((LTLAPp2==true))&&(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-05a-LTLFireability-09 finished in 286801 ms.
[2022-05-15 21:10:41] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6173976512530721153
[2022-05-15 21:10:41] [INFO ] Too many transitions (1698) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:10:41] [INFO ] Applying decomposition
[2022-05-15 21:10:41] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6173976512530721153
Running compilation step : cd /tmp/ltsmin6173976512530721153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:10:41] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18153910508986832789.txt' '-o' '/tmp/graph18153910508986832789.bin' '-w' '/tmp/graph18153910508986832789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18153910508986832789.bin' '-l' '-1' '-v' '-w' '/tmp/graph18153910508986832789.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:10:41] [INFO ] Decomposing Gal with order
[2022-05-15 21:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:10:41] [INFO ] Removed a total of 2399 redundant transitions.
[2022-05-15 21:10:41] [INFO ] Flatten gal took : 146 ms
[2022-05-15 21:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 26 ms.
[2022-05-15 21:10:42] [INFO ] Time to serialize gal into /tmp/LTLFireability9135046354310016874.gal : 33 ms
[2022-05-15 21:10:42] [INFO ] Time to serialize properties into /tmp/LTLFireability1511456411083378337.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9135046354310016874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1511456411083378337.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((F(G(G(F(F("(i2.i4.u55.p172==0)")))))))
Formula 0 simplified : !FGF"(i2.i4.u55.p172==0)"
Compilation finished in 3438 ms.
Running link step : cd /tmp/ltsmin6173976512530721153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6173976512530721153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]([](<>(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 21:34:53] [INFO ] Applying decomposition
[2022-05-15 21:34:53] [INFO ] Flatten gal took : 184 ms
[2022-05-15 21:34:53] [INFO ] Decomposing Gal with order
[2022-05-15 21:34:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:34:53] [INFO ] Removed a total of 1996 redundant transitions.
[2022-05-15 21:34:53] [INFO ] Flatten gal took : 217 ms
[2022-05-15 21:34:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 699 labels/synchronizations in 53 ms.
[2022-05-15 21:34:54] [INFO ] Time to serialize gal into /tmp/LTLFireability10151039376094763241.gal : 4 ms
[2022-05-15 21:34:54] [INFO ] Time to serialize properties into /tmp/LTLFireability14090380134629082884.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10151039376094763241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14090380134629082884.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F(G(G(F(F("(i5.u23.p172==0)")))))))
Formula 0 simplified : !FGF"(i5.u23.p172==0)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6173976512530721153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]([](<>(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6173976512530721153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!([]((!((LTLAPp1==true) U (LTLAPp2==true))||X((LTLAPp3==true)))) U (<>((LTLAPp3==true))&&(LTLAPp4==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1028, t1083, t1275, t1278, t1279, t1282, t1284, t1287, t1299, t1301, t1308, t1361, t1384, t1...866
Computing Next relation with stutter on 3.45014e+13 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-05a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245688800076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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