About the Execution of ITS-Tools for ASLink-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16238.508 | 3600000.00 | 11845910.00 | 43337.40 | ?FFFTFTFFF?FFFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989600153.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989600153
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 920K May 5 16:51 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-00
FORMULA_NAME ASLink-PT-10a-01
FORMULA_NAME ASLink-PT-10a-02
FORMULA_NAME ASLink-PT-10a-03
FORMULA_NAME ASLink-PT-10a-04
FORMULA_NAME ASLink-PT-10a-05
FORMULA_NAME ASLink-PT-10a-06
FORMULA_NAME ASLink-PT-10a-07
FORMULA_NAME ASLink-PT-10a-08
FORMULA_NAME ASLink-PT-10a-09
FORMULA_NAME ASLink-PT-10a-10
FORMULA_NAME ASLink-PT-10a-11
FORMULA_NAME ASLink-PT-10a-12
FORMULA_NAME ASLink-PT-10a-13
FORMULA_NAME ASLink-PT-10a-14
FORMULA_NAME ASLink-PT-10a-15
=== Now, execution of the tool begins
BK_START 1620442250240
Running Version 0
[2021-05-08 02:50:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 02:50:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 02:50:51] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2021-05-08 02:50:52] [INFO ] Transformed 2186 places.
[2021-05-08 02:50:52] [INFO ] Transformed 3192 transitions.
[2021-05-08 02:50:52] [INFO ] Found NUPN structural information;
[2021-05-08 02:50:52] [INFO ] Parsed PT model containing 2186 places and 3192 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 02:50:52] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2186 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 2127 transition count 3158
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 73 place count 2113 transition count 3091
Ensure Unique test removed 1 places
Iterating global reduction 1 with 15 rules applied. Total rules applied 88 place count 2112 transition count 3091
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 2112 transition count 3089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 2111 transition count 3081
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 2111 transition count 3081
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 2110 transition count 3073
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 2110 transition count 3073
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 2109 transition count 3065
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 2109 transition count 3065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 2108 transition count 3057
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 2108 transition count 3057
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 2107 transition count 3049
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 2107 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 2106 transition count 3041
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 2106 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 2105 transition count 3033
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 2105 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 2104 transition count 3025
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 2104 transition count 3025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 2103 transition count 3017
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 2103 transition count 3017
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 2102 transition count 3009
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 2102 transition count 3009
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 2101 transition count 3001
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 2101 transition count 3001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 2100 transition count 2993
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 2100 transition count 2993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 2099 transition count 2985
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 2099 transition count 2985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 2098 transition count 2977
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 2098 transition count 2977
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 2097 transition count 2969
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 2097 transition count 2969
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 2096 transition count 2961
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 2096 transition count 2961
Applied a total of 122 rules in 1807 ms. Remains 2096 /2186 variables (removed 90) and now considering 2961/3158 (removed 197) transitions.
// Phase 1: matrix 2961 rows 2096 cols
[2021-05-08 02:50:54] [INFO ] Computed 362 place invariants in 392 ms
[2021-05-08 02:50:55] [INFO ] Implicit Places using invariants in 1932 ms returned [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, 778, 783, 784, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1161, 1162, 1163, 1181, 1199, 1328, 1344, 1349, 1350, 1351, 1369, 1387, 1516, 1532, 1537, 1538, 1539, 1557, 1575, 1704, 1720, 1725, 1726, 1727, 1745, 1763, 1892, 1897, 1909, 1914, 1915, 1916, 1934, 1936, 1939, 1957, 1958, 1961, 1978, 1986, 1994, 2000, 2006, 2012, 2018, 2026, 2032, 2038, 2046]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 1965 ms to find 90 implicit places.
// Phase 1: matrix 2961 rows 2006 cols
[2021-05-08 02:50:56] [INFO ] Computed 272 place invariants in 91 ms
[2021-05-08 02:50:57] [INFO ] Dead Transitions using invariants and state equation in 1596 ms returned []
Starting structural reductions, iteration 1 : 2006/2186 places, 2961/3158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1994 transition count 2949
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1994 transition count 2949
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 1985 transition count 2940
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 1985 transition count 2940
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1981 transition count 2936
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1981 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1980 transition count 2935
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1980 transition count 2935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1979 transition count 2934
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1979 transition count 2934
Applied a total of 54 rules in 449 ms. Remains 1979 /2006 variables (removed 27) and now considering 2934/2961 (removed 27) transitions.
// Phase 1: matrix 2934 rows 1979 cols
[2021-05-08 02:50:58] [INFO ] Computed 272 place invariants in 34 ms
[2021-05-08 02:50:58] [INFO ] Implicit Places using invariants in 884 ms returned []
// Phase 1: matrix 2934 rows 1979 cols
[2021-05-08 02:50:58] [INFO ] Computed 272 place invariants in 34 ms
[2021-05-08 02:51:02] [INFO ] Implicit Places using invariants and state equation in 3630 ms returned []
Implicit Place search using SMT with State Equation took 4517 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1979/2186 places, 2934/3158 transitions.
[2021-05-08 02:51:02] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 02:51:02] [INFO ] Flatten gal took : 250 ms
FORMULA ASLink-PT-10a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 02:51:03] [INFO ] Flatten gal took : 174 ms
[2021-05-08 02:51:03] [INFO ] Input system was already deterministic with 2934 transitions.
Incomplete random walk after 100000 steps, including 408 resets, run finished after 795 ms. (steps per millisecond=125 ) properties (out of 16) seen :3
Running SMT prover for 13 properties.
// Phase 1: matrix 2934 rows 1979 cols
[2021-05-08 02:51:04] [INFO ] Computed 272 place invariants in 33 ms
[2021-05-08 02:51:04] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2021-05-08 02:51:04] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 50 ms returned sat
[2021-05-08 02:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:51:05] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2021-05-08 02:51:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:51:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 33 ms returned sat
[2021-05-08 02:51:06] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:51:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:51:07] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2021-05-08 02:51:07] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 193 ms.
[2021-05-08 02:51:28] [INFO ] Deduced a trap composed of 5 places in 2618 ms of which 6 ms to minimize.
[2021-05-08 02:51:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-08 02:51:28] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2021-05-08 02:51:28] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 50 ms returned sat
[2021-05-08 02:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:51:29] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2021-05-08 02:51:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:51:30] [INFO ] [Nat]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:51:30] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 48 ms returned sat
[2021-05-08 02:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:51:31] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2021-05-08 02:51:31] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 188 ms.
[2021-05-08 02:51:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-08 02:51:50] [INFO ] [Real]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:51:50] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 46 ms returned sat
[2021-05-08 02:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:51:51] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2021-05-08 02:51:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:51:51] [INFO ] [Nat]Absence check using 63 positive place invariants in 32 ms returned sat
[2021-05-08 02:51:51] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 50 ms returned sat
[2021-05-08 02:51:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:51:52] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2021-05-08 02:51:52] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 147 ms.
[2021-05-08 02:52:11] [INFO ] Added : 645 causal constraints over 129 iterations in 18522 ms. Result :unknown
[2021-05-08 02:52:11] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:52:11] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:52:12] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2021-05-08 02:52:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:52:12] [INFO ] [Nat]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:52:12] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:52:14] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2021-05-08 02:52:14] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 186 ms.
[2021-05-08 02:52:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-08 02:52:32] [INFO ] [Real]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:52:32] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:52:33] [INFO ] [Real]Absence check using state equation in 1026 ms returned sat
[2021-05-08 02:52:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:52:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 32 ms returned sat
[2021-05-08 02:52:34] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:52:35] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2021-05-08 02:52:35] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 147 ms.
[2021-05-08 02:52:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-08 02:52:54] [INFO ] [Real]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:52:54] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:52:55] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2021-05-08 02:52:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:52:55] [INFO ] [Nat]Absence check using 63 positive place invariants in 32 ms returned sat
[2021-05-08 02:52:55] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:02] [INFO ] [Nat]Absence check using state equation in 6928 ms returned unknown
[2021-05-08 02:53:02] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:53:02] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:03] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2021-05-08 02:53:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:53:04] [INFO ] [Nat]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:53:04] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:04] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2021-05-08 02:53:05] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2021-05-08 02:53:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2021-05-08 02:53:05] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 155 ms.
0Int
^^^^
(error "Invalid token: 0Int")
[2021-05-08 02:53:24] [INFO ] Deduced a trap composed of 5 places in 1023 ms of which 4 ms to minimize.
[2021-05-08 02:53:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-08 02:53:25] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:53:25] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 46 ms returned sat
[2021-05-08 02:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:26] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2021-05-08 02:53:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:53:26] [INFO ] [Nat]Absence check using 63 positive place invariants in 31 ms returned sat
[2021-05-08 02:53:26] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:27] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2021-05-08 02:53:27] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 150 ms.
[2021-05-08 02:53:47] [INFO ] Deduced a trap composed of 5 places in 948 ms of which 3 ms to minimize.
[2021-05-08 02:53:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-08 02:53:47] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:53:47] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:48] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2021-05-08 02:53:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:53:48] [INFO ] [Nat]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:53:48] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:55] [INFO ] [Nat]Absence check using state equation in 6374 ms returned unknown
[2021-05-08 02:53:55] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:53:55] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 45 ms returned sat
[2021-05-08 02:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:56] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2021-05-08 02:53:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:53:56] [INFO ] [Nat]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:53:56] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:53:58] [INFO ] [Nat]Absence check using state equation in 2051 ms returned sat
[2021-05-08 02:53:59] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 147 ms.
[2021-05-08 02:54:14] [INFO ] Added : 345 causal constraints over 69 iterations in 15708 ms. Result :unknown
[2021-05-08 02:54:14] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:54:14] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 51 ms returned sat
[2021-05-08 02:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:54:16] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2021-05-08 02:54:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:54:16] [INFO ] [Nat]Absence check using 63 positive place invariants in 35 ms returned sat
[2021-05-08 02:54:16] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 48 ms returned sat
[2021-05-08 02:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:54:18] [INFO ] [Nat]Absence check using state equation in 2112 ms returned sat
[2021-05-08 02:54:19] [INFO ] Deduced a trap composed of 44 places in 410 ms of which 1 ms to minimize.
[2021-05-08 02:54:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 762 ms
[2021-05-08 02:54:19] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 182 ms.
[2021-05-08 02:54:37] [INFO ] Deduced a trap composed of 5 places in 980 ms of which 2 ms to minimize.
[2021-05-08 02:54:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
[2021-05-08 02:54:37] [INFO ] [Real]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:54:37] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 47 ms returned sat
[2021-05-08 02:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:54:38] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2021-05-08 02:54:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:54:38] [INFO ] [Nat]Absence check using 63 positive place invariants in 35 ms returned sat
[2021-05-08 02:54:39] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 44 ms returned sat
[2021-05-08 02:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:54:40] [INFO ] [Nat]Absence check using state equation in 1435 ms returned sat
[2021-05-08 02:54:40] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 152 ms.
[2021-05-08 02:54:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2021-05-08 02:54:58] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2021-05-08 02:54:59] [INFO ] [Real]Absence check using 63 positive and 209 generalized place invariants in 50 ms returned sat
[2021-05-08 02:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:54:59] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2021-05-08 02:54:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:55:00] [INFO ] [Nat]Absence check using 63 positive place invariants in 30 ms returned sat
[2021-05-08 02:55:00] [INFO ] [Nat]Absence check using 63 positive and 209 generalized place invariants in 47 ms returned sat
[2021-05-08 02:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:55:01] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2021-05-08 02:55:01] [INFO ] Computed and/alt/rep : 1340/3230/1340 causal constraints (skipped 1593 transitions) in 148 ms.
[2021-05-08 02:55:20] [INFO ] Deduced a trap composed of 5 places in 978 ms of which 1 ms to minimize.
[2021-05-08 02:55:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 1977 transition count 2548
Reduce places removed 396 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 405 rules applied. Total rules applied 791 place count 1581 transition count 2539
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 801 place count 1572 transition count 2538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 1571 transition count 2538
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 288 Pre rules applied. Total rules applied 802 place count 1571 transition count 2250
Deduced a syphon composed of 288 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 373 places and 0 transitions.
Iterating global reduction 4 with 661 rules applied. Total rules applied 1463 place count 1198 transition count 2250
Discarding 24 places :
Implicit places reduction removed 24 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 4 with 53 rules applied. Total rules applied 1516 place count 1174 transition count 2221
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1545 place count 1145 transition count 2221
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 1545 place count 1145 transition count 2180
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1627 place count 1104 transition count 2180
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1642 place count 1089 transition count 2165
Iterating global reduction 6 with 15 rules applied. Total rules applied 1657 place count 1089 transition count 2165
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 6 with 14 rules applied. Total rules applied 1671 place count 1089 transition count 2151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1672 place count 1088 transition count 2151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1672 place count 1088 transition count 2150
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1674 place count 1087 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1675 place count 1086 transition count 2149
Iterating global reduction 8 with 1 rules applied. Total rules applied 1676 place count 1086 transition count 2149
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 9 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 8 with 188 rules applied. Total rules applied 1864 place count 992 transition count 2055
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1865 place count 991 transition count 2054
Iterating global reduction 8 with 1 rules applied. Total rules applied 1866 place count 991 transition count 2054
Applied a total of 1866 rules in 629 ms. Remains 991 /1979 variables (removed 988) and now considering 2054/2934 (removed 880) transitions.
// Phase 1: matrix 2054 rows 991 cols
[2021-05-08 02:55:31] [INFO ] Computed 151 place invariants in 23 ms
[2021-05-08 02:55:32] [INFO ] Implicit Places using invariants in 653 ms returned [0, 76, 93, 99, 104, 163, 180, 186, 191, 193, 253, 270, 276, 281, 283, 343, 360, 366, 371, 373, 436, 457, 463, 468, 469, 473, 533, 550, 556, 561, 563, 623, 640, 646, 651, 653, 713, 730, 736, 741, 743, 803, 820, 826, 831, 833, 893, 910, 916, 921, 923, 971, 988]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 655 ms to find 53 implicit places.
[2021-05-08 02:55:32] [INFO ] Redundant transitions in 152 ms returned []
// Phase 1: matrix 2054 rows 938 cols
[2021-05-08 02:55:32] [INFO ] Computed 98 place invariants in 23 ms
[2021-05-08 02:55:33] [INFO ] Dead Transitions using invariants and state equation in 902 ms returned []
Starting structural reductions, iteration 1 : 938/1979 places, 2054/2934 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 938 transition count 2049
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 933 transition count 2049
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 31 place count 912 transition count 2028
Iterating global reduction 2 with 21 rules applied. Total rules applied 52 place count 912 transition count 2028
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 72 place count 892 transition count 2008
Iterating global reduction 2 with 20 rules applied. Total rules applied 92 place count 892 transition count 2008
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 102 place count 882 transition count 1998
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 882 transition count 1998
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 152 place count 862 transition count 1978
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 861 transition count 1976
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 861 transition count 1976
Applied a total of 154 rules in 203 ms. Remains 861 /938 variables (removed 77) and now considering 1976/2054 (removed 78) transitions.
// Phase 1: matrix 1976 rows 861 cols
[2021-05-08 02:55:33] [INFO ] Computed 98 place invariants in 22 ms
[2021-05-08 02:55:34] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 1976 rows 861 cols
[2021-05-08 02:55:34] [INFO ] Computed 98 place invariants in 22 ms
[2021-05-08 02:55:35] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 861/1979 places, 1976/2934 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s782 0) (NEQ s332 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1193 reset in 462 ms.
Product exploration explored 100000 steps with 1249 reset in 386 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1204 reset in 299 ms.
Product exploration explored 100000 steps with 1199 reset in 325 ms.
[2021-05-08 02:55:49] [INFO ] Flatten gal took : 81 ms
[2021-05-08 02:55:49] [INFO ] Flatten gal took : 80 ms
[2021-05-08 02:55:49] [INFO ] Time to serialize gal into /tmp/LTL14841918232321404988.gal : 45 ms
[2021-05-08 02:55:49] [INFO ] Time to serialize properties into /tmp/LTL2035519456870008669.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14841918232321404988.gal, -t, CGAL, -LTL, /tmp/LTL2035519456870008669.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14841918232321404988.gal -t CGAL -LTL /tmp/LTL2035519456870008669.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1856!=0)||(p815!=1))"))))
Formula 0 simplified : !FG"((p1856!=0)||(p815!=1))"
Detected timeout of ITS tools.
[2021-05-08 02:56:04] [INFO ] Flatten gal took : 88 ms
[2021-05-08 02:56:04] [INFO ] Applying decomposition
[2021-05-08 02:56:05] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1188157903664601421.txt, -o, /tmp/graph1188157903664601421.bin, -w, /tmp/graph1188157903664601421.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1188157903664601421.bin, -l, -1, -v, -w, /tmp/graph1188157903664601421.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 02:56:07] [INFO ] Decomposing Gal with order
[2021-05-08 02:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 02:56:07] [INFO ] Removed a total of 3866 redundant transitions.
[2021-05-08 02:56:07] [INFO ] Flatten gal took : 193 ms
[2021-05-08 02:56:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 42 ms.
[2021-05-08 02:56:07] [INFO ] Time to serialize gal into /tmp/LTL14398838729933776430.gal : 17 ms
[2021-05-08 02:56:07] [INFO ] Time to serialize properties into /tmp/LTL10497518438103188991.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14398838729933776430.gal, -t, CGAL, -LTL, /tmp/LTL10497518438103188991.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14398838729933776430.gal -t CGAL -LTL /tmp/LTL10497518438103188991.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i20.u183.p1856!=0)||(i11.u88.p815!=1))"))))
Formula 0 simplified : !FG"((i20.u183.p1856!=0)||(i11.u88.p815!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11616135543085798516
[2021-05-08 02:56:25] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11616135543085798516
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11616135543085798516]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11616135543085798516] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11616135543085798516] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-10a-00 finished in 66211 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 383 transitions
Trivial Post-agglo rules discarded 383 transitions
Performed 383 trivial Post agglomeration. Transition count delta: 383
Iterating post reduction 0 with 384 rules applied. Total rules applied 384 place count 1978 transition count 2551
Reduce places removed 383 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 384 rules applied. Total rules applied 768 place count 1595 transition count 2550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 769 place count 1594 transition count 2550
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 265 Pre rules applied. Total rules applied 769 place count 1594 transition count 2285
Deduced a syphon composed of 265 places in 4 ms
Ensure Unique test removed 85 places
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 615 rules applied. Total rules applied 1384 place count 1244 transition count 2285
Discarding 12 places :
Implicit places reduction removed 12 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 21 rules applied. Total rules applied 1405 place count 1232 transition count 2276
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1414 place count 1223 transition count 2276
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1414 place count 1223 transition count 2236
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 1494 place count 1183 transition count 2236
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1500 place count 1177 transition count 2225
Iterating global reduction 5 with 6 rules applied. Total rules applied 1506 place count 1177 transition count 2225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 1511 place count 1176 transition count 2221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1512 place count 1175 transition count 2221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1512 place count 1175 transition count 2220
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 1514 place count 1174 transition count 2220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1515 place count 1173 transition count 2219
Iterating global reduction 7 with 1 rules applied. Total rules applied 1516 place count 1173 transition count 2219
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1722 place count 1070 transition count 2116
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1724 place count 1068 transition count 2114
Iterating global reduction 7 with 2 rules applied. Total rules applied 1726 place count 1068 transition count 2114
Applied a total of 1726 rules in 399 ms. Remains 1068 /1979 variables (removed 911) and now considering 2114/2934 (removed 820) transitions.
// Phase 1: matrix 2114 rows 1068 cols
[2021-05-08 02:56:27] [INFO ] Computed 173 place invariants in 45 ms
[2021-05-08 02:56:28] [INFO ] Implicit Places using invariants in 702 ms returned [1, 94, 100, 105, 121, 191, 197, 202, 218, 289, 295, 300, 316, 386, 392, 397, 413, 414, 489, 495, 500, 516, 587, 593, 598, 620, 690, 696, 701, 717, 787, 793, 798, 814, 884, 890, 895, 911, 981, 987, 992, 1011, 1048, 1065]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 705 ms to find 44 implicit places.
[2021-05-08 02:56:28] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 2114 rows 1024 cols
[2021-05-08 02:56:28] [INFO ] Computed 129 place invariants in 24 ms
[2021-05-08 02:56:29] [INFO ] Dead Transitions using invariants and state equation in 923 ms returned []
Starting structural reductions, iteration 1 : 1024/1979 places, 2114/2934 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 0 with 10 rules applied. Total rules applied 10 place count 1024 transition count 2104
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1014 transition count 2104
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 20 place count 1014 transition count 2084
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 60 place count 994 transition count 2084
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 80 place count 974 transition count 2064
Iterating global reduction 2 with 20 rules applied. Total rules applied 100 place count 974 transition count 2064
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 120 place count 954 transition count 2044
Iterating global reduction 2 with 20 rules applied. Total rules applied 140 place count 954 transition count 2044
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 150 place count 944 transition count 2034
Iterating global reduction 2 with 10 rules applied. Total rules applied 160 place count 944 transition count 2034
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 200 place count 924 transition count 2014
Applied a total of 200 rules in 174 ms. Remains 924 /1024 variables (removed 100) and now considering 2014/2114 (removed 100) transitions.
// Phase 1: matrix 2014 rows 924 cols
[2021-05-08 02:56:29] [INFO ] Computed 129 place invariants in 21 ms
[2021-05-08 02:56:30] [INFO ] Implicit Places using invariants in 515 ms returned [93, 96, 177, 180, 262, 265, 346, 349, 430, 433, 519, 522, 605, 608, 689, 692, 773, 776, 857, 860]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 517 ms to find 20 implicit places.
Starting structural reductions, iteration 2 : 904/1979 places, 2014/2934 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 0 with 10 rules applied. Total rules applied 10 place count 904 transition count 2004
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 894 transition count 2004
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 30 place count 884 transition count 1994
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 884 transition count 1994
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 50 place count 884 transition count 1984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 883 transition count 1983
Applied a total of 52 rules in 89 ms. Remains 883 /904 variables (removed 21) and now considering 1983/2014 (removed 31) transitions.
// Phase 1: matrix 1983 rows 883 cols
[2021-05-08 02:56:30] [INFO ] Computed 109 place invariants in 20 ms
[2021-05-08 02:56:30] [INFO ] Implicit Places using invariants in 488 ms returned [72, 151, 231, 312, 392, 472, 559, 639, 719, 799]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 490 ms to find 10 implicit places.
Starting structural reductions, iteration 3 : 873/1979 places, 1983/2934 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 863 transition count 1973
Applied a total of 20 rules in 89 ms. Remains 863 /873 variables (removed 10) and now considering 1973/1983 (removed 10) transitions.
// Phase 1: matrix 1973 rows 863 cols
[2021-05-08 02:56:30] [INFO ] Computed 99 place invariants in 21 ms
[2021-05-08 02:56:31] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 1973 rows 863 cols
[2021-05-08 02:56:31] [INFO ] Computed 99 place invariants in 21 ms
[2021-05-08 02:56:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-08 02:56:33] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 3262 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 863/1979 places, 1973/2934 transitions.
Stuttering acceptance computed with spot in 9770 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s46 0) (NEQ s495 1) (NEQ s116 0) (NEQ s227 1)), p0:(AND (NEQ s116 0) (NEQ s227 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 60 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-01 finished in 16565 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(F(p1)&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1978 transition count 2934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1976 transition count 2927
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1976 transition count 2927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1975 transition count 2926
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1975 transition count 2926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1974 transition count 2925
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1974 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1973 transition count 2924
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1973 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1972 transition count 2923
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1972 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1971 transition count 2922
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1971 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1970 transition count 2921
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1970 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1969 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1969 transition count 2920
Applied a total of 19 rules in 664 ms. Remains 1969 /1979 variables (removed 10) and now considering 2920/2934 (removed 14) transitions.
// Phase 1: matrix 2920 rows 1969 cols
[2021-05-08 02:56:44] [INFO ] Computed 271 place invariants in 32 ms
[2021-05-08 02:56:45] [INFO ] Implicit Places using invariants in 952 ms returned [1, 754, 1113]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 956 ms to find 3 implicit places.
// Phase 1: matrix 2920 rows 1966 cols
[2021-05-08 02:56:45] [INFO ] Computed 268 place invariants in 34 ms
[2021-05-08 02:56:46] [INFO ] Dead Transitions using invariants and state equation in 1571 ms returned []
Starting structural reductions, iteration 1 : 1966/1979 places, 2920/2934 transitions.
Applied a total of 0 rules in 66 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2021-05-08 02:56:47] [INFO ] Computed 268 place invariants in 31 ms
[2021-05-08 02:56:48] [INFO ] Dead Transitions using invariants and state equation in 1454 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1966/1979 places, 2920/2934 transitions.
Stuttering acceptance computed with spot in 1004 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (EQ s1515 1) (OR (EQ s650 0) (EQ s1877 1))) (EQ s1756 0) (EQ s1708 1)), p1:(EQ s1515 0), p2:(EQ s1515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2242 steps with 8 reset in 11 ms.
FORMULA ASLink-PT-10a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-02 finished in 5768 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1977 transition count 2927
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1977 transition count 2927
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1976 transition count 2926
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1976 transition count 2926
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1975 transition count 2925
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1975 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1974 transition count 2924
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1974 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1973 transition count 2923
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1973 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1972 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1972 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1971 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1971 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1970 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1970 transition count 2920
Applied a total of 18 rules in 639 ms. Remains 1970 /1979 variables (removed 9) and now considering 2920/2934 (removed 14) transitions.
// Phase 1: matrix 2920 rows 1970 cols
[2021-05-08 02:56:50] [INFO ] Computed 272 place invariants in 31 ms
[2021-05-08 02:56:51] [INFO ] Implicit Places using invariants in 906 ms returned [1, 754, 1114, 1881]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 917 ms to find 4 implicit places.
// Phase 1: matrix 2920 rows 1966 cols
[2021-05-08 02:56:51] [INFO ] Computed 268 place invariants in 31 ms
[2021-05-08 02:56:52] [INFO ] Dead Transitions using invariants and state equation in 1580 ms returned []
Starting structural reductions, iteration 1 : 1966/1979 places, 2920/2934 transitions.
Applied a total of 0 rules in 98 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2021-05-08 02:56:52] [INFO ] Computed 268 place invariants in 31 ms
[2021-05-08 02:56:54] [INFO ] Dead Transitions using invariants and state equation in 1483 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1966/1979 places, 2920/2934 transitions.
Stuttering acceptance computed with spot in 4739 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1111 0) (EQ s1179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-05 finished in 9476 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1978 transition count 2934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1976 transition count 2927
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1976 transition count 2927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1975 transition count 2926
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1975 transition count 2926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1974 transition count 2925
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1974 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1973 transition count 2924
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1973 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1972 transition count 2923
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1972 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1971 transition count 2922
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1971 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1970 transition count 2921
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1970 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1969 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1969 transition count 2920
Applied a total of 19 rules in 613 ms. Remains 1969 /1979 variables (removed 10) and now considering 2920/2934 (removed 14) transitions.
// Phase 1: matrix 2920 rows 1969 cols
[2021-05-08 02:56:59] [INFO ] Computed 271 place invariants in 31 ms
[2021-05-08 02:57:00] [INFO ] Implicit Places using invariants in 895 ms returned [1, 754, 1113, 1880]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 897 ms to find 4 implicit places.
// Phase 1: matrix 2920 rows 1965 cols
[2021-05-08 02:57:00] [INFO ] Computed 267 place invariants in 32 ms
[2021-05-08 02:57:01] [INFO ] Dead Transitions using invariants and state equation in 1458 ms returned []
Starting structural reductions, iteration 1 : 1965/1979 places, 2920/2934 transitions.
Applied a total of 0 rules in 65 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2021-05-08 02:57:02] [INFO ] Computed 267 place invariants in 31 ms
[2021-05-08 02:57:03] [INFO ] Dead Transitions using invariants and state equation in 1448 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1965/1979 places, 2920/2934 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s116 0) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2119 ms.
Product exploration explored 100000 steps with 50000 reset in 2025 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1999 ms.
Product exploration explored 100000 steps with 50000 reset in 2026 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1965 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Performed 389 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 1965 transition count 2920
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 144 Pre rules applied. Total rules applied 389 place count 1965 transition count 3003
Deduced a syphon composed of 533 places in 3 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 533 place count 1965 transition count 3003
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 584 place count 1914 transition count 2952
Deduced a syphon composed of 484 places in 3 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 635 place count 1914 transition count 2952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 635 place count 1914 transition count 2952
Deduced a syphon composed of 485 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 636 place count 1914 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 637 place count 1913 transition count 2951
Deduced a syphon composed of 484 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 638 place count 1913 transition count 2951
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 734 places in 3 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 888 place count 1913 transition count 2984
Discarding 133 places :
Symmetric choice reduction at 1 with 133 rule applications. Total rules 1021 place count 1780 transition count 2851
Deduced a syphon composed of 601 places in 3 ms
Iterating global reduction 1 with 133 rules applied. Total rules applied 1154 place count 1780 transition count 2851
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 611 places in 4 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 1164 place count 1780 transition count 2891
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 612 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 1165 place count 1780 transition count 2895
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1167 place count 1778 transition count 2889
Deduced a syphon composed of 610 places in 3 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1169 place count 1778 transition count 2889
Deduced a syphon composed of 610 places in 4 ms
Applied a total of 1169 rules in 1011 ms. Remains 1778 /1965 variables (removed 187) and now considering 2889/2920 (removed 31) transitions.
[2021-05-08 02:57:17] [INFO ] Redundant transitions in 284 ms returned []
// Phase 1: matrix 2889 rows 1778 cols
[2021-05-08 02:57:17] [INFO ] Computed 267 place invariants in 37 ms
[2021-05-08 02:57:18] [INFO ] Dead Transitions using invariants and state equation in 1499 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1778/1965 places, 2889/2920 transitions.
Product exploration explored 100000 steps with 50000 reset in 9984 ms.
Product exploration explored 100000 steps with 50000 reset in 9771 ms.
[2021-05-08 02:57:38] [INFO ] Flatten gal took : 91 ms
[2021-05-08 02:57:38] [INFO ] Flatten gal took : 95 ms
[2021-05-08 02:57:38] [INFO ] Time to serialize gal into /tmp/LTL15551430672362638578.gal : 10 ms
[2021-05-08 02:57:38] [INFO ] Time to serialize properties into /tmp/LTL2605382447860428557.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15551430672362638578.gal, -t, CGAL, -LTL, /tmp/LTL2605382447860428557.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15551430672362638578.gal -t CGAL -LTL /tmp/LTL2605382447860428557.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p128==0)||(p224==1))"))))
Formula 0 simplified : !XF"((p128==0)||(p224==1))"
Detected timeout of ITS tools.
[2021-05-08 02:57:53] [INFO ] Flatten gal took : 86 ms
[2021-05-08 02:57:53] [INFO ] Applying decomposition
[2021-05-08 02:57:53] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1301248813982362738.txt, -o, /tmp/graph1301248813982362738.bin, -w, /tmp/graph1301248813982362738.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1301248813982362738.bin, -l, -1, -v, -w, /tmp/graph1301248813982362738.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 02:57:54] [INFO ] Decomposing Gal with order
[2021-05-08 02:57:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 02:57:54] [INFO ] Removed a total of 3919 redundant transitions.
[2021-05-08 02:57:54] [INFO ] Flatten gal took : 167 ms
[2021-05-08 02:57:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 28 ms.
[2021-05-08 02:57:54] [INFO ] Time to serialize gal into /tmp/LTL4746428907850547762.gal : 16 ms
[2021-05-08 02:57:54] [INFO ] Time to serialize properties into /tmp/LTL14674232629470957853.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4746428907850547762.gal, -t, CGAL, -LTL, /tmp/LTL14674232629470957853.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4746428907850547762.gal -t CGAL -LTL /tmp/LTL14674232629470957853.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i1.u39.p128==0)||(i0.u65.p224==1))"))))
Formula 0 simplified : !XF"((i1.u39.p128==0)||(i0.u65.p224==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12072018407999344934
[2021-05-08 02:58:09] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12072018407999344934
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12072018407999344934]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12072018407999344934] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12072018407999344934] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-10a-06 finished in 71794 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p0))&&F(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1978 transition count 2934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1976 transition count 2927
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1976 transition count 2927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1975 transition count 2926
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1975 transition count 2926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1974 transition count 2925
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1974 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1973 transition count 2924
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1973 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1972 transition count 2923
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1972 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1971 transition count 2922
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1971 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1970 transition count 2921
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1970 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1969 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1969 transition count 2920
Applied a total of 19 rules in 743 ms. Remains 1969 /1979 variables (removed 10) and now considering 2920/2934 (removed 14) transitions.
// Phase 1: matrix 2920 rows 1969 cols
[2021-05-08 02:58:11] [INFO ] Computed 271 place invariants in 52 ms
[2021-05-08 02:58:12] [INFO ] Implicit Places using invariants in 929 ms returned [1, 754, 1113, 1880]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 939 ms to find 4 implicit places.
// Phase 1: matrix 2920 rows 1965 cols
[2021-05-08 02:58:12] [INFO ] Computed 267 place invariants in 33 ms
[2021-05-08 02:58:13] [INFO ] Dead Transitions using invariants and state equation in 1449 ms returned []
Starting structural reductions, iteration 1 : 1965/1979 places, 2920/2934 transitions.
Applied a total of 0 rules in 78 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2021-05-08 02:58:14] [INFO ] Computed 267 place invariants in 31 ms
[2021-05-08 02:58:15] [INFO ] Dead Transitions using invariants and state equation in 1486 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1965/1979 places, 2920/2934 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-10a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1156 0) (EQ s1389 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 817 reset in 451 ms.
Product exploration explored 100000 steps with 846 reset in 504 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 839 reset in 451 ms.
Product exploration explored 100000 steps with 852 reset in 464 ms.
Applying partial POR strategy [false, true, true, false, true]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 1965 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 1965 transition count 2920
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 144 Pre rules applied. Total rules applied 391 place count 1965 transition count 3003
Deduced a syphon composed of 535 places in 3 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 535 place count 1965 transition count 3003
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 586 place count 1914 transition count 2952
Deduced a syphon composed of 486 places in 4 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 637 place count 1914 transition count 2952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 637 place count 1914 transition count 2952
Deduced a syphon composed of 487 places in 5 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 638 place count 1914 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 639 place count 1913 transition count 2951
Deduced a syphon composed of 486 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 640 place count 1913 transition count 2951
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 736 places in 4 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 890 place count 1913 transition count 2984
Discarding 133 places :
Symmetric choice reduction at 1 with 133 rule applications. Total rules 1023 place count 1780 transition count 2851
Deduced a syphon composed of 603 places in 3 ms
Iterating global reduction 1 with 133 rules applied. Total rules applied 1156 place count 1780 transition count 2851
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 613 places in 4 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 1166 place count 1780 transition count 2891
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 614 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 1167 place count 1780 transition count 2895
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1169 place count 1778 transition count 2889
Deduced a syphon composed of 612 places in 3 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1171 place count 1778 transition count 2889
Deduced a syphon composed of 612 places in 16 ms
Applied a total of 1171 rules in 636 ms. Remains 1778 /1965 variables (removed 187) and now considering 2889/2920 (removed 31) transitions.
[2021-05-08 02:58:18] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2889 rows 1778 cols
[2021-05-08 02:58:18] [INFO ] Computed 267 place invariants in 37 ms
[2021-05-08 02:58:20] [INFO ] Dead Transitions using invariants and state equation in 1580 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1778/1965 places, 2889/2920 transitions.
Product exploration explored 100000 steps with 1838 reset in 672 ms.
Product exploration explored 100000 steps with 1857 reset in 651 ms.
[2021-05-08 02:58:21] [INFO ] Flatten gal took : 94 ms
[2021-05-08 02:58:21] [INFO ] Flatten gal took : 90 ms
[2021-05-08 02:58:21] [INFO ] Time to serialize gal into /tmp/LTL5695090687467793089.gal : 10 ms
[2021-05-08 02:58:21] [INFO ] Time to serialize properties into /tmp/LTL2121161735322131867.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5695090687467793089.gal, -t, CGAL, -LTL, /tmp/LTL2121161735322131867.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5695090687467793089.gal -t CGAL -LTL /tmp/LTL2121161735322131867.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((p1249==0)||(p1498==1))")U(X("((p1249==0)||(p1498==1))")))&&(F(G("((p1249==0)||(p1498==1))")))))
Formula 0 simplified : !(("((p1249==0)||(p1498==1))" U X"((p1249==0)||(p1498==1))") & FG"((p1249==0)||(p1498==1))")
Detected timeout of ITS tools.
[2021-05-08 02:58:36] [INFO ] Flatten gal took : 88 ms
[2021-05-08 02:58:36] [INFO ] Applying decomposition
[2021-05-08 02:58:36] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2645728723890661929.txt, -o, /tmp/graph2645728723890661929.bin, -w, /tmp/graph2645728723890661929.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2645728723890661929.bin, -l, -1, -v, -w, /tmp/graph2645728723890661929.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 02:58:37] [INFO ] Decomposing Gal with order
[2021-05-08 02:58:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 02:58:37] [INFO ] Removed a total of 3886 redundant transitions.
[2021-05-08 02:58:37] [INFO ] Flatten gal took : 154 ms
[2021-05-08 02:58:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 31 ms.
[2021-05-08 02:58:39] [INFO ] Time to serialize gal into /tmp/LTL12117821677260122618.gal : 2084 ms
[2021-05-08 02:58:39] [INFO ] Time to serialize properties into /tmp/LTL10244466164314587732.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12117821677260122618.gal, -t, CGAL, -LTL, /tmp/LTL10244466164314587732.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12117821677260122618.gal -t CGAL -LTL /tmp/LTL10244466164314587732.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("((i13.u346.p1249==0)||(i15.u442.p1498==1))")U(X("((i13.u346.p1249==0)||(i15.u442.p1498==1))")))&&(F(G("((i13.u346.p1249==0)||(i15.u442.p1498==1))")))))
Formula 0 simplified : !(("((i13.u346.p1249==0)||(i15.u442.p1498==1))" U X"((i13.u346.p1249==0)||(i15.u442.p1498==1))") & FG"((i13.u346.p1249==0)||(i15.u442.p1498==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14842839227869725360
[2021-05-08 02:58:54] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14842839227869725360
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14842839227869725360]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14842839227869725360] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14842839227869725360] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-10a-10 finished in 44850 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||(G(p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1978 transition count 2934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1976 transition count 2927
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1976 transition count 2927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1975 transition count 2926
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1975 transition count 2926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1974 transition count 2925
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1974 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1973 transition count 2924
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1973 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1972 transition count 2923
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1972 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1971 transition count 2922
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1971 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1970 transition count 2921
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1970 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1969 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1969 transition count 2920
Applied a total of 19 rules in 731 ms. Remains 1969 /1979 variables (removed 10) and now considering 2920/2934 (removed 14) transitions.
// Phase 1: matrix 2920 rows 1969 cols
[2021-05-08 02:58:56] [INFO ] Computed 271 place invariants in 31 ms
[2021-05-08 02:58:57] [INFO ] Implicit Places using invariants in 944 ms returned [1, 754, 1113, 1880]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 946 ms to find 4 implicit places.
// Phase 1: matrix 2920 rows 1965 cols
[2021-05-08 02:58:57] [INFO ] Computed 267 place invariants in 31 ms
[2021-05-08 02:58:58] [INFO ] Dead Transitions using invariants and state equation in 1644 ms returned []
Starting structural reductions, iteration 1 : 1965/1979 places, 2920/2934 transitions.
Applied a total of 0 rules in 85 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2021-05-08 02:58:59] [INFO ] Computed 267 place invariants in 32 ms
[2021-05-08 02:59:00] [INFO ] Dead Transitions using invariants and state equation in 1561 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1965/1979 places, 2920/2934 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : ASLink-PT-10a-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (NEQ s94 0) (NEQ s1220 1)), p1:(AND (NEQ s1342 0) (NEQ s1826 1) (NEQ s94 0) (NEQ s1220 1)), p2:(NEQ s1876 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-11 finished in 5114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1978 transition count 2934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1976 transition count 2927
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1976 transition count 2927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1975 transition count 2926
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1975 transition count 2926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1974 transition count 2925
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1974 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1973 transition count 2924
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1973 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1972 transition count 2923
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1972 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1971 transition count 2922
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1971 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1970 transition count 2921
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1970 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1969 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1969 transition count 2920
Applied a total of 19 rules in 747 ms. Remains 1969 /1979 variables (removed 10) and now considering 2920/2934 (removed 14) transitions.
// Phase 1: matrix 2920 rows 1969 cols
[2021-05-08 02:59:01] [INFO ] Computed 271 place invariants in 31 ms
[2021-05-08 02:59:02] [INFO ] Implicit Places using invariants in 875 ms returned [754, 1113, 1880]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 885 ms to find 3 implicit places.
// Phase 1: matrix 2920 rows 1966 cols
[2021-05-08 02:59:02] [INFO ] Computed 268 place invariants in 31 ms
[2021-05-08 02:59:03] [INFO ] Dead Transitions using invariants and state equation in 1420 ms returned []
Starting structural reductions, iteration 1 : 1966/1979 places, 2920/2934 transitions.
Applied a total of 0 rules in 78 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2021-05-08 02:59:03] [INFO ] Computed 268 place invariants in 30 ms
[2021-05-08 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 1415 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1966/1979 places, 2920/2934 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 1) (AND (EQ s1696 0) (EQ s471 1))), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 227 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-12 finished in 4636 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1979/1979 places, 2934/2934 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 1977 transition count 2555
Reduce places removed 389 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 398 rules applied. Total rules applied 777 place count 1588 transition count 2546
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 790 place count 1579 transition count 2542
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 794 place count 1575 transition count 2542
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 288 Pre rules applied. Total rules applied 794 place count 1575 transition count 2254
Deduced a syphon composed of 288 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 373 places and 0 transitions.
Iterating global reduction 4 with 661 rules applied. Total rules applied 1455 place count 1202 transition count 2254
Discarding 24 places :
Implicit places reduction removed 24 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 4 with 53 rules applied. Total rules applied 1508 place count 1178 transition count 2225
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1537 place count 1149 transition count 2225
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 1537 place count 1149 transition count 2185
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 1617 place count 1109 transition count 2185
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1633 place count 1093 transition count 2164
Iterating global reduction 6 with 16 rules applied. Total rules applied 1649 place count 1093 transition count 2164
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 15 rules applied. Total rules applied 1664 place count 1092 transition count 2150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1665 place count 1091 transition count 2150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1665 place count 1091 transition count 2149
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1667 place count 1090 transition count 2149
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 8 with 188 rules applied. Total rules applied 1855 place count 996 transition count 2055
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1856 place count 995 transition count 2054
Iterating global reduction 8 with 1 rules applied. Total rules applied 1857 place count 995 transition count 2054
Applied a total of 1857 rules in 295 ms. Remains 995 /1979 variables (removed 984) and now considering 2054/2934 (removed 880) transitions.
// Phase 1: matrix 2054 rows 995 cols
[2021-05-08 02:59:05] [INFO ] Computed 150 place invariants in 23 ms
[2021-05-08 02:59:06] [INFO ] Implicit Places using invariants in 670 ms returned [0, 76, 93, 99, 104, 163, 180, 186, 191, 193, 253, 270, 276, 281, 283, 343, 360, 366, 371, 373, 382, 435, 456, 462, 467, 469, 529, 548, 555, 560, 562, 622, 639, 645, 650, 652, 712, 729, 735, 740, 742, 802, 819, 825, 830, 832, 892, 909, 916, 921, 923, 971, 992]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 674 ms to find 53 implicit places.
[2021-05-08 02:59:06] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2054 rows 942 cols
[2021-05-08 02:59:06] [INFO ] Computed 97 place invariants in 31 ms
[2021-05-08 02:59:07] [INFO ] Dead Transitions using invariants and state equation in 818 ms returned []
Starting structural reductions, iteration 1 : 942/1979 places, 2054/2934 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 942 transition count 2045
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 933 transition count 2045
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 38 place count 913 transition count 2025
Iterating global reduction 2 with 20 rules applied. Total rules applied 58 place count 913 transition count 2025
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 77 place count 894 transition count 2006
Iterating global reduction 2 with 19 rules applied. Total rules applied 96 place count 894 transition count 2006
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 105 place count 885 transition count 1997
Iterating global reduction 2 with 9 rules applied. Total rules applied 114 place count 885 transition count 1997
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 156 place count 864 transition count 1976
Applied a total of 156 rules in 163 ms. Remains 864 /942 variables (removed 78) and now considering 1976/2054 (removed 78) transitions.
// Phase 1: matrix 1976 rows 864 cols
[2021-05-08 02:59:07] [INFO ] Computed 97 place invariants in 22 ms
[2021-05-08 02:59:07] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 1976 rows 864 cols
[2021-05-08 02:59:07] [INFO ] Computed 97 place invariants in 21 ms
[2021-05-08 02:59:10] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 2901 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 864/1979 places, 1976/2934 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s477 0) (EQ s75 1) (EQ s464 1)) (OR (EQ s477 0) (EQ s75 1))), p1:(OR (EQ s792 0) (EQ s857 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 1203 reset in 280 ms.
Product exploration explored 100000 steps with 1180 reset in 309 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1188 reset in 279 ms.
Product exploration explored 100000 steps with 1181 reset in 309 ms.
[2021-05-08 02:59:11] [INFO ] Flatten gal took : 65 ms
[2021-05-08 02:59:11] [INFO ] Flatten gal took : 67 ms
[2021-05-08 02:59:11] [INFO ] Time to serialize gal into /tmp/LTL1785639236180988356.gal : 6 ms
[2021-05-08 02:59:11] [INFO ] Time to serialize properties into /tmp/LTL8783894211152079027.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1785639236180988356.gal, -t, CGAL, -LTL, /tmp/LTL8783894211152079027.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1785639236180988356.gal -t CGAL -LTL /tmp/LTL8783894211152079027.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("((p1909==0)||(p2108==1))")))||("((((p1125==0)||(p102==1))||(p1078==1))&&((p1125==0)||(p102==1)))")))))
Formula 0 simplified : !GF("((((p1125==0)||(p102==1))||(p1078==1))&&((p1125==0)||(p102==1)))" | GF"((p1909==0)||(p2108==1))")
Detected timeout of ITS tools.
[2021-05-08 02:59:26] [INFO ] Flatten gal took : 82 ms
[2021-05-08 02:59:26] [INFO ] Applying decomposition
[2021-05-08 02:59:27] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3376789700158911577.txt, -o, /tmp/graph3376789700158911577.bin, -w, /tmp/graph3376789700158911577.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3376789700158911577.bin, -l, -1, -v, -w, /tmp/graph3376789700158911577.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 02:59:27] [INFO ] Decomposing Gal with order
[2021-05-08 02:59:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 02:59:27] [INFO ] Removed a total of 3894 redundant transitions.
[2021-05-08 02:59:27] [INFO ] Flatten gal took : 117 ms
[2021-05-08 02:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 17 ms.
[2021-05-08 02:59:28] [INFO ] Time to serialize gal into /tmp/LTL3313520460290893585.gal : 1209 ms
[2021-05-08 02:59:28] [INFO ] Time to serialize properties into /tmp/LTL17376935730158834141.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3313520460290893585.gal, -t, CGAL, -LTL, /tmp/LTL17376935730158834141.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3313520460290893585.gal -t CGAL -LTL /tmp/LTL17376935730158834141.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("((i19.u188.p1909==0)||(i19.u210.p2108==1))")))||("((((i11.i1.u117.p1125==0)||(i1.u24.p102==1))||(i11.i0.u116.p1078==1))&&((i11.i1.u117.p1125==0)||(i1.u24.p102==1)))")))))
Formula 0 simplified : !GF("((((i11.i1.u117.p1125==0)||(i1.u24.p102==1))||(i11.i0.u116.p1078==1))&&((i11.i1.u117.p1125==0)||(i1.u24.p102==1)))" | GF"((i19.u188.p1909==0)||(i19.u210.p2108==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9404779332412928291
[2021-05-08 02:59:43] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9404779332412928291
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9404779332412928291]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9404779332412928291] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9404779332412928291] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-10a-15 finished in 39273 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4660948761504839004
[2021-05-08 02:59:44] [INFO ] Too many transitions (2934) to apply POR reductions. Disabling POR matrices.
[2021-05-08 02:59:44] [INFO ] Applying decomposition
[2021-05-08 02:59:44] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4660948761504839004
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4660948761504839004]
[2021-05-08 02:59:44] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15716610114570869673.txt, -o, /tmp/graph15716610114570869673.bin, -w, /tmp/graph15716610114570869673.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15716610114570869673.bin, -l, -1, -v, -w, /tmp/graph15716610114570869673.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 02:59:45] [INFO ] Decomposing Gal with order
[2021-05-08 02:59:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 02:59:45] [INFO ] Removed a total of 3894 redundant transitions.
[2021-05-08 02:59:45] [INFO ] Flatten gal took : 144 ms
[2021-05-08 02:59:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 23 ms.
[2021-05-08 02:59:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality16340055513129043613.gal : 14 ms
[2021-05-08 02:59:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality6460170384387659176.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality16340055513129043613.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6460170384387659176.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality16340055513129043613.gal -t CGAL -LTL /tmp/LTLCardinality6460170384387659176.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((F(G(!("((i21.u519.p1856==0)&&(i11.u235.p815==1))")))))
Formula 0 simplified : !FG!"((i21.u519.p1856==0)&&(i11.u235.p815==1))"
Compilation finished in 29008 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4660948761504839004]
Link finished in 96 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
LTSmin run took 692 ms.
FORMULA ASLink-PT-10a-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp2==true) U X((LTLAPp2==true)))&&<>([]((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp2==true) U X((LTLAPp2==true)))&&<>([]((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp3==true)||[](<>((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp3==true)||[](<>((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4660948761504839004]
Detected timeout of ITS tools.
[2021-05-08 03:22:42] [INFO ] Applying decomposition
[2021-05-08 03:22:43] [INFO ] Flatten gal took : 285 ms
[2021-05-08 03:22:43] [INFO ] Decomposing Gal with order
[2021-05-08 03:22:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:22:43] [INFO ] Removed a total of 3258 redundant transitions.
[2021-05-08 03:22:43] [INFO ] Flatten gal took : 424 ms
[2021-05-08 03:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1274 labels/synchronizations in 155 ms.
[2021-05-08 03:22:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality4022833658415238706.gal : 25 ms
[2021-05-08 03:22:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality13121638598585062471.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality4022833658415238706.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13121638598585062471.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality4022833658415238706.gal -t CGAL -LTL /tmp/LTLCardinality13121638598585062471.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((F(G(!("((i77.i1.u403.p1856==0)&&(u144.p815==1))")))))
Formula 0 simplified : !FG!"((i77.i1.u403.p1856==0)&&(u144.p815==1))"
Detected timeout of ITS tools.
[2021-05-08 03:45:43] [INFO ] Flatten gal took : 658 ms
[2021-05-08 03:45:48] [INFO ] Input system was already deterministic with 2934 transitions.
[2021-05-08 03:45:48] [INFO ] Transformed 1979 places.
[2021-05-08 03:45:48] [INFO ] Transformed 2934 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 03:46:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality5177350302931187019.gal : 50 ms
[2021-05-08 03:46:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality7225438999746583073.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5177350302931187019.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7225438999746583073.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5177350302931187019.gal -t CGAL -LTL /tmp/LTLCardinality7225438999746583073.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(!("((p1856==0)&&(p815==1))")))))
Formula 0 simplified : !FG!"((p1856==0)&&(p815==1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-4028"
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 r007-tall-162037989600153"
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 '
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 ;