Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 920K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678504408181

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 03:13:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 03:13:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:13:30] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-11 03:13:30] [INFO ] Transformed 2186 places.
[2023-03-11 03:13:30] [INFO ] Transformed 3192 transitions.
[2023-03-11 03:13:30] [INFO ] Found NUPN structural information;
[2023-03-11 03:13:30] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2126 transition count 3158
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 75 place count 2111 transition count 3085
Ensure Unique test removed 1 places
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 2110 transition count 3085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 2110 transition count 3083
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 2109 transition count 3075
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 2109 transition count 3075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 2108 transition count 3067
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 2108 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 2107 transition count 3059
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 2107 transition count 3059
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 2106 transition count 3051
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 2106 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 2105 transition count 3043
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 2105 transition count 3043
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 2104 transition count 3035
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 2104 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 2103 transition count 3027
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 2103 transition count 3027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 2102 transition count 3019
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 2102 transition count 3019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 2101 transition count 3011
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 2101 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 2100 transition count 3003
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 2100 transition count 3003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 2099 transition count 2995
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 2099 transition count 2995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 2098 transition count 2987
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 2098 transition count 2987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 2097 transition count 2979
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 2097 transition count 2979
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 2096 transition count 2971
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 2096 transition count 2971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 2095 transition count 2963
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 2095 transition count 2963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 2094 transition count 2955
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 2094 transition count 2955
Applied a total of 125 rules in 2102 ms. Remains 2094 /2186 variables (removed 92) and now considering 2955/3158 (removed 203) transitions.
// Phase 1: matrix 2955 rows 2094 cols
[2023-03-11 03:13:33] [INFO ] Computed 361 place invariants in 198 ms
[2023-03-11 03:13:36] [INFO ] Implicit Places using invariants in 2752 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, 633, 762, 779, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1326, 1347, 1348, 1349, 1367, 1385, 1514, 1530, 1535, 1536, 1537, 1555, 1573, 1702, 1718, 1723, 1724, 1725, 1743, 1761, 1895, 1907, 1912, 1913, 1914, 1932, 1934, 1937, 1955, 1956, 1957, 1958, 1975, 1983, 1991, 1997, 2003, 2009, 2015, 2023, 2029, 2035, 2043]
Discarding 92 places :
Implicit Place search using SMT only with invariants took 2794 ms to find 92 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2002/2186 places, 2955/3158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1990 transition count 2943
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1990 transition count 2943
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1980 transition count 2933
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1980 transition count 2933
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1975 transition count 2928
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1975 transition count 2928
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1973 transition count 2926
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1973 transition count 2926
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1971 transition count 2924
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1971 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1970 transition count 2923
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1970 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1969 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1969 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1968 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1968 transition count 2921
Applied a total of 68 rules in 737 ms. Remains 1968 /2002 variables (removed 34) and now considering 2921/2955 (removed 34) transitions.
// Phase 1: matrix 2921 rows 1968 cols
[2023-03-11 03:13:36] [INFO ] Computed 269 place invariants in 82 ms
[2023-03-11 03:13:38] [INFO ] Implicit Places using invariants in 1783 ms returned []
[2023-03-11 03:13:38] [INFO ] Invariant cache hit.
[2023-03-11 03:13:43] [INFO ] Implicit Places using invariants and state equation in 5097 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1968/2186 places, 2921/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12524 ms. Remains : 1968/2186 places, 2921/3158 transitions.
Support contains 33 out of 1968 places after structural reductions.
[2023-03-11 03:13:44] [INFO ] Flatten gal took : 223 ms
[2023-03-11 03:13:44] [INFO ] Flatten gal took : 152 ms
[2023-03-11 03:13:44] [INFO ] Input system was already deterministic with 2921 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 03:13:45] [INFO ] Invariant cache hit.
[2023-03-11 03:13:46] [INFO ] [Real]Absence check using 61 positive place invariants in 33 ms returned sat
[2023-03-11 03:13:46] [INFO ] [Real]Absence check using 61 positive and 208 generalized place invariants in 112 ms returned sat
[2023-03-11 03:13:46] [INFO ] After 773ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:13:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 92 ms returned sat
[2023-03-11 03:13:47] [INFO ] [Nat]Absence check using 61 positive and 208 generalized place invariants in 221 ms returned sat
[2023-03-11 03:14:11] [INFO ] After 23664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:11] [INFO ] After 23670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:14:11] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 661 ms.
Support contains 18 out of 1968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Drop transitions removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 382 rules applied. Total rules applied 382 place count 1968 transition count 2539
Reduce places removed 382 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 383 rules applied. Total rules applied 765 place count 1586 transition count 2538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 766 place count 1585 transition count 2538
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 258 Pre rules applied. Total rules applied 766 place count 1585 transition count 2280
Deduced a syphon composed of 258 places in 3 ms
Ensure Unique test removed 81 places
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 597 rules applied. Total rules applied 1363 place count 1246 transition count 2280
Discarding 15 places :
Implicit places reduction removed 15 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 24 rules applied. Total rules applied 1387 place count 1231 transition count 2271
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1396 place count 1222 transition count 2271
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 1396 place count 1222 transition count 2232
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1474 place count 1183 transition count 2232
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1478 place count 1179 transition count 2228
Iterating global reduction 5 with 4 rules applied. Total rules applied 1482 place count 1179 transition count 2228
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 1486 place count 1179 transition count 2224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1487 place count 1178 transition count 2224
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 200 rules applied. Total rules applied 1687 place count 1078 transition count 2124
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1696 place count 1078 transition count 2115
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1705 place count 1069 transition count 2115
Free-agglomeration rule (complex) applied 41 times.
Iterating global reduction 8 with 41 rules applied. Total rules applied 1746 place count 1069 transition count 2074
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1788 place count 1027 transition count 2074
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1797 place count 1027 transition count 2065
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 1827 place count 1027 transition count 2065
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1828 place count 1027 transition count 2065
Applied a total of 1828 rules in 912 ms. Remains 1027 /1968 variables (removed 941) and now considering 2065/2921 (removed 856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 913 ms. Remains : 1027/1968 places, 2065/2921 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2065 rows 1027 cols
[2023-03-11 03:14:13] [INFO ] Computed 172 place invariants in 29 ms
[2023-03-11 03:14:13] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-11 03:14:14] [INFO ] [Nat]Absence check using 34 positive and 138 generalized place invariants in 55 ms returned sat
[2023-03-11 03:14:38] [INFO ] After 24490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:14:38] [INFO ] State equation strengthened by 49 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:14:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:14:38] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 380 ms.
Support contains 14 out of 1027 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1027/1027 places, 2065/2065 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1027 transition count 2062
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1024 transition count 2062
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 1024 transition count 2060
Deduced a syphon composed of 2 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 1021 transition count 2060
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 1020 transition count 2059
Applied a total of 13 rules in 89 ms. Remains 1020 /1027 variables (removed 7) and now considering 2059/2065 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1020/1027 places, 2059/2065 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2059 rows 1020 cols
[2023-03-11 03:14:39] [INFO ] Computed 171 place invariants in 17 ms
[2023-03-11 03:14:40] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:14:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-11 03:14:40] [INFO ] [Nat]Absence check using 30 positive and 141 generalized place invariants in 59 ms returned sat
[2023-03-11 03:14:51] [INFO ] After 10586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:14:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 03:15:00] [INFO ] After 9693ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:01] [INFO ] Deduced a trap composed of 53 places in 281 ms of which 21 ms to minimize.
[2023-03-11 03:15:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 445 ms
[2023-03-11 03:15:01] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 1 ms to minimize.
[2023-03-11 03:15:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-11 03:15:02] [INFO ] After 11032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-11 03:15:02] [INFO ] After 22382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 206 ms.
Support contains 12 out of 1020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1020/1020 places, 2059/2059 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1020 transition count 2058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1019 transition count 2058
Applied a total of 2 rules in 75 ms. Remains 1019 /1020 variables (removed 1) and now considering 2058/2059 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1019/1020 places, 2058/2059 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 146001 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{4=1}
Probabilistic random walk after 146001 steps, saw 66157 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 2058 rows 1019 cols
[2023-03-11 03:15:06] [INFO ] Computed 171 place invariants in 15 ms
[2023-03-11 03:15:06] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:15:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-11 03:15:06] [INFO ] [Nat]Absence check using 31 positive and 140 generalized place invariants in 113 ms returned sat
[2023-03-11 03:15:17] [INFO ] After 10301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 03:15:18] [INFO ] After 930ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:18] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 14 ms to minimize.
[2023-03-11 03:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-11 03:15:18] [INFO ] After 1713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-11 03:15:19] [INFO ] After 12768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 10 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 2058/2058 transitions.
Applied a total of 0 rules in 79 ms. Remains 1019 /1019 variables (removed 0) and now considering 2058/2058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1019/1019 places, 2058/2058 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 233531 steps, run timeout after 3010 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233531 steps, saw 91952 distinct states, run finished after 3012 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:15:22] [INFO ] Invariant cache hit.
[2023-03-11 03:15:23] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:15:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-11 03:15:23] [INFO ] [Nat]Absence check using 31 positive and 140 generalized place invariants in 56 ms returned sat
[2023-03-11 03:15:33] [INFO ] After 10039ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 03:15:34] [INFO ] After 697ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:34] [INFO ] After 1319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-11 03:15:34] [INFO ] After 11932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 10 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 2058/2058 transitions.
Applied a total of 0 rules in 31 ms. Remains 1019 /1019 variables (removed 0) and now considering 2058/2058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1019/1019 places, 2058/2058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 2058/2058 transitions.
Applied a total of 0 rules in 31 ms. Remains 1019 /1019 variables (removed 0) and now considering 2058/2058 (removed 0) transitions.
[2023-03-11 03:15:35] [INFO ] Invariant cache hit.
[2023-03-11 03:15:36] [INFO ] Implicit Places using invariants in 1221 ms returned [89, 95, 98, 100, 103, 110, 112, 113, 182, 188, 191, 193, 196, 203, 204, 205, 274, 280, 283, 285, 288, 295, 296, 297, 366, 372, 375, 377, 380, 387, 388, 389, 458, 464, 467, 469, 472, 479, 480, 481, 550, 556, 559, 561, 564, 571, 572, 573, 638, 654, 657, 659, 666, 673, 674, 675, 676, 745, 751, 758, 761, 768, 769, 770, 839, 845, 848, 850, 853, 866, 935, 941, 944, 946, 949, 963]
Discarding 76 places :
Implicit Place search using SMT only with invariants took 1237 ms to find 76 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 943/1019 places, 2058/2058 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 943 transition count 2057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 942 transition count 2057
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2 place count 942 transition count 2036
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 44 place count 921 transition count 2036
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 920 transition count 2036
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 83 place count 882 transition count 1998
Iterating global reduction 3 with 38 rules applied. Total rules applied 121 place count 882 transition count 1998
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 131 place count 882 transition count 1988
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 140 place count 873 transition count 1979
Iterating global reduction 4 with 9 rules applied. Total rules applied 149 place count 873 transition count 1979
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 171 place count 862 transition count 1968
Free-agglomeration rule applied 30 times.
Iterating global reduction 4 with 30 rules applied. Total rules applied 201 place count 862 transition count 1938
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 232 place count 832 transition count 1937
Applied a total of 232 rules in 219 ms. Remains 832 /943 variables (removed 111) and now considering 1937/2058 (removed 121) transitions.
// Phase 1: matrix 1937 rows 832 cols
[2023-03-11 03:15:36] [INFO ] Computed 94 place invariants in 15 ms
[2023-03-11 03:15:37] [INFO ] Implicit Places using invariants in 734 ms returned [72, 89, 146, 163, 219, 236, 292, 309, 365, 382, 438, 455, 511, 537, 593, 613, 669, 686, 748, 766]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 736 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 812/1019 places, 1937/2058 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 811 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 811 transition count 1936
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 801 transition count 1926
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 32 place count 801 transition count 1916
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 791 transition count 1916
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 791 transition count 1916
Applied a total of 43 rules in 161 ms. Remains 791 /812 variables (removed 21) and now considering 1916/1937 (removed 21) transitions.
// Phase 1: matrix 1916 rows 791 cols
[2023-03-11 03:15:37] [INFO ] Computed 74 place invariants in 30 ms
[2023-03-11 03:15:38] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-11 03:15:38] [INFO ] Invariant cache hit.
[2023-03-11 03:15:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-11 03:15:41] [INFO ] Implicit Places using invariants and state equation in 3589 ms returned []
Implicit Place search using SMT with State Equation took 4261 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 791/1019 places, 1916/2058 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6645 ms. Remains : 791/1019 places, 1916/2058 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 122 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1967 cols
[2023-03-11 03:15:42] [INFO ] Computed 269 place invariants in 45 ms
[2023-03-11 03:15:44] [INFO ] Implicit Places using invariants in 2237 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2239 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 61 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2422 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s497 0) (NEQ s1140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-01 finished in 2754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 117 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-11 03:15:44] [INFO ] Invariant cache hit.
[2023-03-11 03:15:46] [INFO ] Implicit Places using invariants in 1913 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1937 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 61 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2126 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1241 0) (EQ s1747 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-03 finished in 2342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 3 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 135 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-11 03:15:47] [INFO ] Invariant cache hit.
[2023-03-11 03:15:48] [INFO ] Implicit Places using invariants in 1489 ms returned [1821]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1494 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1966/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 95 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1725 ms. Remains : 1966/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1559 1), p1:(OR (EQ s1292 0) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 275 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-04 finished in 2076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 1967 transition count 2529
Reduce places removed 402 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 412 rules applied. Total rules applied 803 place count 1565 transition count 2519
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 813 place count 1555 transition count 2519
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 813 place count 1555 transition count 2236
Deduced a syphon composed of 283 places in 4 ms
Ensure Unique test removed 84 places
Reduce places removed 367 places and 0 transitions.
Iterating global reduction 3 with 650 rules applied. Total rules applied 1463 place count 1188 transition count 2236
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1517 place count 1163 transition count 2207
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1546 place count 1134 transition count 2207
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1546 place count 1134 transition count 2167
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1626 place count 1094 transition count 2167
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1641 place count 1079 transition count 2152
Iterating global reduction 5 with 15 rules applied. Total rules applied 1656 place count 1079 transition count 2152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1670 place count 1079 transition count 2138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1671 place count 1078 transition count 2138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1671 place count 1078 transition count 2137
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 1673 place count 1077 transition count 2137
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 1863 place count 982 transition count 2042
Applied a total of 1863 rules in 267 ms. Remains 982 /1968 variables (removed 986) and now considering 2042/2921 (removed 879) transitions.
// Phase 1: matrix 2042 rows 982 cols
[2023-03-11 03:15:49] [INFO ] Computed 149 place invariants in 36 ms
[2023-03-11 03:15:50] [INFO ] Implicit Places using invariants in 1222 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 609, 621, 629, 635, 640, 642, 702, 719, 725, 730, 732, 792, 809, 815, 820, 822, 885, 902, 908, 913, 915, 916, 979]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 1250 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1968 places, 2042/2921 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 930 transition count 2040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 928 transition count 2040
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 24 place count 908 transition count 2020
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 908 transition count 2020
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 64 place count 888 transition count 2000
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 888 transition count 2000
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 878 transition count 1990
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 878 transition count 1990
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 148 place count 856 transition count 1968
Applied a total of 148 rules in 135 ms. Remains 856 /930 variables (removed 74) and now considering 1968/2042 (removed 74) transitions.
// Phase 1: matrix 1968 rows 856 cols
[2023-03-11 03:15:50] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-11 03:15:51] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-11 03:15:51] [INFO ] Invariant cache hit.
[2023-03-11 03:15:53] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 856/1968 places, 1968/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4700 ms. Remains : 856/1968 places, 1968/2921 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s547 0) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-07 finished in 4765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G((p1||X(p2)))))))'
Support contains 8 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 181 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1967 cols
[2023-03-11 03:15:54] [INFO ] Computed 269 place invariants in 42 ms
[2023-03-11 03:15:55] [INFO ] Implicit Places using invariants in 1359 ms returned [1292]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1966/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 114 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1677 ms. Remains : 1966/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s1745 0) (EQ s434 1)), p1:(AND (EQ s716 0) (EQ s709 1)), p2:(OR (EQ s1695 0) (EQ s1820 1) (EQ s1119 0) (EQ s594 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1408 ms.
Product exploration explored 100000 steps with 33333 reset in 1311 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1) p2)
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-08 finished in 4891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 129 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-11 03:15:58] [INFO ] Invariant cache hit.
[2023-03-11 03:16:00] [INFO ] Implicit Places using invariants in 1242 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1245 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 64 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1446 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1835 0) (EQ s1192 1)), p1:(AND (EQ s1295 0) (EQ s1773 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 521 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-09 finished in 1647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 132 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-11 03:16:00] [INFO ] Invariant cache hit.
[2023-03-11 03:16:02] [INFO ] Implicit Places using invariants in 2340 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2344 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 107 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2583 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1647 0) (EQ s919 1)), p0:(OR (EQ s919 0) (EQ s1647 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-11 finished in 2941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 1967 transition count 2532
Reduce places removed 399 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 409 rules applied. Total rules applied 797 place count 1568 transition count 2522
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 807 place count 1558 transition count 2522
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 807 place count 1558 transition count 2240
Deduced a syphon composed of 282 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 366 places and 0 transitions.
Iterating global reduction 3 with 648 rules applied. Total rules applied 1455 place count 1192 transition count 2240
Discarding 26 places :
Implicit places reduction removed 26 places
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 55 rules applied. Total rules applied 1510 place count 1166 transition count 2211
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1539 place count 1137 transition count 2211
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1539 place count 1137 transition count 2170
Deduced a syphon composed of 41 places in 4 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1621 place count 1096 transition count 2170
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1635 place count 1082 transition count 2156
Iterating global reduction 5 with 14 rules applied. Total rules applied 1649 place count 1082 transition count 2156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1663 place count 1082 transition count 2142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1664 place count 1081 transition count 2142
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 3 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 7 with 184 rules applied. Total rules applied 1848 place count 989 transition count 2050
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1849 place count 989 transition count 2050
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1850 place count 988 transition count 2049
Iterating global reduction 7 with 1 rules applied. Total rules applied 1851 place count 988 transition count 2049
Applied a total of 1851 rules in 294 ms. Remains 988 /1968 variables (removed 980) and now considering 2049/2921 (removed 872) transitions.
// Phase 1: matrix 2049 rows 988 cols
[2023-03-11 03:16:03] [INFO ] Computed 148 place invariants in 36 ms
[2023-03-11 03:16:04] [INFO ] Implicit Places using invariants in 872 ms returned [72, 89, 95, 100, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 447, 453, 458, 460, 520, 537, 543, 548, 550, 610, 635, 640, 642, 702, 719, 725, 732, 734, 794, 811, 817, 822, 824, 887, 904, 910, 915, 917, 918, 985]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 887 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 938/1968 places, 2049/2921 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 938 transition count 2047
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 936 transition count 2046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 935 transition count 2046
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 24 place count 917 transition count 2028
Iterating global reduction 3 with 18 rules applied. Total rules applied 42 place count 917 transition count 2028
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 60 place count 899 transition count 2010
Iterating global reduction 3 with 18 rules applied. Total rules applied 78 place count 899 transition count 2010
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 87 place count 890 transition count 2001
Iterating global reduction 3 with 9 rules applied. Total rules applied 96 place count 890 transition count 2001
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 140 place count 868 transition count 1979
Applied a total of 140 rules in 142 ms. Remains 868 /938 variables (removed 70) and now considering 1979/2049 (removed 70) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2023-03-11 03:16:04] [INFO ] Computed 98 place invariants in 38 ms
[2023-03-11 03:16:06] [INFO ] Implicit Places using invariants in 1685 ms returned []
[2023-03-11 03:16:06] [INFO ] Invariant cache hit.
[2023-03-11 03:16:09] [INFO ] Implicit Places using invariants and state equation in 2991 ms returned []
Implicit Place search using SMT with State Equation took 4695 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 868/1968 places, 1979/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6019 ms. Remains : 868/1968 places, 1979/2921 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (EQ s95 0) (EQ s556 1)) (NOT (OR (EQ s640 0) (EQ s855 1)))), p0:(OR (EQ s95 0) (EQ s556 1) (AND (NEQ s640 0) (NEQ s855 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1223 reset in 481 ms.
Product exploration explored 100000 steps with 1200 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 252032 steps, run timeout after 3078 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 252032 steps, saw 162296 distinct states, run finished after 3079 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:16:14] [INFO ] Invariant cache hit.
[2023-03-11 03:16:14] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:16:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 108 ms returned sat
[2023-03-11 03:16:14] [INFO ] [Nat]Absence check using 17 positive and 81 generalized place invariants in 70 ms returned sat
[2023-03-11 03:16:15] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:16:15] [INFO ] After 1151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-11 03:16:15] [INFO ] After 1670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 868 transition count 1940
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 88 place count 829 transition count 1930
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 118 place count 829 transition count 1900
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 148 place count 799 transition count 1900
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 799 transition count 1900
Applied a total of 151 rules in 110 ms. Remains 799 /868 variables (removed 69) and now considering 1900/1979 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 799/868 places, 1900/1979 transitions.
Finished random walk after 9964 steps, including 166 resets, run visited all 1 properties in 31 ms. (steps per millisecond=321 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 266 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 42 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2023-03-11 03:16:16] [INFO ] Invariant cache hit.
[2023-03-11 03:16:17] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-11 03:16:17] [INFO ] Invariant cache hit.
[2023-03-11 03:16:20] [INFO ] Implicit Places using invariants and state equation in 3243 ms returned []
Implicit Place search using SMT with State Equation took 3929 ms to find 0 implicit places.
[2023-03-11 03:16:20] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-11 03:16:20] [INFO ] Invariant cache hit.
[2023-03-11 03:16:21] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5230 ms. Remains : 868/868 places, 1979/1979 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3831 steps, including 43 resets, run visited all 1 properties in 35 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1173 reset in 384 ms.
Product exploration explored 100000 steps with 1223 reset in 341 ms.
Built C files in :
/tmp/ltsmin8835211973174340756
[2023-03-11 03:16:23] [INFO ] Too many transitions (1979) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:16:23] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8835211973174340756
Running compilation step : cd /tmp/ltsmin8835211973174340756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8835211973174340756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8835211973174340756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 48 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2023-03-11 03:16:26] [INFO ] Invariant cache hit.
[2023-03-11 03:16:27] [INFO ] Implicit Places using invariants in 748 ms returned []
[2023-03-11 03:16:27] [INFO ] Invariant cache hit.
[2023-03-11 03:16:30] [INFO ] Implicit Places using invariants and state equation in 2751 ms returned []
Implicit Place search using SMT with State Equation took 3541 ms to find 0 implicit places.
[2023-03-11 03:16:30] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-11 03:16:30] [INFO ] Invariant cache hit.
[2023-03-11 03:16:31] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5039 ms. Remains : 868/868 places, 1979/1979 transitions.
Built C files in :
/tmp/ltsmin12835639829814383167
[2023-03-11 03:16:31] [INFO ] Too many transitions (1979) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:16:31] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12835639829814383167
Running compilation step : cd /tmp/ltsmin12835639829814383167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12835639829814383167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12835639829814383167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 03:16:35] [INFO ] Flatten gal took : 107 ms
[2023-03-11 03:16:35] [INFO ] Flatten gal took : 107 ms
[2023-03-11 03:16:35] [INFO ] Time to serialize gal into /tmp/LTL2970543921568231926.gal : 20 ms
[2023-03-11 03:16:35] [INFO ] Time to serialize properties into /tmp/LTL5031633431076990468.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2970543921568231926.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15726906182707088487.hoa' '-atoms' '/tmp/LTL5031633431076990468.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5031633431076990468.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15726906182707088487.hoa
Detected timeout of ITS tools.
[2023-03-11 03:16:50] [INFO ] Flatten gal took : 104 ms
[2023-03-11 03:16:50] [INFO ] Flatten gal took : 80 ms
[2023-03-11 03:16:50] [INFO ] Time to serialize gal into /tmp/LTL17650224921237562448.gal : 12 ms
[2023-03-11 03:16:50] [INFO ] Time to serialize properties into /tmp/LTL228336835906896332.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17650224921237562448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL228336835906896332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p216==0)||(p1314==1))")||((("((p216==0)||(p1314==1))")U("(((p216==0)||(p1314==1))&&(!((p1535==0)||(p2067==1))))"))||("((p15...181
Formula 0 simplified : FG(!"((p216==0)||(p1314==1))" & !"((p1535!=0)&&(p2067!=1))" & (!"((p216==0)||(p1314==1))" R !"(((p216==0)||(p1314==1))&&(!((p1535==0...174
Detected timeout of ITS tools.
[2023-03-11 03:17:06] [INFO ] Flatten gal took : 93 ms
[2023-03-11 03:17:06] [INFO ] Applying decomposition
[2023-03-11 03:17:06] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2031344290106361184.txt' '-o' '/tmp/graph2031344290106361184.bin' '-w' '/tmp/graph2031344290106361184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2031344290106361184.bin' '-l' '-1' '-v' '-w' '/tmp/graph2031344290106361184.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:17:06] [INFO ] Decomposing Gal with order
[2023-03-11 03:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:17:06] [INFO ] Removed a total of 3929 redundant transitions.
[2023-03-11 03:17:06] [INFO ] Flatten gal took : 197 ms
[2023-03-11 03:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 42 ms.
[2023-03-11 03:17:06] [INFO ] Time to serialize gal into /tmp/LTL349012698411522812.gal : 21 ms
[2023-03-11 03:17:06] [INFO ] Time to serialize properties into /tmp/LTL13843889260545268057.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL349012698411522812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13843889260545268057.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.u28.p216==0)||(i13.u139.p1314==1))")||((("((i1.u28.p216==0)||(i13.u139.p1314==1))")U("(((i1.u28.p216==0)||(i13.u139.p131...265
Formula 0 simplified : FG(!"((i1.u28.p216==0)||(i13.u139.p1314==1))" & !"((i16.u160.p1535!=0)&&(i19.u218.p2067!=1))" & (!"((i1.u28.p216==0)||(i13.u139.p131...258
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1012408844227396957
[2023-03-11 03:17:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1012408844227396957
Running compilation step : cd /tmp/ltsmin1012408844227396957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1012408844227396957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1012408844227396957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-10a-LTLCardinality-12 finished in 81695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1967 transition count 2530
Reduce places removed 400 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 409 rules applied. Total rules applied 799 place count 1567 transition count 2521
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 809 place count 1558 transition count 2520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 1557 transition count 2520
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 810 place count 1557 transition count 2239
Deduced a syphon composed of 281 places in 2 ms
Ensure Unique test removed 84 places
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 4 with 646 rules applied. Total rules applied 1456 place count 1192 transition count 2239
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 51 rules applied. Total rules applied 1507 place count 1168 transition count 2212
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1534 place count 1141 transition count 2212
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 1534 place count 1141 transition count 2172
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 1614 place count 1101 transition count 2172
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1628 place count 1087 transition count 2158
Iterating global reduction 6 with 14 rules applied. Total rules applied 1642 place count 1087 transition count 2158
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 13 rules applied. Total rules applied 1655 place count 1087 transition count 2145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1656 place count 1086 transition count 2145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1656 place count 1086 transition count 2144
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 1658 place count 1085 transition count 2144
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 8 with 190 rules applied. Total rules applied 1848 place count 990 transition count 2049
Applied a total of 1848 rules in 263 ms. Remains 990 /1968 variables (removed 978) and now considering 2049/2921 (removed 872) transitions.
// Phase 1: matrix 2049 rows 990 cols
[2023-03-11 03:17:25] [INFO ] Computed 151 place invariants in 40 ms
[2023-03-11 03:17:26] [INFO ] Implicit Places using invariants in 907 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 267, 275, 280, 282, 360, 366, 371, 440, 457, 463, 468, 470, 530, 547, 553, 558, 560, 620, 637, 643, 648, 650, 710, 727, 733, 738, 740, 800, 817, 823, 828, 830, 893, 910, 916, 921, 923, 924, 987]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 918 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 941/1968 places, 2049/2921 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 941 transition count 2047
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 939 transition count 2047
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 23 place count 920 transition count 2028
Iterating global reduction 2 with 19 rules applied. Total rules applied 42 place count 920 transition count 2028
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 61 place count 901 transition count 2009
Iterating global reduction 2 with 19 rules applied. Total rules applied 80 place count 901 transition count 2009
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 892 transition count 2000
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 892 transition count 2000
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 140 place count 871 transition count 1979
Applied a total of 140 rules in 126 ms. Remains 871 /941 variables (removed 70) and now considering 1979/2049 (removed 70) transitions.
// Phase 1: matrix 1979 rows 871 cols
[2023-03-11 03:17:26] [INFO ] Computed 102 place invariants in 37 ms
[2023-03-11 03:17:27] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-11 03:17:27] [INFO ] Invariant cache hit.
[2023-03-11 03:17:29] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 3191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 871/1968 places, 1979/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4498 ms. Remains : 871/1968 places, 1979/2921 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s357 0) (EQ s134 1)), p1:(AND (EQ s242 0) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-13 finished in 4675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 130 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1967 cols
[2023-03-11 03:17:29] [INFO ] Computed 269 place invariants in 54 ms
[2023-03-11 03:17:31] [INFO ] Implicit Places using invariants in 1330 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1347 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 125 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1602 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1865 0) (EQ s1591 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1474 ms.
Product exploration explored 100000 steps with 50000 reset in 1552 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 1065 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-14 finished in 5920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
[2023-03-11 03:17:36] [INFO ] Flatten gal took : 108 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11253474372394384596
[2023-03-11 03:17:36] [INFO ] Too many transitions (2921) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:17:36] [INFO ] Applying decomposition
[2023-03-11 03:17:36] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11253474372394384596
Running compilation step : cd /tmp/ltsmin11253474372394384596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 03:17:36] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12386349994234841915.txt' '-o' '/tmp/graph12386349994234841915.bin' '-w' '/tmp/graph12386349994234841915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12386349994234841915.bin' '-l' '-1' '-v' '-w' '/tmp/graph12386349994234841915.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:17:36] [INFO ] Decomposing Gal with order
[2023-03-11 03:17:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:17:36] [INFO ] Removed a total of 3911 redundant transitions.
[2023-03-11 03:17:36] [INFO ] Flatten gal took : 219 ms
[2023-03-11 03:17:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 31 ms.
[2023-03-11 03:17:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality5056114407634979307.gal : 22 ms
[2023-03-11 03:17:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality2754896958719185714.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5056114407634979307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2754896958719185714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i2.u64.p216==0)||(i14.u368.p1314==1))")||(("((i16.u432.p1535!=0)&&(i20.u581.p2067!=1))")||(("((i2.u64.p216==0)||(i14.u368.p...265
Formula 0 simplified : FG(!"((i2.u64.p216==0)||(i14.u368.p1314==1))" & !"((i16.u432.p1535!=0)&&(i20.u581.p2067!=1))" & (!"((i2.u64.p216==0)||(i14.u368.p131...258
Compilation finished in 7574 ms.
Running link step : cd /tmp/ltsmin11253474372394384596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin11253474372394384596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 03:38:58] [INFO ] Applying decomposition
[2023-03-11 03:38:58] [INFO ] Flatten gal took : 256 ms
[2023-03-11 03:38:58] [INFO ] Decomposing Gal with order
[2023-03-11 03:38:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:38:59] [INFO ] Removed a total of 3253 redundant transitions.
[2023-03-11 03:38:59] [INFO ] Flatten gal took : 459 ms
[2023-03-11 03:38:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1263 labels/synchronizations in 96 ms.
[2023-03-11 03:38:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality13744889509777492501.gal : 23 ms
[2023-03-11 03:38:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality17773961779283271197.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13744889509777492501.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17773961779283271197.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u35.p216==0)||(i53.i3.u227.p1314==1))")||(("((i61.u268.p1535!=0)&&(i84.u359.p2067!=1))")||(("((u35.p216==0)||(i53.i3.u227.p...265
Formula 0 simplified : FG(!"((i61.u268.p1535!=0)&&(i84.u359.p2067!=1))" & !"((u35.p216==0)||(i53.i3.u227.p1314==1))" & (!"((u35.p216==0)||(i53.i3.u227.p131...258
Detected timeout of ITS tools.
[2023-03-11 04:00:21] [INFO ] Flatten gal took : 172 ms
[2023-03-11 04:00:21] [INFO ] Input system was already deterministic with 2921 transitions.
[2023-03-11 04:00:21] [INFO ] Transformed 1968 places.
[2023-03-11 04:00:22] [INFO ] Transformed 2921 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-11 04:00:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality4711964900427342015.gal : 17 ms
[2023-03-11 04:00:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality9935220880495848896.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4711964900427342015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9935220880495848896.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p216==0)||(p1314==1))")||(("((p1535!=0)&&(p2067!=1))")||(("((p216==0)||(p1314==1))")U("(((p216==0)||(p1314==1))&&(!((p1535=...181
Formula 0 simplified : FG(!"((p216==0)||(p1314==1))" & !"((p1535!=0)&&(p2067!=1))" & (!"((p216==0)||(p1314==1))" R !"(((p216==0)||(p1314==1))&&(!((p1535==0...174
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6543840 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16032812 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-10a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813592700155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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