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

About the Execution of LTSMin+red for ASLink-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1274.084 130120.00 209538.00 63.10 TTFFFFF?TFTTTTTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 516K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-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 1678606829443

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:40:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 07:40:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:40:31] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-12 07:40:31] [INFO ] Transformed 1211 places.
[2023-03-12 07:40:31] [INFO ] Transformed 1827 transitions.
[2023-03-12 07:40:31] [INFO ] Found NUPN structural information;
[2023-03-12 07:40:31] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 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 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 1173 transition count 1777
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1172 transition count 1777
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 1172 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1171 transition count 1767
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1171 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1170 transition count 1759
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1170 transition count 1759
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1751
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1168 transition count 1743
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1167 transition count 1735
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1167 transition count 1735
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1166 transition count 1727
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1166 transition count 1727
Applied a total of 61 rules in 552 ms. Remains 1166 /1211 variables (removed 45) and now considering 1727/1808 (removed 81) transitions.
// Phase 1: matrix 1727 rows 1166 cols
[2023-03-12 07:40:32] [INFO ] Computed 201 place invariants in 66 ms
[2023-03-12 07:40:33] [INFO ] Implicit Places using invariants in 1069 ms returned [1, 19, 20, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 617, 635, 764, 780, 785, 786, 787, 805, 823, 952, 957, 969, 974, 975, 976, 1006, 1009, 1027, 1028, 1029, 1030, 1047, 1055, 1063, 1069, 1075, 1081, 1087, 1095, 1101, 1107, 1115]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1098 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1111/1211 places, 1727/1808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1098 transition count 1714
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1098 transition count 1714
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1088 transition count 1704
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1088 transition count 1704
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1083 transition count 1699
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1083 transition count 1699
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1081 transition count 1697
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1081 transition count 1697
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1079 transition count 1695
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1079 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1078 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1078 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1077 transition count 1693
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1077 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1076 transition count 1692
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1076 transition count 1692
Applied a total of 70 rules in 264 ms. Remains 1076 /1111 variables (removed 35) and now considering 1692/1727 (removed 35) transitions.
// Phase 1: matrix 1692 rows 1076 cols
[2023-03-12 07:40:33] [INFO ] Computed 146 place invariants in 33 ms
[2023-03-12 07:40:34] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-12 07:40:34] [INFO ] Invariant cache hit.
[2023-03-12 07:40:37] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 4030 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1076/1211 places, 1692/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5944 ms. Remains : 1076/1211 places, 1692/1808 transitions.
Support contains 57 out of 1076 places after structural reductions.
[2023-03-12 07:40:38] [INFO ] Flatten gal took : 154 ms
[2023-03-12 07:40:38] [INFO ] Flatten gal took : 88 ms
[2023-03-12 07:40:38] [INFO ] Input system was already deterministic with 1692 transitions.
Support contains 55 out of 1076 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-12 07:40:39] [INFO ] Invariant cache hit.
[2023-03-12 07:40:40] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-12 07:40:40] [INFO ] [Nat]Absence check using 29 positive place invariants in 70 ms returned sat
[2023-03-12 07:40:40] [INFO ] [Nat]Absence check using 29 positive and 117 generalized place invariants in 41 ms returned sat
[2023-03-12 07:40:43] [INFO ] After 2615ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :7
[2023-03-12 07:40:45] [INFO ] After 3882ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :7
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-12 07:40:45] [INFO ] After 5868ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :7
Fused 20 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 13 out of 1076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1076 transition count 1506
Reduce places removed 186 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 188 rules applied. Total rules applied 374 place count 890 transition count 1504
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 376 place count 888 transition count 1504
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 376 place count 888 transition count 1361
Deduced a syphon composed of 143 places in 2 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 707 place count 700 transition count 1361
Discarding 7 places :
Implicit places reduction removed 7 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 16 rules applied. Total rules applied 723 place count 693 transition count 1352
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 732 place count 684 transition count 1352
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 732 place count 684 transition count 1332
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 772 place count 664 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 779 place count 657 transition count 1313
Iterating global reduction 5 with 7 rules applied. Total rules applied 786 place count 657 transition count 1313
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 791 place count 656 transition count 1309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 792 place count 655 transition count 1309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 792 place count 655 transition count 1308
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 794 place count 654 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 795 place count 653 transition count 1300
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 653 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 797 place count 652 transition count 1292
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 652 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 651 transition count 1284
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 651 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 650 transition count 1276
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 650 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 649 transition count 1268
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 649 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 648 transition count 1260
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 648 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 647 transition count 1252
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 647 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 646 transition count 1244
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 646 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 645 transition count 1236
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 645 transition count 1236
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 908 place count 597 transition count 1188
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 596 transition count 1187
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 596 transition count 1187
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 914 place count 596 transition count 1183
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 918 place count 592 transition count 1183
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 940 place count 592 transition count 1161
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 963 place count 569 transition count 1161
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 966 place count 569 transition count 1158
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 984 place count 569 transition count 1158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 985 place count 568 transition count 1157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 990 place count 563 transition count 1157
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 9 Pre rules applied. Total rules applied 990 place count 563 transition count 1148
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 23 rules applied. Total rules applied 1013 place count 549 transition count 1148
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1018 place count 544 transition count 1143
Iterating global reduction 10 with 5 rules applied. Total rules applied 1023 place count 544 transition count 1143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1028 place count 544 transition count 1138
Applied a total of 1028 rules in 621 ms. Remains 544 /1076 variables (removed 532) and now considering 1138/1692 (removed 554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 544/1076 places, 1138/1692 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1138 rows 544 cols
[2023-03-12 07:40:47] [INFO ] Computed 82 place invariants in 9 ms
[2023-03-12 07:40:47] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-12 07:40:47] [INFO ] [Real]Absence check using 18 positive and 64 generalized place invariants in 20 ms returned sat
[2023-03-12 07:40:48] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 07:40:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-12 07:40:48] [INFO ] [Nat]Absence check using 18 positive and 64 generalized place invariants in 50 ms returned sat
[2023-03-12 07:40:49] [INFO ] After 1083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 07:40:50] [INFO ] After 1858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-12 07:40:50] [INFO ] After 2582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 146 ms.
Support contains 11 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1138/1138 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 544 transition count 1137
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 543 transition count 1137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 542 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 542 transition count 1131
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 541 transition count 1131
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 1 with 2 rules applied. Total rules applied 7 place count 540 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 539 transition count 1129
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 539 transition count 1129
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 539 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 538 transition count 1128
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 538 transition count 1128
Applied a total of 12 rules in 94 ms. Remains 538 /544 variables (removed 6) and now considering 1128/1138 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 538/544 places, 1128/1138 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 213722 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 213722 steps, saw 112950 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :3
Running SMT prover for 3 properties.
// Phase 1: matrix 1128 rows 538 cols
[2023-03-12 07:40:54] [INFO ] Computed 81 place invariants in 8 ms
[2023-03-12 07:40:54] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2023-03-12 07:40:54] [INFO ] [Real]Absence check using 23 positive and 58 generalized place invariants in 33 ms returned sat
[2023-03-12 07:40:55] [INFO ] After 706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 07:40:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-12 07:40:55] [INFO ] [Nat]Absence check using 23 positive and 58 generalized place invariants in 58 ms returned sat
[2023-03-12 07:40:56] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 07:40:56] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-12 07:40:56] [INFO ] After 1111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 6 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 1128/1128 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 538 transition count 1127
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 537 transition count 1127
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 4 place count 536 transition count 1126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 536 transition count 1125
Applied a total of 5 rules in 89 ms. Remains 536 /538 variables (removed 2) and now considering 1125/1128 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 536/538 places, 1125/1128 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 248809 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{1=1}
Probabilistic random walk after 248809 steps, saw 175181 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 1125 rows 536 cols
[2023-03-12 07:40:59] [INFO ] Computed 81 place invariants in 10 ms
[2023-03-12 07:41:00] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-12 07:41:00] [INFO ] [Real]Absence check using 19 positive and 62 generalized place invariants in 47 ms returned sat
[2023-03-12 07:41:00] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:41:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-12 07:41:00] [INFO ] [Nat]Absence check using 19 positive and 62 generalized place invariants in 36 ms returned sat
[2023-03-12 07:41:01] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:41:01] [INFO ] After 613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-12 07:41:01] [INFO ] After 1111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 5 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 1125/1125 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 536 transition count 1124
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 2 place count 535 transition count 1124
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 4 place count 534 transition count 1123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 534 transition count 1122
Applied a total of 5 rules in 36 ms. Remains 534 /536 variables (removed 2) and now considering 1122/1125 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 534/536 places, 1122/1125 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 9074 steps, run visited all 2 properties in 46 ms. (steps per millisecond=197 )
Probabilistic random walk after 9074 steps, saw 8448 distinct states, run finished after 58 ms. (steps per millisecond=156 ) properties seen :2
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-05a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-05a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1073 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1064 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1064 transition count 1600
Applied a total of 24 rules in 234 ms. Remains 1064 /1076 variables (removed 12) and now considering 1600/1692 (removed 92) transitions.
// Phase 1: matrix 1600 rows 1064 cols
[2023-03-12 07:41:02] [INFO ] Computed 146 place invariants in 34 ms
[2023-03-12 07:41:04] [INFO ] Implicit Places using invariants in 2486 ms returned [20, 211, 574, 954]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2504 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1076 places, 1600/1692 transitions.
Applied a total of 0 rules in 37 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2775 ms. Remains : 1060/1076 places, 1600/1692 transitions.
Stuttering acceptance computed with spot in 358 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: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-02 finished in 3224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 6 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1073 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1064 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1064 transition count 1600
Applied a total of 24 rules in 248 ms. Remains 1064 /1076 variables (removed 12) and now considering 1600/1692 (removed 92) transitions.
[2023-03-12 07:41:05] [INFO ] Invariant cache hit.
[2023-03-12 07:41:06] [INFO ] Implicit Places using invariants in 672 ms returned [20, 211, 574, 954]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 688 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1076 places, 1600/1692 transitions.
Applied a total of 0 rules in 35 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 971 ms. Remains : 1060/1076 places, 1600/1692 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s924 1) (EQ s959 1)), p0:(OR (AND (EQ s405 1) (EQ s620 1)) (AND (EQ s43 1) (EQ s258 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-03 finished in 1186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1074 transition count 1678
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1074 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1073 transition count 1670
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1073 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1662
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1606
Applied a total of 22 rules in 315 ms. Remains 1065 /1076 variables (removed 11) and now considering 1606/1692 (removed 86) transitions.
// Phase 1: matrix 1606 rows 1065 cols
[2023-03-12 07:41:06] [INFO ] Computed 146 place invariants in 17 ms
[2023-03-12 07:41:07] [INFO ] Implicit Places using invariants in 627 ms returned [20, 211, 955]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 628 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1062/1076 places, 1606/1692 transitions.
Applied a total of 0 rules in 22 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 965 ms. Remains : 1062/1076 places, 1606/1692 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s573 1) (EQ s728 1)), p1:(NEQ s263 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 607 reset in 494 ms.
Product exploration explored 100000 steps with 615 reset in 440 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 p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 678 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 180008 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 180008 steps, saw 71027 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1606 rows 1062 cols
[2023-03-12 07:41:12] [INFO ] Computed 143 place invariants in 14 ms
[2023-03-12 07:41:13] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2023-03-12 07:41:13] [INFO ] [Real]Absence check using 30 positive and 113 generalized place invariants in 278 ms returned sat
[2023-03-12 07:41:14] [INFO ] After 1382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 07:41:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-12 07:41:14] [INFO ] [Nat]Absence check using 30 positive and 113 generalized place invariants in 303 ms returned sat
[2023-03-12 07:41:15] [INFO ] After 826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:41:16] [INFO ] After 1435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-12 07:41:16] [INFO ] After 2475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1062 transition count 1408
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 864 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 863 transition count 1407
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 398 place count 863 transition count 1266
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 677 transition count 1266
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 742 place count 669 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 751 place count 660 transition count 1257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 751 place count 660 transition count 1237
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 791 place count 640 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 796 place count 635 transition count 1232
Iterating global reduction 5 with 5 rules applied. Total rules applied 801 place count 635 transition count 1232
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 805 place count 635 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 634 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 634 transition count 1227
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 808 place count 633 transition count 1227
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 922 place count 576 transition count 1170
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 926 place count 576 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 930 place count 572 transition count 1166
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 950 place count 572 transition count 1146
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 971 place count 551 transition count 1146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 551 transition count 1143
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 990 place count 551 transition count 1143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 991 place count 550 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 996 place count 545 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 996 place count 545 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1021 place count 530 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1026 place count 525 transition count 1127
Iterating global reduction 10 with 5 rules applied. Total rules applied 1031 place count 525 transition count 1127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1036 place count 525 transition count 1122
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 11 with 2 rules applied. Total rules applied 1038 place count 524 transition count 1121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1039 place count 524 transition count 1120
Applied a total of 1039 rules in 262 ms. Remains 524 /1062 variables (removed 538) and now considering 1120/1606 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 524/1062 places, 1120/1606 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Finished probabilistic random walk after 114738 steps, run visited all 4 properties in 965 ms. (steps per millisecond=118 )
Probabilistic random walk after 114738 steps, saw 32664 distinct states, run finished after 966 ms. (steps per millisecond=118 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 753 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Applied a total of 0 rules in 38 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-12 07:41:19] [INFO ] Invariant cache hit.
[2023-03-12 07:41:20] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-12 07:41:20] [INFO ] Invariant cache hit.
[2023-03-12 07:41:22] [INFO ] Implicit Places using invariants and state equation in 2547 ms returned []
Implicit Place search using SMT with State Equation took 3129 ms to find 0 implicit places.
[2023-03-12 07:41:22] [INFO ] Invariant cache hit.
[2023-03-12 07:41:23] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3993 ms. Remains : 1062/1062 places, 1606/1606 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 p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 474 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 178975 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178975 steps, saw 70586 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 07:41:27] [INFO ] Invariant cache hit.
[2023-03-12 07:41:27] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-12 07:41:27] [INFO ] [Real]Absence check using 30 positive and 113 generalized place invariants in 79 ms returned sat
[2023-03-12 07:41:28] [INFO ] After 1064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 07:41:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-12 07:41:28] [INFO ] [Nat]Absence check using 30 positive and 113 generalized place invariants in 56 ms returned sat
[2023-03-12 07:41:30] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:41:30] [INFO ] After 1589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-12 07:41:30] [INFO ] After 2376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1062 transition count 1408
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 864 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 863 transition count 1407
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 398 place count 863 transition count 1266
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 677 transition count 1266
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 742 place count 669 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 751 place count 660 transition count 1257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 751 place count 660 transition count 1237
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 791 place count 640 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 796 place count 635 transition count 1232
Iterating global reduction 5 with 5 rules applied. Total rules applied 801 place count 635 transition count 1232
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 805 place count 635 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 634 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 634 transition count 1227
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 808 place count 633 transition count 1227
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 922 place count 576 transition count 1170
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 926 place count 576 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 930 place count 572 transition count 1166
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 950 place count 572 transition count 1146
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 971 place count 551 transition count 1146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 551 transition count 1143
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 990 place count 551 transition count 1143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 991 place count 550 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 996 place count 545 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 996 place count 545 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1021 place count 530 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1026 place count 525 transition count 1127
Iterating global reduction 10 with 5 rules applied. Total rules applied 1031 place count 525 transition count 1127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1036 place count 525 transition count 1122
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 11 with 2 rules applied. Total rules applied 1038 place count 524 transition count 1121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1039 place count 524 transition count 1120
Applied a total of 1039 rules in 224 ms. Remains 524 /1062 variables (removed 538) and now considering 1120/1606 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 524/1062 places, 1120/1606 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Finished probabilistic random walk after 114738 steps, run visited all 4 properties in 922 ms. (steps per millisecond=124 )
Probabilistic random walk after 114738 steps, saw 32664 distinct states, run finished after 922 ms. (steps per millisecond=124 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 628 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 628 reset in 320 ms.
Product exploration explored 100000 steps with 608 reset in 382 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Applied a total of 0 rules in 28 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-12 07:41:34] [INFO ] Invariant cache hit.
[2023-03-12 07:41:35] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-12 07:41:35] [INFO ] Invariant cache hit.
[2023-03-12 07:41:37] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2023-03-12 07:41:37] [INFO ] Invariant cache hit.
[2023-03-12 07:41:38] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3742 ms. Remains : 1062/1062 places, 1606/1606 transitions.
Treatment of property ASLink-PT-05a-LTLFireability-07 finished in 32091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 5 out of 1076 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1076 transition count 1504
Reduce places removed 188 places and 0 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 376 place count 888 transition count 1504
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 376 place count 888 transition count 1363
Deduced a syphon composed of 141 places in 3 ms
Ensure Unique test removed 44 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 702 place count 703 transition count 1363
Discarding 7 places :
Implicit places reduction removed 7 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 2 with 16 rules applied. Total rules applied 718 place count 696 transition count 1354
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 727 place count 687 transition count 1354
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 727 place count 687 transition count 1335
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 765 place count 668 transition count 1335
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 773 place count 660 transition count 1310
Iterating global reduction 4 with 8 rules applied. Total rules applied 781 place count 660 transition count 1310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 4 with 6 rules applied. Total rules applied 787 place count 658 transition count 1306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 788 place count 657 transition count 1306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 788 place count 657 transition count 1305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 790 place count 656 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 791 place count 655 transition count 1297
Iterating global reduction 6 with 1 rules applied. Total rules applied 792 place count 655 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 793 place count 654 transition count 1289
Iterating global reduction 6 with 1 rules applied. Total rules applied 794 place count 654 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 795 place count 653 transition count 1281
Iterating global reduction 6 with 1 rules applied. Total rules applied 796 place count 653 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 797 place count 652 transition count 1273
Iterating global reduction 6 with 1 rules applied. Total rules applied 798 place count 652 transition count 1273
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 799 place count 651 transition count 1265
Iterating global reduction 6 with 1 rules applied. Total rules applied 800 place count 651 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 801 place count 650 transition count 1257
Iterating global reduction 6 with 1 rules applied. Total rules applied 802 place count 650 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 803 place count 649 transition count 1249
Iterating global reduction 6 with 1 rules applied. Total rules applied 804 place count 649 transition count 1249
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 805 place count 648 transition count 1241
Iterating global reduction 6 with 1 rules applied. Total rules applied 806 place count 648 transition count 1241
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 807 place count 647 transition count 1233
Iterating global reduction 6 with 1 rules applied. Total rules applied 808 place count 647 transition count 1233
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 912 place count 595 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 915 place count 592 transition count 1178
Iterating global reduction 6 with 3 rules applied. Total rules applied 918 place count 592 transition count 1178
Applied a total of 918 rules in 273 ms. Remains 592 /1076 variables (removed 484) and now considering 1178/1692 (removed 514) transitions.
// Phase 1: matrix 1178 rows 592 cols
[2023-03-12 07:41:38] [INFO ] Computed 93 place invariants in 11 ms
[2023-03-12 07:41:39] [INFO ] Implicit Places using invariants in 418 ms returned [19, 91, 97, 102, 118, 119, 194, 200, 205, 224, 299, 305, 310, 326, 327, 402, 408, 413, 429, 499, 505, 510, 529, 589]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 421 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 568/1076 places, 1178/1692 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 568 transition count 1169
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 559 transition count 1169
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 559 transition count 1159
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 549 transition count 1159
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 540 transition count 1150
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 540 transition count 1150
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 65 place count 531 transition count 1141
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 531 transition count 1141
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 526 transition count 1136
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 526 transition count 1136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 108 place count 514 transition count 1124
Applied a total of 108 rules in 81 ms. Remains 514 /568 variables (removed 54) and now considering 1124/1178 (removed 54) transitions.
// Phase 1: matrix 1124 rows 514 cols
[2023-03-12 07:41:39] [INFO ] Computed 69 place invariants in 16 ms
[2023-03-12 07:41:39] [INFO ] Implicit Places using invariants in 412 ms returned [93, 96, 182, 185, 271, 274, 355, 358, 439, 442]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 414 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 504/1076 places, 1124/1692 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 504 transition count 1119
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 499 transition count 1119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 494 transition count 1114
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 494 transition count 1114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 494 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 493 transition count 1108
Applied a total of 27 rules in 44 ms. Remains 493 /504 variables (removed 11) and now considering 1108/1124 (removed 16) transitions.
// Phase 1: matrix 1108 rows 493 cols
[2023-03-12 07:41:39] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-12 07:41:40] [INFO ] Implicit Places using invariants in 439 ms returned [72, 151, 237, 321, 401]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 455 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 488/1076 places, 1108/1692 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 483 transition count 1103
Applied a total of 10 rules in 23 ms. Remains 483 /488 variables (removed 5) and now considering 1103/1108 (removed 5) transitions.
// Phase 1: matrix 1103 rows 483 cols
[2023-03-12 07:41:40] [INFO ] Computed 54 place invariants in 7 ms
[2023-03-12 07:41:40] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-12 07:41:40] [INFO ] Invariant cache hit.
[2023-03-12 07:41:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 07:41:42] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 483/1076 places, 1103/1692 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3442 ms. Remains : 483/1076 places, 1103/1692 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), true, p0]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s171 1), p0:(OR (AND (EQ s197 1) (EQ s309 1)) (AND (EQ s440 1) (EQ s477 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-09 finished in 3655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1073 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1064 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1064 transition count 1600
Applied a total of 24 rules in 329 ms. Remains 1064 /1076 variables (removed 12) and now considering 1600/1692 (removed 92) transitions.
// Phase 1: matrix 1600 rows 1064 cols
[2023-03-12 07:41:42] [INFO ] Computed 146 place invariants in 10 ms
[2023-03-12 07:41:43] [INFO ] Implicit Places using invariants in 589 ms returned [20, 211, 574, 954]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 590 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1076 places, 1600/1692 transitions.
Applied a total of 0 rules in 35 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 954 ms. Remains : 1060/1076 places, 1600/1692 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1036 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 962 ms.
Product exploration explored 100000 steps with 50000 reset in 895 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLFireability-11 finished in 3073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Found a Lengthening insensitive property : ASLink-PT-05a-LTLFireability-07
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 191 place count 1075 transition count 1500
Reduce places removed 195 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 389 place count 880 transition count 1497
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 393 place count 877 transition count 1496
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 876 transition count 1496
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 151 Pre rules applied. Total rules applied 394 place count 876 transition count 1345
Deduced a syphon composed of 151 places in 2 ms
Ensure Unique test removed 46 places
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 4 with 348 rules applied. Total rules applied 742 place count 679 transition count 1345
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 29 rules applied. Total rules applied 771 place count 667 transition count 1328
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 788 place count 650 transition count 1328
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 788 place count 650 transition count 1307
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 830 place count 629 transition count 1307
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 841 place count 618 transition count 1284
Iterating global reduction 6 with 11 rules applied. Total rules applied 852 place count 618 transition count 1284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 9 rules applied. Total rules applied 861 place count 617 transition count 1276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 862 place count 616 transition count 1276
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 862 place count 616 transition count 1275
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 864 place count 615 transition count 1275
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 865 place count 614 transition count 1267
Iterating global reduction 8 with 1 rules applied. Total rules applied 866 place count 614 transition count 1267
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 867 place count 613 transition count 1259
Iterating global reduction 8 with 1 rules applied. Total rules applied 868 place count 613 transition count 1259
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 869 place count 612 transition count 1251
Iterating global reduction 8 with 1 rules applied. Total rules applied 870 place count 612 transition count 1251
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 871 place count 611 transition count 1243
Iterating global reduction 8 with 1 rules applied. Total rules applied 872 place count 611 transition count 1243
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 873 place count 610 transition count 1235
Iterating global reduction 8 with 1 rules applied. Total rules applied 874 place count 610 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 875 place count 609 transition count 1227
Iterating global reduction 8 with 1 rules applied. Total rules applied 876 place count 609 transition count 1227
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 877 place count 608 transition count 1219
Iterating global reduction 8 with 1 rules applied. Total rules applied 878 place count 608 transition count 1219
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 879 place count 607 transition count 1211
Iterating global reduction 8 with 1 rules applied. Total rules applied 880 place count 607 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 881 place count 606 transition count 1203
Iterating global reduction 8 with 1 rules applied. Total rules applied 882 place count 606 transition count 1203
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 8 with 92 rules applied. Total rules applied 974 place count 560 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 975 place count 559 transition count 1156
Iterating global reduction 8 with 1 rules applied. Total rules applied 976 place count 559 transition count 1156
Applied a total of 976 rules in 302 ms. Remains 559 /1076 variables (removed 517) and now considering 1156/1692 (removed 536) transitions.
// Phase 1: matrix 1156 rows 559 cols
[2023-03-12 07:41:45] [INFO ] Computed 83 place invariants in 21 ms
[2023-03-12 07:41:46] [INFO ] Implicit Places using invariants in 414 ms returned [72, 89, 95, 100, 108, 184, 190, 195, 264, 281, 287, 292, 294, 357, 378, 384, 389, 390, 395, 455, 472, 478, 483, 485, 514, 556]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 416 ms to find 26 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 533/1076 places, 1156/1692 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 533 transition count 1151
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 528 transition count 1151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 21 place count 517 transition count 1140
Iterating global reduction 2 with 11 rules applied. Total rules applied 32 place count 517 transition count 1140
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 507 transition count 1130
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 507 transition count 1130
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 502 transition count 1125
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 502 transition count 1125
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 485 transition count 1108
Applied a total of 96 rules in 48 ms. Remains 485 /533 variables (removed 48) and now considering 1108/1156 (removed 48) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2023-03-12 07:41:46] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-12 07:41:46] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 07:41:46] [INFO ] Invariant cache hit.
[2023-03-12 07:41:47] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 485/1076 places, 1108/1692 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2370 ms. Remains : 485/1076 places, 1108/1692 transitions.
Running random walk in product with property : ASLink-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s266 1) (EQ s342 1)), p1:(NEQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1483 reset in 233 ms.
Product exploration explored 100000 steps with 1460 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 730 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 149 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:41:49] [INFO ] Invariant cache hit.
[2023-03-12 07:41:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 07:41:49] [INFO ] [Real]Absence check using 12 positive and 45 generalized place invariants in 41 ms returned sat
[2023-03-12 07:41:50] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:41:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 49 ms returned sat
[2023-03-12 07:41:50] [INFO ] [Nat]Absence check using 12 positive and 45 generalized place invariants in 61 ms returned sat
[2023-03-12 07:41:51] [INFO ] After 1166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:41:51] [INFO ] After 1236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 07:41:51] [INFO ] After 1540ms 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 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 485 transition count 1107
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 2 place count 484 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 482 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 482 transition count 1100
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 26 place count 482 transition count 1080
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 50 place count 462 transition count 1076
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 462 transition count 1061
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 81 place count 446 transition count 1061
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 81 place count 446 transition count 1059
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 443 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 442 transition count 1058
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 442 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 442 transition count 1057
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 442 transition count 1056
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 442 transition count 1056
Applied a total of 91 rules in 131 ms. Remains 442 /485 variables (removed 43) and now considering 1056/1108 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 442/485 places, 1056/1108 transitions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 442249 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 442249 steps, saw 314616 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1056 rows 442 cols
[2023-03-12 07:41:54] [INFO ] Computed 55 place invariants in 16 ms
[2023-03-12 07:41:54] [INFO ] [Real]Absence check using 10 positive place invariants in 32 ms returned sat
[2023-03-12 07:41:54] [INFO ] [Real]Absence check using 10 positive and 45 generalized place invariants in 33 ms returned sat
[2023-03-12 07:41:55] [INFO ] After 852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:41:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 07:41:55] [INFO ] [Nat]Absence check using 10 positive and 45 generalized place invariants in 70 ms returned sat
[2023-03-12 07:41:56] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:41:56] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 07:41:56] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 25 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 442/442 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2023-03-12 07:41:56] [INFO ] Invariant cache hit.
[2023-03-12 07:41:57] [INFO ] Implicit Places using invariants in 831 ms returned [88, 89, 141, 159, 164, 165, 235, 236, 237, 313, 314]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 834 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/442 places, 1056/1056 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 431 transition count 1052
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 427 transition count 1052
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 2 with 4 rules applied. Total rules applied 12 place count 425 transition count 1050
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 425 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 424 transition count 1049
Applied a total of 14 rules in 31 ms. Remains 424 /431 variables (removed 7) and now considering 1049/1056 (removed 7) transitions.
// Phase 1: matrix 1049 rows 424 cols
[2023-03-12 07:41:57] [INFO ] Computed 44 place invariants in 7 ms
[2023-03-12 07:41:57] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-12 07:41:57] [INFO ] Invariant cache hit.
[2023-03-12 07:41:58] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/442 places, 1049/1056 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2425 ms. Remains : 424/442 places, 1049/1056 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452530 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452530 steps, saw 318959 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:42:01] [INFO ] Invariant cache hit.
[2023-03-12 07:42:01] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 07:42:02] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 60 ms returned sat
[2023-03-12 07:42:02] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:42:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 07:42:02] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 12 ms returned sat
[2023-03-12 07:42:03] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:42:03] [INFO ] After 661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-12 07:42:03] [INFO ] After 831ms 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 REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 31 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 424/424 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 13 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-12 07:42:03] [INFO ] Invariant cache hit.
[2023-03-12 07:42:03] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-12 07:42:03] [INFO ] Invariant cache hit.
[2023-03-12 07:42:05] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
[2023-03-12 07:42:05] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-12 07:42:05] [INFO ] Invariant cache hit.
[2023-03-12 07:42:06] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3089 ms. Remains : 424/424 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.
Running SMT prover for 1 properties.
[2023-03-12 07:42:06] [INFO ] Invariant cache hit.
[2023-03-12 07:42:06] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-12 07:42:06] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-12 07:42:06] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:42:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 07:42:06] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 60 ms returned sat
[2023-03-12 07:42:07] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:42:07] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 07:42:07] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 10 factoid took 723 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Applied a total of 0 rules in 7 ms. Remains 485 /485 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2023-03-12 07:42:08] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-12 07:42:09] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-12 07:42:09] [INFO ] Invariant cache hit.
[2023-03-12 07:42:11] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2474 ms to find 0 implicit places.
[2023-03-12 07:42:11] [INFO ] Invariant cache hit.
[2023-03-12 07:42:11] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3036 ms. Remains : 485/485 places, 1108/1108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 578 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 152 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 148803 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148803 steps, saw 66828 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 07:42:15] [INFO ] Invariant cache hit.
[2023-03-12 07:42:15] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 07:42:15] [INFO ] [Real]Absence check using 12 positive and 45 generalized place invariants in 12 ms returned sat
[2023-03-12 07:42:16] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 07:42:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 07:42:16] [INFO ] [Nat]Absence check using 12 positive and 45 generalized place invariants in 39 ms returned sat
[2023-03-12 07:42:17] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:42:17] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-12 07:42:17] [INFO ] After 1406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 485 transition count 1088
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 465 transition count 1085
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 465 transition count 1070
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 74 place count 449 transition count 1070
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 74 place count 449 transition count 1068
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 446 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 445 transition count 1067
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 445 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 445 transition count 1066
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 445 transition count 1065
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 445 transition count 1065
Applied a total of 84 rules in 70 ms. Remains 445 /485 variables (removed 40) and now considering 1065/1108 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 445/485 places, 1065/1108 transitions.
Incomplete random walk after 10000 steps, including 197 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 161175 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161175 steps, saw 111000 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1065 rows 445 cols
[2023-03-12 07:42:21] [INFO ] Computed 55 place invariants in 8 ms
[2023-03-12 07:42:21] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 07:42:21] [INFO ] [Real]Absence check using 11 positive and 44 generalized place invariants in 23 ms returned sat
[2023-03-12 07:42:21] [INFO ] After 284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-12 07:42:21] [INFO ] After 450ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 07:42:22] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-12 07:42:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-12 07:42:22] [INFO ] [Nat]Absence check using 11 positive and 44 generalized place invariants in 19 ms returned sat
[2023-03-12 07:42:22] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:42:23] [INFO ] After 800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-12 07:42:23] [INFO ] After 1144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 3 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1065/1065 transitions.
Applied a total of 0 rules in 12 ms. Remains 445 /445 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 445/445 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1065/1065 transitions.
Applied a total of 0 rules in 11 ms. Remains 445 /445 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2023-03-12 07:42:23] [INFO ] Invariant cache hit.
[2023-03-12 07:42:23] [INFO ] Implicit Places using invariants in 402 ms returned [88, 89, 141, 159, 164, 165, 235, 236, 316, 317]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 427 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/445 places, 1065/1065 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 1064
Applied a total of 2 rules in 18 ms. Remains 434 /435 variables (removed 1) and now considering 1064/1065 (removed 1) transitions.
// Phase 1: matrix 1064 rows 434 cols
[2023-03-12 07:42:23] [INFO ] Computed 45 place invariants in 7 ms
[2023-03-12 07:42:23] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 07:42:24] [INFO ] Invariant cache hit.
[2023-03-12 07:42:25] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/445 places, 1064/1065 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1953 ms. Remains : 434/445 places, 1064/1065 transitions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 149038 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149038 steps, saw 102087 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 07:42:28] [INFO ] Invariant cache hit.
[2023-03-12 07:42:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 07:42:28] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 12 ms returned sat
[2023-03-12 07:42:29] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 07:42:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 07:42:29] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 11 ms returned sat
[2023-03-12 07:42:30] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:42:30] [INFO ] After 1111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-12 07:42:30] [INFO ] After 1583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1064/1064 transitions.
Applied a total of 0 rules in 12 ms. Remains 434 /434 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 434/434 places, 1064/1064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1064/1064 transitions.
Applied a total of 0 rules in 15 ms. Remains 434 /434 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
[2023-03-12 07:42:30] [INFO ] Invariant cache hit.
[2023-03-12 07:42:31] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-12 07:42:31] [INFO ] Invariant cache hit.
[2023-03-12 07:42:31] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-12 07:42:32] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 07:42:32] [INFO ] Invariant cache hit.
[2023-03-12 07:42:32] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1685 ms. Remains : 434/434 places, 1064/1064 transitions.
Applied a total of 0 rules in 11 ms. Remains 434 /434 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-12 07:42:32] [INFO ] Invariant cache hit.
[2023-03-12 07:42:32] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 07:42:32] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 30 ms returned sat
[2023-03-12 07:42:32] [INFO ] After 424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 07:42:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 07:42:33] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 29 ms returned sat
[2023-03-12 07:42:33] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:42:34] [INFO ] After 895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-12 07:42:34] [INFO ] After 1285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 502 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1442 reset in 206 ms.
Product exploration explored 100000 steps with 1401 reset in 265 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Applied a total of 0 rules in 17 ms. Remains 485 /485 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2023-03-12 07:42:35] [INFO ] Computed 57 place invariants in 19 ms
[2023-03-12 07:42:36] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-12 07:42:36] [INFO ] Invariant cache hit.
[2023-03-12 07:42:37] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-12 07:42:37] [INFO ] Invariant cache hit.
[2023-03-12 07:42:38] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2461 ms. Remains : 485/485 places, 1108/1108 transitions.
Treatment of property ASLink-PT-05a-LTLFireability-07 finished in 52888 ms.
[2023-03-12 07:42:38] [INFO ] Flatten gal took : 75 ms
[2023-03-12 07:42:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 07:42:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1076 places, 1692 transitions and 5969 arcs took 10 ms.
Total runtime 126961 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1234/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ASLink-PT-05a-LTLFireability-07

BK_STOP 1678606959563

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ASLink-PT-05a-LTLFireability-07
ltl formula formula --ltl=/tmp/1234/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1076 places, 1692 transitions and 5969 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.150 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1234/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1234/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1234/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1234/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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