Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 7.8K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 677K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-07a-LTLCardinality-00
FORMULA_NAME ASLink-PT-07a-LTLCardinality-01
FORMULA_NAME ASLink-PT-07a-LTLCardinality-02
FORMULA_NAME ASLink-PT-07a-LTLCardinality-03
FORMULA_NAME ASLink-PT-07a-LTLCardinality-04
FORMULA_NAME ASLink-PT-07a-LTLCardinality-05
FORMULA_NAME ASLink-PT-07a-LTLCardinality-06
FORMULA_NAME ASLink-PT-07a-LTLCardinality-07
FORMULA_NAME ASLink-PT-07a-LTLCardinality-08
FORMULA_NAME ASLink-PT-07a-LTLCardinality-09
FORMULA_NAME ASLink-PT-07a-LTLCardinality-10
FORMULA_NAME ASLink-PT-07a-LTLCardinality-11
FORMULA_NAME ASLink-PT-07a-LTLCardinality-12
FORMULA_NAME ASLink-PT-07a-LTLCardinality-13
FORMULA_NAME ASLink-PT-07a-LTLCardinality-14
FORMULA_NAME ASLink-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652650837847

Running Version 202205111006
[2022-05-15 21:40:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:40:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:40:39] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2022-05-15 21:40:39] [INFO ] Transformed 1601 places.
[2022-05-15 21:40:39] [INFO ] Transformed 2373 transitions.
[2022-05-15 21:40:39] [INFO ] Found NUPN structural information;
[2022-05-15 21:40:39] [INFO ] Parsed PT model containing 1601 places and 2373 transitions in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA ASLink-PT-07a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1560 transition count 2348
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 1548 transition count 2293
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 1547 transition count 2293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 1547 transition count 2291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1546 transition count 2283
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1546 transition count 2283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1545 transition count 2275
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1545 transition count 2275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1544 transition count 2267
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1544 transition count 2267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1543 transition count 2259
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1543 transition count 2259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1542 transition count 2251
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1542 transition count 2251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1541 transition count 2243
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1541 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1540 transition count 2235
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1540 transition count 2235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1539 transition count 2227
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1539 transition count 2227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1538 transition count 2219
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1538 transition count 2219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1537 transition count 2211
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1537 transition count 2211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1536 transition count 2203
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1536 transition count 2203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1535 transition count 2195
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1535 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 1534 transition count 2187
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 1534 transition count 2187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1533 transition count 2179
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1533 transition count 2179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1532 transition count 2171
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1532 transition count 2171
Applied a total of 98 rules in 999 ms. Remains 1532 /1601 variables (removed 69) and now considering 2171/2348 (removed 177) transitions.
// Phase 1: matrix 2171 rows 1532 cols
[2022-05-15 21:40:40] [INFO ] Computed 266 place invariants in 138 ms
[2022-05-15 21:40:41] [INFO ] Implicit Places using invariants in 1340 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 762, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1332, 1344, 1349, 1350, 1351, 1370, 1372, 1375, 1393, 1394, 1395, 1396, 1413, 1421, 1429, 1435, 1441, 1447, 1453, 1461, 1467, 1473, 1481]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1366 ms to find 72 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1460/1601 places, 2171/2348 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1447 transition count 2158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1447 transition count 2158
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1437 transition count 2148
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1437 transition count 2148
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1432 transition count 2143
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1432 transition count 2143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1430 transition count 2141
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1430 transition count 2141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1428 transition count 2139
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1428 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1427 transition count 2138
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1427 transition count 2138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1426 transition count 2137
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1426 transition count 2137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1425 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1425 transition count 2136
Applied a total of 70 rules in 419 ms. Remains 1425 /1460 variables (removed 35) and now considering 2136/2171 (removed 35) transitions.
// Phase 1: matrix 2136 rows 1425 cols
[2022-05-15 21:40:42] [INFO ] Computed 194 place invariants in 60 ms
[2022-05-15 21:40:43] [INFO ] Implicit Places using invariants in 826 ms returned []
// Phase 1: matrix 2136 rows 1425 cols
[2022-05-15 21:40:43] [INFO ] Computed 194 place invariants in 15 ms
[2022-05-15 21:40:45] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1425/1601 places, 2136/2348 transitions.
Finished structural reductions, in 2 iterations. Remains : 1425/1601 places, 2136/2348 transitions.
Support contains 23 out of 1425 places after structural reductions.
[2022-05-15 21:40:45] [INFO ] Flatten gal took : 227 ms
[2022-05-15 21:40:45] [INFO ] Flatten gal took : 143 ms
[2022-05-15 21:40:45] [INFO ] Input system was already deterministic with 2136 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2136 rows 1425 cols
[2022-05-15 21:40:46] [INFO ] Computed 194 place invariants in 16 ms
[2022-05-15 21:40:46] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:40:46] [INFO ] [Nat]Absence check using 47 positive place invariants in 21 ms returned sat
[2022-05-15 21:40:46] [INFO ] [Nat]Absence check using 47 positive and 147 generalized place invariants in 33 ms returned sat
[2022-05-15 21:41:05] [INFO ] After 17983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:41:11] [INFO ] After 24660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 21:41:11] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 213 ms.
Support contains 8 out of 1425 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1424 transition count 1857
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1145 transition count 1856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 561 place count 1144 transition count 1856
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 561 place count 1144 transition count 1668
Deduced a syphon composed of 188 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 437 rules applied. Total rules applied 998 place count 895 transition count 1668
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1018 place count 884 transition count 1659
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1027 place count 875 transition count 1659
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1027 place count 875 transition count 1631
Deduced a syphon composed of 28 places in 7 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1083 place count 847 transition count 1631
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1089 place count 841 transition count 1618
Iterating global reduction 5 with 6 rules applied. Total rules applied 1095 place count 841 transition count 1618
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 1099 place count 841 transition count 1614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1100 place count 840 transition count 1614
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1100 place count 840 transition count 1613
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 1102 place count 839 transition count 1613
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 7 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 7 with 152 rules applied. Total rules applied 1254 place count 763 transition count 1537
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1261 place count 763 transition count 1530
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1268 place count 756 transition count 1530
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1296 place count 756 transition count 1502
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1325 place count 727 transition count 1502
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1331 place count 727 transition count 1496
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 1353 place count 727 transition count 1496
Applied a total of 1353 rules in 600 ms. Remains 727 /1425 variables (removed 698) and now considering 1496/2136 (removed 640) transitions.
Finished structural reductions, in 1 iterations. Remains : 727/1425 places, 1496/2136 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Finished probabilistic random walk after 111995 steps, run visited all 4 properties in 615 ms. (steps per millisecond=182 )
Probabilistic random walk after 111995 steps, saw 29097 distinct states, run finished after 617 ms. (steps per millisecond=181 ) properties seen :4
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(p0 U (p1 U (G(p0)&&X(p2))))))'
Support contains 3 out of 1425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1423 transition count 2128
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1423 transition count 2128
Applied a total of 3 rules in 131 ms. Remains 1423 /1425 variables (removed 2) and now considering 2128/2136 (removed 8) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2022-05-15 21:41:13] [INFO ] Computed 193 place invariants in 19 ms
[2022-05-15 21:41:14] [INFO ] Implicit Places using invariants in 903 ms returned [606]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 905 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1425 places, 2128/2136 transitions.
Applied a total of 0 rules in 45 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1422/1425 places, 2128/2136 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND p0 p2), (AND p0 p2), p0]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s559 0) (EQ s1284 1)), p2:(AND (EQ s419 1) (OR (EQ s559 0) (EQ s1284 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33326 reset in 1243 ms.
Product exploration explored 100000 steps with 33373 reset in 1166 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND p0 p2), (AND p0 p2), p0]
Finished random walk after 9080 steps, including 52 resets, run visited all 2 properties in 39 ms. (steps per millisecond=232 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p2), (AND p0 p2), p0]
Stuttering acceptance computed with spot in 83 ms :[(AND p0 p2), (AND p0 p2), p0]
Support contains 3 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 61 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:41:18] [INFO ] Computed 192 place invariants in 19 ms
[2022-05-15 21:41:18] [INFO ] Implicit Places using invariants in 775 ms returned []
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:41:18] [INFO ] Computed 192 place invariants in 14 ms
[2022-05-15 21:41:21] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 3182 ms to find 0 implicit places.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:41:21] [INFO ] Computed 192 place invariants in 15 ms
[2022-05-15 21:41:22] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1422/1422 places, 2128/2128 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 p0 (NOT p2)), (X (NOT (AND p2 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 p2), (AND p0 p2), p0]
Finished random walk after 2642 steps, including 14 resets, run visited all 2 properties in 10 ms. (steps per millisecond=264 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p2 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND p0 p2), (AND p0 p2), p0]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 p2), (AND p0 p2), p0]
Stuttering acceptance computed with spot in 64 ms :[(AND p0 p2), (AND p0 p2), p0]
Product exploration explored 100000 steps with 33204 reset in 706 ms.
Product exploration explored 100000 steps with 33279 reset in 979 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p2), (AND p0 p2), p0]
Support contains 3 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1422 transition count 2128
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 279 place count 1422 transition count 2161
Deduced a syphon composed of 381 places in 2 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 381 place count 1422 transition count 2161
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 387 place count 1419 transition count 2161
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 426 place count 1380 transition count 2122
Deduced a syphon composed of 347 places in 2 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 465 place count 1380 transition count 2122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 465 place count 1380 transition count 2122
Deduced a syphon composed of 348 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 466 place count 1380 transition count 2122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 467 place count 1379 transition count 2121
Deduced a syphon composed of 347 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 468 place count 1379 transition count 2121
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 527 places in 3 ms
Iterating global reduction 2 with 180 rules applied. Total rules applied 648 place count 1379 transition count 2145
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 742 place count 1285 transition count 2051
Deduced a syphon composed of 433 places in 2 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 836 place count 1285 transition count 2051
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 441 places in 2 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 844 place count 1285 transition count 2095
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 442 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 845 place count 1285 transition count 2099
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 847 place count 1283 transition count 2093
Deduced a syphon composed of 440 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 849 place count 1283 transition count 2093
Deduced a syphon composed of 440 places in 3 ms
Applied a total of 849 rules in 731 ms. Remains 1283 /1422 variables (removed 139) and now considering 2093/2128 (removed 35) transitions.
[2022-05-15 21:41:25] [INFO ] Redundant transitions in 204 ms returned []
// Phase 1: matrix 2093 rows 1283 cols
[2022-05-15 21:41:25] [INFO ] Computed 189 place invariants in 23 ms
[2022-05-15 21:41:26] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1283/1422 places, 2093/2128 transitions.
Finished structural reductions, in 1 iterations. Remains : 1283/1422 places, 2093/2128 transitions.
Product exploration explored 100000 steps with 33292 reset in 4998 ms.
Product exploration explored 100000 steps with 33237 reset in 3897 ms.
Built C files in :
/tmp/ltsmin16669462136663378104
[2022-05-15 21:41:35] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16669462136663378104
Running compilation step : cd /tmp/ltsmin16669462136663378104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16669462136663378104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16669462136663378104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 86 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:41:38] [INFO ] Computed 192 place invariants in 12 ms
[2022-05-15 21:41:39] [INFO ] Implicit Places using invariants in 964 ms returned []
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:41:39] [INFO ] Computed 192 place invariants in 12 ms
[2022-05-15 21:41:41] [INFO ] Implicit Places using invariants and state equation in 2330 ms returned []
Implicit Place search using SMT with State Equation took 3298 ms to find 0 implicit places.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:41:41] [INFO ] Computed 192 place invariants in 21 ms
[2022-05-15 21:41:42] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1422/1422 places, 2128/2128 transitions.
Built C files in :
/tmp/ltsmin5033344447134355986
[2022-05-15 21:41:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5033344447134355986
Running compilation step : cd /tmp/ltsmin5033344447134355986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5033344447134355986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5033344447134355986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:41:46] [INFO ] Flatten gal took : 102 ms
[2022-05-15 21:41:46] [INFO ] Flatten gal took : 94 ms
[2022-05-15 21:41:46] [INFO ] Time to serialize gal into /tmp/LTL1131408937933823692.gal : 29 ms
[2022-05-15 21:41:46] [INFO ] Time to serialize properties into /tmp/LTL16316307473046405821.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1131408937933823692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16316307473046405821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1131408...267
Read 1 LTL properties
Checking formula 0 : !((G(!(("((p602==0)||(p1383==1))")U(("(p455==1)")U((G("((p602==0)||(p1383==1))"))&&(X("((p455==1)&&((p602==0)||(p1383==1)))"))))))))
Formula 0 simplified : !G!("((p602==0)||(p1383==1))" U ("(p455==1)" U (G"((p602==0)||(p1383==1))" & X"((p455==1)&&((p602==0)||(p1383==1)))")))
Detected timeout of ITS tools.
[2022-05-15 21:42:01] [INFO ] Flatten gal took : 111 ms
[2022-05-15 21:42:01] [INFO ] Applying decomposition
[2022-05-15 21:42:01] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5900782770905951756.txt' '-o' '/tmp/graph5900782770905951756.bin' '-w' '/tmp/graph5900782770905951756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5900782770905951756.bin' '-l' '-1' '-v' '-w' '/tmp/graph5900782770905951756.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:42:01] [INFO ] Decomposing Gal with order
[2022-05-15 21:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:42:02] [INFO ] Removed a total of 2840 redundant transitions.
[2022-05-15 21:42:02] [INFO ] Flatten gal took : 210 ms
[2022-05-15 21:42:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 46 ms.
[2022-05-15 21:42:02] [INFO ] Time to serialize gal into /tmp/LTL8758880038070653333.gal : 23 ms
[2022-05-15 21:42:02] [INFO ] Time to serialize properties into /tmp/LTL8697522685002733495.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8758880038070653333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8697522685002733495.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8758880...245
Read 1 LTL properties
Checking formula 0 : !((G(!(("((i5.i0.u169.p602==0)||(i17.i1.u383.p1383==1))")U(("(i5.i0.u169.p455==1)")U((G("((i5.i0.u169.p602==0)||(i17.i1.u383.p1383==1)...244
Formula 0 simplified : !G!("((i5.i0.u169.p602==0)||(i17.i1.u383.p1383==1))" U ("(i5.i0.u169.p455==1)" U (G"((i5.i0.u169.p602==0)||(i17.i1.u383.p1383==1))" ...233
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11226805844736327789
[2022-05-15 21:42:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11226805844736327789
Running compilation step : cd /tmp/ltsmin11226805844736327789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11226805844736327789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11226805844736327789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ASLink-PT-07a-LTLCardinality-00 finished in 66669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(p0)))||G(p1))))'
Support contains 4 out of 1425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1423 transition count 2128
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1423 transition count 2128
Applied a total of 3 rules in 96 ms. Remains 1423 /1425 variables (removed 2) and now considering 2128/2136 (removed 8) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2022-05-15 21:42:20] [INFO ] Computed 193 place invariants in 43 ms
[2022-05-15 21:42:21] [INFO ] Implicit Places using invariants in 879 ms returned [606]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 885 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1425 places, 2128/2136 transitions.
Applied a total of 0 rules in 36 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1422/1425 places, 2128/2136 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (EQ s130 0) (EQ s208 1)), p1:(OR (EQ s65 0) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 804 ms.
Product exploration explored 100000 steps with 25000 reset in 667 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:42:23] [INFO ] Computed 192 place invariants in 12 ms
[2022-05-15 21:42:23] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:42:23] [INFO ] [Nat]Absence check using 44 positive place invariants in 23 ms returned sat
[2022-05-15 21:42:23] [INFO ] [Nat]Absence check using 44 positive and 148 generalized place invariants in 50 ms returned sat
[2022-05-15 21:42:23] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ASLink-PT-07a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-07a-LTLCardinality-01 finished in 3457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 1425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1423 transition count 2128
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1423 transition count 2128
Applied a total of 3 rules in 74 ms. Remains 1423 /1425 variables (removed 2) and now considering 2128/2136 (removed 8) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2022-05-15 21:42:23] [INFO ] Computed 193 place invariants in 35 ms
[2022-05-15 21:42:24] [INFO ] Implicit Places using invariants in 593 ms returned [606]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 594 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1425 places, 2128/2136 transitions.
Applied a total of 0 rules in 39 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1422/1425 places, 2128/2136 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-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=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s529 0) (EQ s5 1)), p0:(OR (EQ s887 0) (EQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1012 ms.
Product exploration explored 100000 steps with 50000 reset in 976 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 p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ASLink-PT-07a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-07a-LTLCardinality-03 finished in 2914 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)&&(F(X(p2))||p3)&&p0))))'
Support contains 6 out of 1425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1425 transition count 1861
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 550 place count 1150 transition count 1861
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 190 Pre rules applied. Total rules applied 550 place count 1150 transition count 1671
Deduced a syphon composed of 190 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 441 rules applied. Total rules applied 991 place count 899 transition count 1671
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1011 place count 888 transition count 1662
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1020 place count 879 transition count 1662
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1020 place count 879 transition count 1634
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1076 place count 851 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1081 place count 846 transition count 1629
Iterating global reduction 4 with 5 rules applied. Total rules applied 1086 place count 846 transition count 1629
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 4 with 4 rules applied. Total rules applied 1090 place count 846 transition count 1625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1091 place count 845 transition count 1625
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1091 place count 845 transition count 1624
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1093 place count 844 transition count 1624
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 1247 place count 767 transition count 1547
Applied a total of 1247 rules in 159 ms. Remains 767 /1425 variables (removed 658) and now considering 1547/2136 (removed 589) transitions.
// Phase 1: matrix 1547 rows 767 cols
[2022-05-15 21:42:26] [INFO ] Computed 122 place invariants in 9 ms
[2022-05-15 21:42:27] [INFO ] Implicit Places using invariants in 515 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 284, 290, 295, 311, 383, 389, 394, 413, 483, 489, 494, 510, 580, 586, 591, 607, 677, 683, 688, 707, 764]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 522 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 738/1425 places, 1547/2136 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 738 transition count 1545
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 736 transition count 1545
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 4 place count 736 transition count 1531
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 722 transition count 1531
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 721 transition count 1531
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 47 place count 707 transition count 1517
Iterating global reduction 3 with 14 rules applied. Total rules applied 61 place count 707 transition count 1517
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 75 place count 693 transition count 1503
Iterating global reduction 3 with 14 rules applied. Total rules applied 89 place count 693 transition count 1503
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 96 place count 686 transition count 1496
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 686 transition count 1496
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 131 place count 672 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 671 transition count 1481
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 671 transition count 1481
Applied a total of 133 rules in 117 ms. Remains 671 /738 variables (removed 67) and now considering 1481/1547 (removed 66) transitions.
// Phase 1: matrix 1481 rows 671 cols
[2022-05-15 21:42:27] [INFO ] Computed 92 place invariants in 25 ms
[2022-05-15 21:42:27] [INFO ] Implicit Places using invariants in 415 ms returned [93, 96, 177, 180, 261, 264, 325, 348, 431, 434, 515, 518, 599, 602]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 418 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 657/1425 places, 1481/2136 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 657 transition count 1475
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 651 transition count 1475
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 645 transition count 1469
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 645 transition count 1469
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 645 transition count 1463
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 3 with 2 rules applied. Total rules applied 32 place count 644 transition count 1462
Applied a total of 32 rules in 55 ms. Remains 644 /657 variables (removed 13) and now considering 1462/1481 (removed 19) transitions.
// Phase 1: matrix 1462 rows 644 cols
[2022-05-15 21:42:28] [INFO ] Computed 78 place invariants in 16 ms
[2022-05-15 21:42:28] [INFO ] Implicit Places using invariants in 362 ms returned [72, 151, 231, 395, 475, 555]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 363 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 638/1425 places, 1462/2136 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 632 transition count 1456
Applied a total of 12 rules in 37 ms. Remains 632 /638 variables (removed 6) and now considering 1456/1462 (removed 6) transitions.
// Phase 1: matrix 1456 rows 632 cols
[2022-05-15 21:42:28] [INFO ] Computed 72 place invariants in 9 ms
[2022-05-15 21:42:28] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 1456 rows 632 cols
[2022-05-15 21:42:28] [INFO ] Computed 72 place invariants in 9 ms
[2022-05-15 21:42:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 21:42:29] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 632/1425 places, 1456/2136 transitions.
Finished structural reductions, in 4 iterations. Remains : 632/1425 places, 1456/2136 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s180 0) (EQ s503 1)), p1:(AND (EQ s180 0) (EQ s503 1)), p3:(AND (EQ s12 0) (EQ s592 1)), p2:(AND (EQ s330 0) (EQ s288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-07a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-12 finished in 3264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(p0) U (X(!p2)||p1))))'
Support contains 4 out of 1425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1423 transition count 2128
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1423 transition count 2128
Applied a total of 3 rules in 104 ms. Remains 1423 /1425 variables (removed 2) and now considering 2128/2136 (removed 8) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2022-05-15 21:42:30] [INFO ] Computed 193 place invariants in 12 ms
[2022-05-15 21:42:30] [INFO ] Implicit Places using invariants in 518 ms returned [606]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1425 places, 2128/2136 transitions.
Applied a total of 0 rules in 38 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1422/1425 places, 2128/2136 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) p1), (AND p1 p0 p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s811 0) (EQ s534 1)), p0:(OR (EQ s811 0) (EQ s534 1)), p2:(OR (EQ s401 0) (EQ s447 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-13 finished in 807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1423 transition count 2128
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1423 transition count 2128
Applied a total of 3 rules in 82 ms. Remains 1423 /1425 variables (removed 2) and now considering 2128/2136 (removed 8) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2022-05-15 21:42:30] [INFO ] Computed 193 place invariants in 13 ms
[2022-05-15 21:42:31] [INFO ] Implicit Places using invariants in 526 ms returned [606]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 528 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1425 places, 2128/2136 transitions.
Applied a total of 0 rules in 39 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1422/1425 places, 2128/2136 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s245 0) (EQ s6 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][false, false, false]]
Product exploration explored 100000 steps with 491 reset in 320 ms.
Product exploration explored 100000 steps with 509 reset in 431 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 54 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 260250 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260250 steps, saw 89065 distinct states, run finished after 3006 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:42:35] [INFO ] Computed 192 place invariants in 17 ms
[2022-05-15 21:42:35] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:42:35] [INFO ] [Nat]Absence check using 44 positive place invariants in 17 ms returned sat
[2022-05-15 21:42:36] [INFO ] [Nat]Absence check using 44 positive and 148 generalized place invariants in 44 ms returned sat
[2022-05-15 21:42:39] [INFO ] After 3322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:42:41] [INFO ] Deduced a trap composed of 107 places in 218 ms of which 6 ms to minimize.
[2022-05-15 21:42:41] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 1 ms to minimize.
[2022-05-15 21:42:42] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 2 ms to minimize.
[2022-05-15 21:42:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1057 ms
[2022-05-15 21:42:42] [INFO ] After 6396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5950 ms.
[2022-05-15 21:42:48] [INFO ] After 12600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1422 transition count 1847
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 1141 transition count 1847
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 190 Pre rules applied. Total rules applied 562 place count 1141 transition count 1657
Deduced a syphon composed of 190 places in 3 ms
Ensure Unique test removed 61 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 441 rules applied. Total rules applied 1003 place count 890 transition count 1657
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1023 place count 879 transition count 1648
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1032 place count 870 transition count 1648
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1032 place count 870 transition count 1620
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1088 place count 842 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1093 place count 837 transition count 1615
Iterating global reduction 4 with 5 rules applied. Total rules applied 1098 place count 837 transition count 1615
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 4 with 4 rules applied. Total rules applied 1102 place count 837 transition count 1611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1103 place count 836 transition count 1611
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1103 place count 836 transition count 1610
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1105 place count 835 transition count 1610
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 1261 place count 757 transition count 1532
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1268 place count 757 transition count 1525
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1275 place count 750 transition count 1525
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1303 place count 750 transition count 1497
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1332 place count 721 transition count 1497
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1339 place count 721 transition count 1490
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1361 place count 721 transition count 1490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1362 place count 720 transition count 1489
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1369 place count 713 transition count 1489
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1369 place count 713 transition count 1475
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1404 place count 692 transition count 1475
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1411 place count 685 transition count 1468
Iterating global reduction 9 with 7 rules applied. Total rules applied 1418 place count 685 transition count 1468
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1425 place count 685 transition count 1461
Applied a total of 1425 rules in 352 ms. Remains 685 /1422 variables (removed 737) and now considering 1461/2128 (removed 667) transitions.
Finished structural reductions, in 1 iterations. Remains : 685/1422 places, 1461/2128 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3583 steps, run visited all 1 properties in 15 ms. (steps per millisecond=238 )
Probabilistic random walk after 3583 steps, saw 3441 distinct states, run finished after 16 ms. (steps per millisecond=223 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 72 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:42:49] [INFO ] Computed 192 place invariants in 32 ms
[2022-05-15 21:42:49] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:42:49] [INFO ] Computed 192 place invariants in 17 ms
[2022-05-15 21:42:52] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 3478 ms to find 0 implicit places.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:42:52] [INFO ] Computed 192 place invariants in 29 ms
[2022-05-15 21:42:53] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1422/1422 places, 2128/2128 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 341693 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341693 steps, saw 110840 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:42:56] [INFO ] Computed 192 place invariants in 31 ms
[2022-05-15 21:42:56] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:42:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2022-05-15 21:42:57] [INFO ] [Nat]Absence check using 44 positive and 148 generalized place invariants in 36 ms returned sat
[2022-05-15 21:43:00] [INFO ] After 3404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:43:03] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 1 ms to minimize.
[2022-05-15 21:43:03] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 0 ms to minimize.
[2022-05-15 21:43:03] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 1 ms to minimize.
[2022-05-15 21:43:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1132 ms
[2022-05-15 21:43:03] [INFO ] After 6717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6338 ms.
[2022-05-15 21:43:10] [INFO ] After 13290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1422 transition count 1847
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 1141 transition count 1847
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 190 Pre rules applied. Total rules applied 562 place count 1141 transition count 1657
Deduced a syphon composed of 190 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 441 rules applied. Total rules applied 1003 place count 890 transition count 1657
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1023 place count 879 transition count 1648
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1032 place count 870 transition count 1648
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1032 place count 870 transition count 1620
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1088 place count 842 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1093 place count 837 transition count 1615
Iterating global reduction 4 with 5 rules applied. Total rules applied 1098 place count 837 transition count 1615
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 4 with 4 rules applied. Total rules applied 1102 place count 837 transition count 1611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1103 place count 836 transition count 1611
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1103 place count 836 transition count 1610
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1105 place count 835 transition count 1610
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 1261 place count 757 transition count 1532
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1268 place count 757 transition count 1525
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1275 place count 750 transition count 1525
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1303 place count 750 transition count 1497
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1332 place count 721 transition count 1497
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1339 place count 721 transition count 1490
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1361 place count 721 transition count 1490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1362 place count 720 transition count 1489
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1369 place count 713 transition count 1489
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1369 place count 713 transition count 1475
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1404 place count 692 transition count 1475
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1411 place count 685 transition count 1468
Iterating global reduction 9 with 7 rules applied. Total rules applied 1418 place count 685 transition count 1468
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1425 place count 685 transition count 1461
Applied a total of 1425 rules in 270 ms. Remains 685 /1422 variables (removed 737) and now considering 1461/2128 (removed 667) transitions.
Finished structural reductions, in 1 iterations. Remains : 685/1422 places, 1461/2128 transitions.
Incomplete random walk after 10000 steps, including 159 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 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3583 steps, run visited all 1 properties in 13 ms. (steps per millisecond=275 )
Probabilistic random walk after 3583 steps, saw 3441 distinct states, run finished after 13 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 522 reset in 304 ms.
Product exploration explored 100000 steps with 514 reset in 334 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1422 transition count 2128
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 280 place count 1422 transition count 2161
Deduced a syphon composed of 382 places in 3 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 382 place count 1422 transition count 2161
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 388 place count 1419 transition count 2161
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 427 place count 1380 transition count 2122
Deduced a syphon composed of 348 places in 3 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 466 place count 1380 transition count 2122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 466 place count 1380 transition count 2122
Deduced a syphon composed of 349 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 467 place count 1380 transition count 2122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 468 place count 1379 transition count 2121
Deduced a syphon composed of 348 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 469 place count 1379 transition count 2121
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 528 places in 3 ms
Iterating global reduction 2 with 180 rules applied. Total rules applied 649 place count 1379 transition count 2145
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 743 place count 1285 transition count 2051
Deduced a syphon composed of 434 places in 3 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 837 place count 1285 transition count 2051
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 442 places in 3 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 845 place count 1285 transition count 2095
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 443 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 846 place count 1285 transition count 2099
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 848 place count 1283 transition count 2093
Deduced a syphon composed of 441 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 850 place count 1283 transition count 2093
Deduced a syphon composed of 441 places in 3 ms
Applied a total of 850 rules in 422 ms. Remains 1283 /1422 variables (removed 139) and now considering 2093/2128 (removed 35) transitions.
[2022-05-15 21:43:12] [INFO ] Redundant transitions in 229 ms returned []
// Phase 1: matrix 2093 rows 1283 cols
[2022-05-15 21:43:12] [INFO ] Computed 189 place invariants in 29 ms
[2022-05-15 21:43:13] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1283/1422 places, 2093/2128 transitions.
Finished structural reductions, in 1 iterations. Remains : 1283/1422 places, 2093/2128 transitions.
Product exploration explored 100000 steps with 1107 reset in 420 ms.
Product exploration explored 100000 steps with 1079 reset in 431 ms.
Built C files in :
/tmp/ltsmin319764122190136687
[2022-05-15 21:43:14] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin319764122190136687
Running compilation step : cd /tmp/ltsmin319764122190136687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin319764122190136687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin319764122190136687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 40 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:43:17] [INFO ] Computed 192 place invariants in 20 ms
[2022-05-15 21:43:17] [INFO ] Implicit Places using invariants in 642 ms returned []
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:43:17] [INFO ] Computed 192 place invariants in 17 ms
[2022-05-15 21:43:20] [INFO ] Implicit Places using invariants and state equation in 2818 ms returned []
Implicit Place search using SMT with State Equation took 3476 ms to find 0 implicit places.
// Phase 1: matrix 2128 rows 1422 cols
[2022-05-15 21:43:20] [INFO ] Computed 192 place invariants in 13 ms
[2022-05-15 21:43:21] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1422/1422 places, 2128/2128 transitions.
Built C files in :
/tmp/ltsmin16040068873297715212
[2022-05-15 21:43:21] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16040068873297715212
Running compilation step : cd /tmp/ltsmin16040068873297715212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16040068873297715212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16040068873297715212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:43:24] [INFO ] Flatten gal took : 89 ms
[2022-05-15 21:43:24] [INFO ] Flatten gal took : 85 ms
[2022-05-15 21:43:24] [INFO ] Time to serialize gal into /tmp/LTL7650911831893944335.gal : 8 ms
[2022-05-15 21:43:24] [INFO ] Time to serialize properties into /tmp/LTL4380635349736722936.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7650911831893944335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4380635349736722936.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7650911...266
Read 1 LTL properties
Checking formula 0 : !((X(G("((p268==0)||(p7==1))"))))
Formula 0 simplified : !XG"((p268==0)||(p7==1))"
Detected timeout of ITS tools.
[2022-05-15 21:43:40] [INFO ] Flatten gal took : 58 ms
[2022-05-15 21:43:40] [INFO ] Applying decomposition
[2022-05-15 21:43:40] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14865342604061595275.txt' '-o' '/tmp/graph14865342604061595275.bin' '-w' '/tmp/graph14865342604061595275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14865342604061595275.bin' '-l' '-1' '-v' '-w' '/tmp/graph14865342604061595275.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:43:40] [INFO ] Decomposing Gal with order
[2022-05-15 21:43:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:43:40] [INFO ] Removed a total of 2882 redundant transitions.
[2022-05-15 21:43:40] [INFO ] Flatten gal took : 170 ms
[2022-05-15 21:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 36 ms.
[2022-05-15 21:43:40] [INFO ] Time to serialize gal into /tmp/LTL6142767883868097573.gal : 21 ms
[2022-05-15 21:43:40] [INFO ] Time to serialize properties into /tmp/LTL4194001066206470985.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6142767883868097573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4194001066206470985.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6142767...245
Read 1 LTL properties
Checking formula 0 : !((X(G("((i2.i0.u75.p268==0)||(i0.i0.u2.p7==1))"))))
Formula 0 simplified : !XG"((i2.i0.u75.p268==0)||(i0.i0.u2.p7==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin612213526486458449
[2022-05-15 21:43:55] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin612213526486458449
Running compilation step : cd /tmp/ltsmin612213526486458449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin612213526486458449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin612213526486458449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ASLink-PT-07a-LTLCardinality-14 finished in 87999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(p0 U (p1 U (G(p0)&&X(p2))))))'
Found a SL insensitive property : ASLink-PT-07a-LTLCardinality-00
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p2), (AND p0 p2), p0]
Support contains 3 out of 1425 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1423 transition count 1856
Reduce places removed 286 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 293 rules applied. Total rules applied 573 place count 1137 transition count 1849
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 581 place count 1130 transition count 1848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 582 place count 1129 transition count 1848
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 204 Pre rules applied. Total rules applied 582 place count 1129 transition count 1644
Deduced a syphon composed of 204 places in 1 ms
Ensure Unique test removed 61 places
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 4 with 469 rules applied. Total rules applied 1051 place count 864 transition count 1644
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 40 rules applied. Total rules applied 1091 place count 845 transition count 1623
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1112 place count 824 transition count 1623
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1112 place count 824 transition count 1594
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1170 place count 795 transition count 1594
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1182 place count 783 transition count 1575
Iterating global reduction 6 with 12 rules applied. Total rules applied 1194 place count 783 transition count 1575
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 6 with 10 rules applied. Total rules applied 1204 place count 783 transition count 1565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1205 place count 782 transition count 1565
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1205 place count 782 transition count 1564
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 1207 place count 781 transition count 1564
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 8 with 142 rules applied. Total rules applied 1349 place count 710 transition count 1493
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1350 place count 709 transition count 1492
Iterating global reduction 8 with 1 rules applied. Total rules applied 1351 place count 709 transition count 1492
Applied a total of 1351 rules in 285 ms. Remains 709 /1425 variables (removed 716) and now considering 1492/2136 (removed 644) transitions.
// Phase 1: matrix 1492 rows 709 cols
[2022-05-15 21:43:59] [INFO ] Computed 106 place invariants in 12 ms
[2022-05-15 21:43:59] [INFO ] Implicit Places using invariants in 414 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 323, 341, 359, 365, 370, 373, 433, 450, 456, 461, 463, 523, 540, 546, 551, 553, 613, 630, 636, 641, 643, 706]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 415 ms to find 36 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 673/1425 places, 1492/2136 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 673 transition count 1490
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 671 transition count 1489
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 19 place count 657 transition count 1475
Iterating global reduction 2 with 14 rules applied. Total rules applied 33 place count 657 transition count 1475
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 47 place count 643 transition count 1461
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 643 transition count 1461
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 636 transition count 1454
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 636 transition count 1454
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 105 place count 621 transition count 1439
Applied a total of 105 rules in 78 ms. Remains 621 /673 variables (removed 52) and now considering 1439/1492 (removed 53) transitions.
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:43:59] [INFO ] Computed 70 place invariants in 8 ms
[2022-05-15 21:44:00] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:00] [INFO ] Computed 70 place invariants in 8 ms
[2022-05-15 21:44:00] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 621/1425 places, 1439/2136 transitions.
Finished structural reductions, in 2 iterations. Remains : 621/1425 places, 1439/2136 transitions.
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s248 0) (EQ s562 1)), p2:(AND (EQ s203 1) (OR (EQ s248 0) (EQ s562 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33323 reset in 637 ms.
Product exploration explored 100000 steps with 33452 reset in 570 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 p0 (NOT p2)), (X (NOT (AND p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND p0 p2), (AND p0 p2), p0]
Finished random walk after 3776 steps, including 46 resets, run visited all 2 properties in 15 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND p0 p2), (AND p0 p2), p0]
Stuttering acceptance computed with spot in 114 ms :[(AND p0 p2), (AND p0 p2), p0]
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 24 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:02] [INFO ] Computed 70 place invariants in 19 ms
[2022-05-15 21:44:03] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:03] [INFO ] Computed 70 place invariants in 12 ms
[2022-05-15 21:44:04] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:04] [INFO ] Computed 70 place invariants in 13 ms
[2022-05-15 21:44:04] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 621/621 places, 1439/1439 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p2 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND p0 p2), (AND p0 p2), p0]
Finished random walk after 3260 steps, including 48 resets, run visited all 2 properties in 11 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p2 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND p0 p2), (AND p0 p2), p0]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p2), (AND p0 p2), p0]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p2), (AND p0 p2), p0]
Product exploration explored 100000 steps with 33170 reset in 410 ms.
Product exploration explored 100000 steps with 33262 reset in 529 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 132 ms :[(AND p0 p2), (AND p0 p2), p0]
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 29 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
[2022-05-15 21:44:06] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:06] [INFO ] Computed 70 place invariants in 20 ms
[2022-05-15 21:44:07] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 621/621 places, 1439/1439 transitions.
Product exploration explored 100000 steps with 33366 reset in 2294 ms.
Product exploration explored 100000 steps with 33307 reset in 2473 ms.
Built C files in :
/tmp/ltsmin11774586763060061713
[2022-05-15 21:44:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11774586763060061713
Running compilation step : cd /tmp/ltsmin11774586763060061713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2425 ms.
Running link step : cd /tmp/ltsmin11774586763060061713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11774586763060061713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4424784189751978010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 11 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:27] [INFO ] Computed 70 place invariants in 20 ms
[2022-05-15 21:44:27] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:27] [INFO ] Computed 70 place invariants in 9 ms
[2022-05-15 21:44:28] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
// Phase 1: matrix 1439 rows 621 cols
[2022-05-15 21:44:28] [INFO ] Computed 70 place invariants in 9 ms
[2022-05-15 21:44:28] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 621/621 places, 1439/1439 transitions.
Built C files in :
/tmp/ltsmin1802007032006839845
[2022-05-15 21:44:28] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1802007032006839845
Running compilation step : cd /tmp/ltsmin1802007032006839845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2453 ms.
Running link step : cd /tmp/ltsmin1802007032006839845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1802007032006839845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5467351912640338900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 21:44:43] [INFO ] Flatten gal took : 39 ms
[2022-05-15 21:44:43] [INFO ] Flatten gal took : 39 ms
[2022-05-15 21:44:43] [INFO ] Time to serialize gal into /tmp/LTL13583047550674395383.gal : 4 ms
[2022-05-15 21:44:43] [INFO ] Time to serialize properties into /tmp/LTL7857210216099680973.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13583047550674395383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7857210216099680973.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1358304...267
Read 1 LTL properties
Checking formula 0 : !((G(!(("((p602==0)||(p1383==1))")U(("(p455==1)")U((G("((p602==0)||(p1383==1))"))&&(X("((p455==1)&&((p602==0)||(p1383==1)))"))))))))
Formula 0 simplified : !G!("((p602==0)||(p1383==1))" U ("(p455==1)" U (G"((p602==0)||(p1383==1))" & X"((p455==1)&&((p602==0)||(p1383==1)))")))
Detected timeout of ITS tools.
[2022-05-15 21:44:58] [INFO ] Flatten gal took : 75 ms
[2022-05-15 21:44:58] [INFO ] Applying decomposition
[2022-05-15 21:44:59] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4777431934281521279.txt' '-o' '/tmp/graph4777431934281521279.bin' '-w' '/tmp/graph4777431934281521279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4777431934281521279.bin' '-l' '-1' '-v' '-w' '/tmp/graph4777431934281521279.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:44:59] [INFO ] Decomposing Gal with order
[2022-05-15 21:44:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:44:59] [INFO ] Removed a total of 2880 redundant transitions.
[2022-05-15 21:44:59] [INFO ] Flatten gal took : 78 ms
[2022-05-15 21:44:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 10 ms.
[2022-05-15 21:44:59] [INFO ] Time to serialize gal into /tmp/LTL17000567636750889695.gal : 7 ms
[2022-05-15 21:44:59] [INFO ] Time to serialize properties into /tmp/LTL3476238197097414916.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17000567636750889695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3476238197097414916.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1700056...246
Read 1 LTL properties
Checking formula 0 : !((G(!(("((i5.u63.p602==0)||(i14.u138.p1383==1))")U(("(i5.u63.p455==1)")U((G("((i5.u63.p602==0)||(i14.u138.p1383==1))"))&&(X("((i5.u63...215
Formula 0 simplified : !G!("((i5.u63.p602==0)||(i14.u138.p1383==1))" U ("(i5.u63.p455==1)" U (G"((i5.u63.p602==0)||(i14.u138.p1383==1))" & X"((i5.u63.p455=...204
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13090555607347187516
[2022-05-15 21:45:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13090555607347187516
Running compilation step : cd /tmp/ltsmin13090555607347187516;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2329 ms.
Running link step : cd /tmp/ltsmin13090555607347187516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin13090555607347187516;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!((LTLAPp0==true) U ((LTLAPp1==true) U ([]((LTLAPp0==true))&&X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-07a-LTLCardinality-00 finished in 90624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : ASLink-PT-07a-LTLCardinality-14
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1425 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1425/1425 places, 2136/2136 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1423 transition count 1854
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 295 rules applied. Total rules applied 577 place count 1135 transition count 1847
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 584 place count 1128 transition count 1847
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 584 place count 1128 transition count 1643
Deduced a syphon composed of 204 places in 1 ms
Ensure Unique test removed 61 places
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 3 with 469 rules applied. Total rules applied 1053 place count 863 transition count 1643
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 40 rules applied. Total rules applied 1093 place count 844 transition count 1622
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1114 place count 823 transition count 1622
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1114 place count 823 transition count 1593
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1172 place count 794 transition count 1593
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1184 place count 782 transition count 1574
Iterating global reduction 5 with 12 rules applied. Total rules applied 1196 place count 782 transition count 1574
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 10 rules applied. Total rules applied 1206 place count 782 transition count 1564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1207 place count 781 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1207 place count 781 transition count 1563
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 1209 place count 780 transition count 1563
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 1351 place count 709 transition count 1492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1352 place count 708 transition count 1491
Iterating global reduction 7 with 1 rules applied. Total rules applied 1353 place count 708 transition count 1491
Applied a total of 1353 rules in 139 ms. Remains 708 /1425 variables (removed 717) and now considering 1491/2136 (removed 645) transitions.
// Phase 1: matrix 1491 rows 708 cols
[2022-05-15 21:45:29] [INFO ] Computed 106 place invariants in 17 ms
[2022-05-15 21:45:30] [INFO ] Implicit Places using invariants in 360 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 322, 340, 358, 364, 369, 372, 432, 449, 455, 460, 462, 522, 539, 545, 550, 552, 612, 629, 635, 640, 642, 705]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 362 ms to find 36 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 672/1425 places, 1491/2136 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1489
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 670 transition count 1488
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 19 place count 656 transition count 1474
Iterating global reduction 2 with 14 rules applied. Total rules applied 33 place count 656 transition count 1474
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 47 place count 642 transition count 1460
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 642 transition count 1460
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 635 transition count 1453
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 635 transition count 1453
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 105 place count 620 transition count 1438
Applied a total of 105 rules in 79 ms. Remains 620 /672 variables (removed 52) and now considering 1438/1491 (removed 53) transitions.
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:30] [INFO ] Computed 70 place invariants in 10 ms
[2022-05-15 21:45:30] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:30] [INFO ] Computed 70 place invariants in 8 ms
[2022-05-15 21:45:31] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 620/1425 places, 1438/2136 transitions.
Finished structural reductions, in 2 iterations. Remains : 620/1425 places, 1438/2136 transitions.
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s131 0) (EQ s5 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1296 reset in 211 ms.
Product exploration explored 100000 steps with 1309 reset in 296 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 140 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5044 steps, run visited all 1 properties in 19 ms. (steps per millisecond=265 )
Probabilistic random walk after 5044 steps, saw 4853 distinct states, run finished after 19 ms. (steps per millisecond=265 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1438/1438 transitions.
Applied a total of 0 rules in 22 ms. Remains 620 /620 variables (removed 0) and now considering 1438/1438 (removed 0) transitions.
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:32] [INFO ] Computed 70 place invariants in 11 ms
[2022-05-15 21:45:33] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:33] [INFO ] Computed 70 place invariants in 10 ms
[2022-05-15 21:45:34] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:34] [INFO ] Computed 70 place invariants in 8 ms
[2022-05-15 21:45:34] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/620 places, 1438/1438 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5044 steps, run visited all 1 properties in 15 ms. (steps per millisecond=336 )
Probabilistic random walk after 5044 steps, saw 4853 distinct states, run finished after 15 ms. (steps per millisecond=336 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1301 reset in 202 ms.
Product exploration explored 100000 steps with 1328 reset in 227 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1438/1438 transitions.
Applied a total of 0 rules in 20 ms. Remains 620 /620 variables (removed 0) and now considering 1438/1438 (removed 0) transitions.
[2022-05-15 21:45:35] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:35] [INFO ] Computed 70 place invariants in 10 ms
[2022-05-15 21:45:36] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/620 places, 1438/1438 transitions.
Product exploration explored 100000 steps with 1229 reset in 315 ms.
Product exploration explored 100000 steps with 1313 reset in 299 ms.
Built C files in :
/tmp/ltsmin16406056459732563107
[2022-05-15 21:45:37] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16406056459732563107
Running compilation step : cd /tmp/ltsmin16406056459732563107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2221 ms.
Running link step : cd /tmp/ltsmin16406056459732563107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin16406056459732563107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased491379790281535954.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1438/1438 transitions.
Applied a total of 0 rules in 12 ms. Remains 620 /620 variables (removed 0) and now considering 1438/1438 (removed 0) transitions.
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:52] [INFO ] Computed 70 place invariants in 10 ms
[2022-05-15 21:45:52] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:52] [INFO ] Computed 70 place invariants in 12 ms
[2022-05-15 21:45:53] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
// Phase 1: matrix 1438 rows 620 cols
[2022-05-15 21:45:53] [INFO ] Computed 70 place invariants in 8 ms
[2022-05-15 21:45:54] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/620 places, 1438/1438 transitions.
Built C files in :
/tmp/ltsmin9915288771889116405
[2022-05-15 21:45:54] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9915288771889116405
Running compilation step : cd /tmp/ltsmin9915288771889116405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2238 ms.
Running link step : cd /tmp/ltsmin9915288771889116405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin9915288771889116405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1391112623853553117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 21:46:09] [INFO ] Flatten gal took : 37 ms
[2022-05-15 21:46:09] [INFO ] Flatten gal took : 37 ms
[2022-05-15 21:46:09] [INFO ] Time to serialize gal into /tmp/LTL759054372813171900.gal : 4 ms
[2022-05-15 21:46:09] [INFO ] Time to serialize properties into /tmp/LTL15237341385399450256.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL759054372813171900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15237341385399450256.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7590543...266
Read 1 LTL properties
Checking formula 0 : !((X(G("((p268==0)||(p7==1))"))))
Formula 0 simplified : !XG"((p268==0)||(p7==1))"
Detected timeout of ITS tools.
[2022-05-15 21:46:24] [INFO ] Flatten gal took : 85 ms
[2022-05-15 21:46:24] [INFO ] Applying decomposition
[2022-05-15 21:46:24] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18357803290231748110.txt' '-o' '/tmp/graph18357803290231748110.bin' '-w' '/tmp/graph18357803290231748110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18357803290231748110.bin' '-l' '-1' '-v' '-w' '/tmp/graph18357803290231748110.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:46:24] [INFO ] Decomposing Gal with order
[2022-05-15 21:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:46:24] [INFO ] Removed a total of 2848 redundant transitions.
[2022-05-15 21:46:24] [INFO ] Flatten gal took : 99 ms
[2022-05-15 21:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 12 ms.
[2022-05-15 21:46:24] [INFO ] Time to serialize gal into /tmp/LTL7865848372712832312.gal : 7 ms
[2022-05-15 21:46:24] [INFO ] Time to serialize properties into /tmp/LTL2171546303733518508.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7865848372712832312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2171546303733518508.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7865848...245
Read 1 LTL properties
Checking formula 0 : !((X(G("((i0.u34.p268==0)||(i1.u2.p7==1))"))))
Formula 0 simplified : !XG"((i0.u34.p268==0)||(i1.u2.p7==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2121043542802090341
[2022-05-15 21:46:39] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2121043542802090341
Running compilation step : cd /tmp/ltsmin2121043542802090341;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2270 ms.
Running link step : cd /tmp/ltsmin2121043542802090341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2121043542802090341;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-07a-LTLCardinality-14 finished in 85587 ms.
[2022-05-15 21:46:55] [INFO ] Flatten gal took : 133 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14976497966419300092
[2022-05-15 21:46:55] [INFO ] Too many transitions (2136) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:46:55] [INFO ] Applying decomposition
[2022-05-15 21:46:55] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14976497966419300092
Running compilation step : cd /tmp/ltsmin14976497966419300092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:46:55] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4028679884241145872.txt' '-o' '/tmp/graph4028679884241145872.bin' '-w' '/tmp/graph4028679884241145872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4028679884241145872.bin' '-l' '-1' '-v' '-w' '/tmp/graph4028679884241145872.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:46:55] [INFO ] Decomposing Gal with order
[2022-05-15 21:46:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:46:55] [INFO ] Removed a total of 2900 redundant transitions.
[2022-05-15 21:46:55] [INFO ] Flatten gal took : 87 ms
[2022-05-15 21:46:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 14 ms.
[2022-05-15 21:46:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality15016409262048207341.gal : 9 ms
[2022-05-15 21:46:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality14082708990536713359.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15016409262048207341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14082708990536713359.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 2 LTL properties
Checking formula 0 : !((G(!(("((i5.i0.u169.p602==0)||(i15.i0.u385.p1383==1))")U(("(i5.i0.u169.p455==1)")U((G("((i5.i0.u169.p602==0)||(i15.i0.u385.p1383==1)...244
Formula 0 simplified : !G!("((i5.i0.u169.p602==0)||(i15.i0.u385.p1383==1))" U ("(i5.i0.u169.p455==1)" U (G"((i5.i0.u169.p602==0)||(i15.i0.u385.p1383==1))" ...233
Compilation finished in 3866 ms.
Running link step : cd /tmp/ltsmin14976497966419300092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin14976497966419300092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!((LTLAPp0==true) U ((LTLAPp1==true) U ([]((LTLAPp0==true))&&X((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 22:09:00] [INFO ] Applying decomposition
[2022-05-15 22:09:01] [INFO ] Flatten gal took : 179 ms
[2022-05-15 22:09:01] [INFO ] Decomposing Gal with order
[2022-05-15 22:09:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:09:01] [INFO ] Removed a total of 2395 redundant transitions.
[2022-05-15 22:09:01] [INFO ] Flatten gal took : 223 ms
[2022-05-15 22:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 912 labels/synchronizations in 71 ms.
[2022-05-15 22:09:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality17971574880417142724.gal : 6 ms
[2022-05-15 22:09:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality7279835039628812046.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17971574880417142724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7279835039628812046.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 2 LTL properties
Checking formula 0 : !((G(!(("((u105.p602==0)||(u245.p1383==1))")U(("(u75.p455==1)")U((G("((u105.p602==0)||(u245.p1383==1))"))&&(X("((u75.p455==1)&&((u105....191
Formula 0 simplified : !G!("((u105.p602==0)||(u245.p1383==1))" U ("(u75.p455==1)" U (G"((u105.p602==0)||(u245.p1383==1))" & X"((u75.p455==1)&&((u105.p602==...180
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14976497966419300092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!((LTLAPp0==true) U ((LTLAPp1==true) U ([]((LTLAPp0==true))&&X((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14976497966419300092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 22:31:07] [INFO ] Flatten gal took : 116 ms
[2022-05-15 22:31:07] [INFO ] Input system was already deterministic with 2136 transitions.
[2022-05-15 22:31:07] [INFO ] Transformed 1425 places.
[2022-05-15 22:31:07] [INFO ] Transformed 2136 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 22:31:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality2550354506070484602.gal : 4 ms
[2022-05-15 22:31:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality10538663265179032656.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2550354506070484602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10538663265179032656.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(!(("((p602==0)||(p1383==1))")U(("(p455==1)")U((G("((p602==0)||(p1383==1))"))&&(X("((p455==1)&&((p602==0)||(p1383==1)))"))))))))
Formula 0 simplified : !G!("((p602==0)||(p1383==1))" U ("(p455==1)" U (G"((p602==0)||(p1383==1))" & X"((p455==1)&&((p602==0)||(p1383==1)))")))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-07a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245688800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07a.tgz
mv ASLink-PT-07a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;