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.r235-smll-162106564700293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564700293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 82K May 5 16:52 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 ShieldRVt-PT-030A-00
FORMULA_NAME ShieldRVt-PT-030A-01
FORMULA_NAME ShieldRVt-PT-030A-02
FORMULA_NAME ShieldRVt-PT-030A-03
FORMULA_NAME ShieldRVt-PT-030A-04
FORMULA_NAME ShieldRVt-PT-030A-05
FORMULA_NAME ShieldRVt-PT-030A-06
FORMULA_NAME ShieldRVt-PT-030A-07
FORMULA_NAME ShieldRVt-PT-030A-08
FORMULA_NAME ShieldRVt-PT-030A-09
FORMULA_NAME ShieldRVt-PT-030A-10
FORMULA_NAME ShieldRVt-PT-030A-11
FORMULA_NAME ShieldRVt-PT-030A-12
FORMULA_NAME ShieldRVt-PT-030A-13
FORMULA_NAME ShieldRVt-PT-030A-14
FORMULA_NAME ShieldRVt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1621264618844

Running Version 0
[2021-05-17 15:17:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 15:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:17:02] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2021-05-17 15:17:02] [INFO ] Transformed 243 places.
[2021-05-17 15:17:02] [INFO ] Transformed 243 transitions.
[2021-05-17 15:17:02] [INFO ] Found NUPN structural information;
[2021-05-17 15:17:02] [INFO ] Parsed PT model containing 243 places and 243 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:17:02] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 59 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:02] [INFO ] Computed 121 place invariants in 15 ms
[2021-05-17 15:17:02] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:02] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-17 15:17:03] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:03] [INFO ] Computed 121 place invariants in 11 ms
[2021-05-17 15:17:03] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
[2021-05-17 15:17:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 15:17:04] [INFO ] Flatten gal took : 135 ms
FORMULA ShieldRVt-PT-030A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:17:04] [INFO ] Flatten gal took : 68 ms
[2021-05-17 15:17:04] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1007 ms. (steps per millisecond=99 ) properties (out of 34) seen :18
Running SMT prover for 16 properties.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:05] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-17 15:17:05] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:05] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-17 15:17:05] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 39 ms.
[2021-05-17 15:17:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 79 ms returned sat
[2021-05-17 15:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:06] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-17 15:17:06] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 135 ms.
[2021-05-17 15:17:08] [INFO ] Added : 219 causal constraints over 45 iterations in 2502 ms. Result :sat
[2021-05-17 15:17:08] [INFO ] [Real]Absence check using 121 positive place invariants in 56 ms returned sat
[2021-05-17 15:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:09] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-17 15:17:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2021-05-17 15:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:09] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-17 15:17:09] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:17:11] [INFO ] Added : 229 causal constraints over 47 iterations in 1865 ms. Result :sat
[2021-05-17 15:17:11] [INFO ] [Real]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-17 15:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:11] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-17 15:17:11] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-17 15:17:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2021-05-17 15:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:11] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-17 15:17:12] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-17 15:17:14] [INFO ] Added : 215 causal constraints over 44 iterations in 2077 ms. Result :sat
[2021-05-17 15:17:14] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:14] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-17 15:17:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-17 15:17:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2021-05-17 15:17:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:14] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-17 15:17:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 15:17:16] [INFO ] Added : 222 causal constraints over 47 iterations in 1811 ms. Result :sat
[2021-05-17 15:17:16] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:16] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-17 15:17:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-17 15:17:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2021-05-17 15:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:17] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-17 15:17:17] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-17 15:17:18] [INFO ] Added : 212 causal constraints over 47 iterations in 1752 ms. Result :sat
[2021-05-17 15:17:18] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2021-05-17 15:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:19] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-17 15:17:19] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 15:17:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2021-05-17 15:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:19] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-17 15:17:19] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 15:17:21] [INFO ] Added : 235 causal constraints over 50 iterations in 2148 ms. Result :sat
[2021-05-17 15:17:21] [INFO ] [Real]Absence check using 121 positive place invariants in 47 ms returned sat
[2021-05-17 15:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:21] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-17 15:17:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:22] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-17 15:17:22] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 15:17:23] [INFO ] Added : 195 causal constraints over 40 iterations in 1348 ms. Result :sat
[2021-05-17 15:17:23] [INFO ] [Real]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-17 15:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:23] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-17 15:17:23] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-17 15:17:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2021-05-17 15:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:24] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-17 15:17:24] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 40 ms.
[2021-05-17 15:17:25] [INFO ] Added : 231 causal constraints over 47 iterations in 1607 ms. Result :sat
[2021-05-17 15:17:25] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:26] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-17 15:17:26] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 15:17:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2021-05-17 15:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:26] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-17 15:17:26] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 15:17:28] [INFO ] Added : 219 causal constraints over 49 iterations in 1838 ms. Result :sat
[2021-05-17 15:17:28] [INFO ] [Real]Absence check using 121 positive place invariants in 45 ms returned sat
[2021-05-17 15:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:28] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-17 15:17:28] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 15:17:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-17 15:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:28] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-17 15:17:29] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-17 15:17:31] [INFO ] Added : 234 causal constraints over 51 iterations in 2160 ms. Result :sat
[2021-05-17 15:17:31] [INFO ] [Real]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-17 15:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:31] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-17 15:17:31] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 15:17:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2021-05-17 15:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:31] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-17 15:17:31] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-17 15:17:34] [INFO ] Added : 237 causal constraints over 51 iterations in 2201 ms. Result :sat
[2021-05-17 15:17:34] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2021-05-17 15:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:34] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-17 15:17:34] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-17 15:17:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:34] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2021-05-17 15:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:34] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-17 15:17:34] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 15:17:36] [INFO ] Added : 235 causal constraints over 48 iterations in 1810 ms. Result :sat
[2021-05-17 15:17:36] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2021-05-17 15:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:36] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-17 15:17:36] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:17:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-17 15:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:37] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-17 15:17:37] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:17:38] [INFO ] Added : 215 causal constraints over 44 iterations in 1609 ms. Result :sat
[2021-05-17 15:17:38] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:38] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-17 15:17:39] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-17 15:17:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:39] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2021-05-17 15:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:39] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-17 15:17:39] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 15:17:40] [INFO ] Added : 201 causal constraints over 43 iterations in 1482 ms. Result :sat
[2021-05-17 15:17:40] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2021-05-17 15:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:41] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-17 15:17:41] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 15:17:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:41] [INFO ] [Nat]Absence check using 121 positive place invariants in 40 ms returned sat
[2021-05-17 15:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:41] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-17 15:17:41] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 15:17:42] [INFO ] Added : 210 causal constraints over 43 iterations in 1407 ms. Result :sat
[2021-05-17 15:17:42] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2021-05-17 15:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:43] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-17 15:17:43] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 38 ms.
[2021-05-17 15:17:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:17:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2021-05-17 15:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:17:43] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-17 15:17:43] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 15:17:45] [INFO ] Added : 219 causal constraints over 46 iterations in 1533 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 45 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:45] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-17 15:17:45] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:45] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:17:45] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:45] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:17:46] [INFO ] Dead Transitions using invariants and state equation in 341 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 446 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s219 1) (EQ s228 1) (EQ s234 1)), p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-030A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-00 finished in 1625 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((G(p1) U p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:46] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:17:47] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:47] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-17 15:17:47] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:17:47] [INFO ] Computed 121 place invariants in 6 ms
[2021-05-17 15:17:47] [INFO ] Dead Transitions using invariants and state equation in 350 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-01 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s161 1), p2:(EQ s133 1), p1:(OR (EQ s78 0) (EQ s81 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 612 ms.
Product exploration explored 100000 steps with 11 reset in 726 ms.
Knowledge obtained : [(NOT p0), (NOT p2), p1]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 440 ms.
Product exploration explored 100000 steps with 2 reset in 543 ms.
[2021-05-17 15:17:51] [INFO ] Flatten gal took : 47 ms
[2021-05-17 15:17:51] [INFO ] Flatten gal took : 44 ms
[2021-05-17 15:17:51] [INFO ] Time to serialize gal into /tmp/LTL8097301000286198921.gal : 21 ms
[2021-05-17 15:17:51] [INFO ] Time to serialize properties into /tmp/LTL10732150714414760914.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/LTL8097301000286198921.gal, -t, CGAL, -LTL, /tmp/LTL10732150714414760914.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/LTL8097301000286198921.gal -t CGAL -LTL /tmp/LTL10732150714414760914.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p161==1)")||(X((G("((p78==0)||(p81==0))"))U("(p133==1)")))))))
Formula 0 simplified : !FG("(p161==1)" | X(G"((p78==0)||(p81==0))" U "(p133==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:18:06] [INFO ] Flatten gal took : 25 ms
[2021-05-17 15:18:06] [INFO ] Applying decomposition
[2021-05-17 15:18:06] [INFO ] Flatten gal took : 25 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/graph17495718429711851148.txt, -o, /tmp/graph17495718429711851148.bin, -w, /tmp/graph17495718429711851148.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/graph17495718429711851148.bin, -l, -1, -v, -w, /tmp/graph17495718429711851148.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:18:06] [INFO ] Decomposing Gal with order
[2021-05-17 15:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:18:06] [INFO ] Removed a total of 90 redundant transitions.
[2021-05-17 15:18:06] [INFO ] Flatten gal took : 209 ms
[2021-05-17 15:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2021-05-17 15:18:07] [INFO ] Time to serialize gal into /tmp/LTL12279281748947571124.gal : 23 ms
[2021-05-17 15:18:07] [INFO ] Time to serialize properties into /tmp/LTL5673740766176353071.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/LTL12279281748947571124.gal, -t, CGAL, -LTL, /tmp/LTL5673740766176353071.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/LTL12279281748947571124.gal -t CGAL -LTL /tmp/LTL5673740766176353071.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i11.i0.u80.p161==1)")||(X((G("((i5.i0.u38.p78==0)||(i5.i0.u40.p81==0))"))U("(i9.i1.u66.p133==1)")))))))
Formula 0 simplified : !FG("(i11.i0.u80.p161==1)" | X(G"((i5.i0.u38.p78==0)||(i5.i0.u40.p81==0))" U "(i9.i1.u66.p133==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10470938770669629023
[2021-05-17 15:18:22] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10470938770669629023
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/ltsmin10470938770669629023]
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/ltsmin10470938770669629023] 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/ltsmin10470938770669629023] 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 ShieldRVt-PT-030A-01 finished in 36461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&G(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 240 transition count 240
Applied a total of 3 rules in 34 ms. Remains 240 /243 variables (removed 3) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:23] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:23] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:23] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:23] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2021-05-17 15:18:23] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:23] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:23] [INFO ] Dead Transitions using invariants and state equation in 239 ms returned []
Finished structural reductions, in 1 iterations. Remains : 240/243 places, 240/242 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-02 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 3}, { cond=(NOT p1), acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=5, aps=[p1:(NEQ s44 1), p2:(OR (EQ s168 1) (EQ s158 1)), p0:(NEQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 565 ms.
Product exploration explored 100000 steps with 0 reset in 695 ms.
[2021-05-17 15:18:26] [INFO ] Flatten gal took : 27 ms
[2021-05-17 15:18:26] [INFO ] Flatten gal took : 38 ms
[2021-05-17 15:18:26] [INFO ] Time to serialize gal into /tmp/LTL5086380919065592111.gal : 8 ms
[2021-05-17 15:18:26] [INFO ] Time to serialize properties into /tmp/LTL1576083784638968654.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/LTL5086380919065592111.gal, -t, CGAL, -LTL, /tmp/LTL1576083784638968654.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/LTL5086380919065592111.gal -t CGAL -LTL /tmp/LTL1576083784638968654.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(p153==0)")U((G("(p153==0)"))||((("(p153==0)")&&(G("(p45==0)")))&&(F("((p169==1)||(p159==1))"))))))
Formula 0 simplified : !("(p153==0)" U (G"(p153==0)" | ("(p153==0)" & G"(p45==0)" & F"((p169==1)||(p159==1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:18:41] [INFO ] Flatten gal took : 13 ms
[2021-05-17 15:18:41] [INFO ] Applying decomposition
[2021-05-17 15:18:42] [INFO ] Flatten gal took : 13 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/graph9018102413227364429.txt, -o, /tmp/graph9018102413227364429.bin, -w, /tmp/graph9018102413227364429.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/graph9018102413227364429.bin, -l, -1, -v, -w, /tmp/graph9018102413227364429.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:18:42] [INFO ] Decomposing Gal with order
[2021-05-17 15:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:18:42] [INFO ] Removed a total of 89 redundant transitions.
[2021-05-17 15:18:42] [INFO ] Flatten gal took : 37 ms
[2021-05-17 15:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 15:18:42] [INFO ] Time to serialize gal into /tmp/LTL7867686236813552796.gal : 6 ms
[2021-05-17 15:18:42] [INFO ] Time to serialize properties into /tmp/LTL16319298952361124374.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/LTL7867686236813552796.gal, -t, CGAL, -LTL, /tmp/LTL16319298952361124374.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/LTL7867686236813552796.gal -t CGAL -LTL /tmp/LTL16319298952361124374.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("(i10.i1.u76.p153==0)")U((G("(i10.i1.u76.p153==0)"))||((("(i10.i1.u76.p153==0)")&&(G("(i3.i1.u22.p45==0)")))&&(F("((i12.i0.u84.p169==1)||(i11.u79.p159==1))"))))))
Formula 0 simplified : !("(i10.i1.u76.p153==0)" U (G"(i10.i1.u76.p153==0)" | ("(i10.i1.u76.p153==0)" & G"(i3.i1.u22.p45==0)" & F"((i12.i0.u84.p169==1)||(i11.u79.p159==1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.200792,23248,1,0,11067,52,1044,26155,43,53,13435
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-030A-02 finished in 19227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 240 transition count 240
Applied a total of 3 rules in 17 ms. Remains 240 /243 variables (removed 3) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:42] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:42] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:42] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-17 15:18:42] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2021-05-17 15:18:42] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:42] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-17 15:18:43] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 240/243 places, 240/242 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s194 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 138 reset in 632 ms.
Stack based approach found an accepted trace after 447 steps with 1 reset with depth 273 and stack size 164 in 4 ms.
FORMULA ShieldRVt-PT-030A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-03 finished in 1616 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)||(F(p0)&&X(p1))) U p2))], workingDir=/home/mcc/execution]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:44] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:18:44] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:44] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:18:44] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:44] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:18:45] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s51 1) (EQ s60 1) (EQ s66 1)), p0:(AND (EQ s220 1) (EQ s221 1) (EQ s224 1)), p1:(OR (EQ s240 0) (EQ s242 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 335 steps with 4 reset in 4 ms.
FORMULA ShieldRVt-PT-030A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-04 finished in 1305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 241
Applied a total of 2 rules in 28 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2021-05-17 15:18:45] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:18:45] [INFO ] Implicit Places using invariants in 273 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 276 ms to find 1 implicit places.
[2021-05-17 15:18:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 241 rows 241 cols
[2021-05-17 15:18:45] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:45] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Starting structural reductions, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 13 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2021-05-17 15:18:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 241 rows 241 cols
[2021-05-17 15:18:46] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:46] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 2 iterations. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s5 1) (EQ s8 1)), p0:(NEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 630 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-030A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-05 finished in 1818 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 240 transition count 240
Applied a total of 3 rules in 22 ms. Remains 240 /243 variables (removed 3) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:47] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 15:18:47] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:47] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-17 15:18:47] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2021-05-17 15:18:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2021-05-17 15:18:47] [INFO ] Computed 120 place invariants in 0 ms
[2021-05-17 15:18:48] [INFO ] Dead Transitions using invariants and state equation in 322 ms returned []
Finished structural reductions, in 1 iterations. Remains : 240/243 places, 240/242 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s98 0)], 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 0 reset in 379 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-030A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-07 finished in 1503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(X(X(p1)) U (X(p3)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:48] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:18:48] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:48] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:18:49] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:49] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-17 15:18:49] [INFO ] Dead Transitions using invariants and state equation in 261 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (OR (NOT p3) (NOT p2) (NOT p1)), (NOT p3), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(EQ s79 1), p2:(AND (EQ s29 1) (EQ s79 1)), p3:(EQ s29 1), p1:(EQ s99 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-09 finished in 1252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(((X(p0)&&G(p1))||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:49] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:18:50] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:50] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:18:50] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:18:50] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:18:50] [INFO ] Dead Transitions using invariants and state equation in 251 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (NEQ s118 1) (NEQ s121 1)), p0:(OR (NEQ s19 1) (NEQ s28 1) (NEQ s34 1))], nbAcceptance=2, 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 3 reset in 431 ms.
Product exploration explored 100000 steps with 6 reset in 566 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 476 ms.
Product exploration explored 100000 steps with 6 reset in 581 ms.
[2021-05-17 15:18:53] [INFO ] Flatten gal took : 24 ms
[2021-05-17 15:18:53] [INFO ] Flatten gal took : 24 ms
[2021-05-17 15:18:53] [INFO ] Time to serialize gal into /tmp/LTL11503873588891240299.gal : 3 ms
[2021-05-17 15:18:53] [INFO ] Time to serialize properties into /tmp/LTL9100514920134822215.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/LTL11503873588891240299.gal, -t, CGAL, -LTL, /tmp/LTL9100514920134822215.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/LTL11503873588891240299.gal -t CGAL -LTL /tmp/LTL9100514920134822215.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((p19==0)||(p28==0))||(p34==0))"))||((X("(((p19==0)||(p28==0))||(p34==0))"))&&(G("((p118==0)||(p121==0))"))))))))
Formula 0 simplified : !XXF(G"(((p19==0)||(p28==0))||(p34==0))" | (X"(((p19==0)||(p28==0))||(p34==0))" & G"((p118==0)||(p121==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:19:08] [INFO ] Flatten gal took : 52 ms
[2021-05-17 15:19:08] [INFO ] Applying decomposition
[2021-05-17 15:19:08] [INFO ] Flatten gal took : 17 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/graph7407451695408732838.txt, -o, /tmp/graph7407451695408732838.bin, -w, /tmp/graph7407451695408732838.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/graph7407451695408732838.bin, -l, -1, -v, -w, /tmp/graph7407451695408732838.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:19:09] [INFO ] Decomposing Gal with order
[2021-05-17 15:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:19:09] [INFO ] Removed a total of 90 redundant transitions.
[2021-05-17 15:19:09] [INFO ] Flatten gal took : 32 ms
[2021-05-17 15:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 15:19:09] [INFO ] Time to serialize gal into /tmp/LTL14672775360604913502.gal : 7 ms
[2021-05-17 15:19:09] [INFO ] Time to serialize properties into /tmp/LTL18332553810397507954.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/LTL14672775360604913502.gal, -t, CGAL, -LTL, /tmp/LTL18332553810397507954.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/LTL14672775360604913502.gal -t CGAL -LTL /tmp/LTL18332553810397507954.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((i1.i1.u9.p19==0)||(i2.i0.u13.p28==0))||(i2.i0.u16.p34==0))"))||((X("(((i1.i1.u9.p19==0)||(i2.i0.u13.p28==0))||(i2.i0.u16.p34==0))"))&&(G("((i8.u58.p118==0)||(i8.u60.p121==0))"))))))))
Formula 0 simplified : !XXF(G"(((i1.i1.u9.p19==0)||(i2.i0.u13.p28==0))||(i2.i0.u16.p34==0))" | (X"(((i1.i1.u9.p19==0)||(i2.i0.u13.p28==0))||(i2.i0.u16.p34==0))" & G"((i8.u58.p118==0)||(i8.u60.p121==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
146 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.50695,58828,1,0,67940,84,1087,260422,64,132,44620
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-030A-10 finished in 21019 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(X(p1)||(p2 U X(p3)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:10] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:11] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:11] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:11] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:11] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 344 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true]
Running random walk in product with property : ShieldRVt-PT-030A-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s217 1), p2:(EQ s121 1), p1:(AND (EQ s136 1) (EQ s138 1) (EQ s143 1)), p3:(EQ s141 1)], nbAcceptance=0, 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-11 finished in 1252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:12] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:12] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:12] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:12] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:12] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:13] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s224 1) (NEQ s226 1) (NEQ s231 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1244 ms.
Product exploration explored 100000 steps with 33333 reset in 962 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 895 ms.
Product exploration explored 100000 steps with 33333 reset in 957 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 243 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 40 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2021-05-17 15:19:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:17] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:18] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Product exploration explored 100000 steps with 33333 reset in 2930 ms.
Product exploration explored 100000 steps with 33333 reset in 2379 ms.
[2021-05-17 15:19:23] [INFO ] Flatten gal took : 13 ms
[2021-05-17 15:19:23] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:19:23] [INFO ] Time to serialize gal into /tmp/LTL5877635704368686283.gal : 3 ms
[2021-05-17 15:19:23] [INFO ] Time to serialize properties into /tmp/LTL5914143393655009761.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/LTL5877635704368686283.gal, -t, CGAL, -LTL, /tmp/LTL5914143393655009761.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/LTL5877635704368686283.gal -t CGAL -LTL /tmp/LTL5914143393655009761.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((p224==0)||(p226==0))||(p231==0))")))))
Formula 0 simplified : !XXF"(((p224==0)||(p226==0))||(p231==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
75 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.811666,25972,1,0,7,48932,20,0,6782,17465,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-030A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-030A-12 finished in 12175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:24] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:24] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:24] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:24] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:24] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:25] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-030A-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s39 1), p1:(AND (EQ s16 1) (EQ s18 1) (EQ s23 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 ShieldRVt-PT-030A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-13 finished in 992 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p1)&&p0) U (G(p2)||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:25] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:25] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:25] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:25] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:25] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 15:19:26] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p2 p3 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 5}, { cond=(AND p2 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(NEQ s47 1), p3:(OR (NEQ s182 1) (NEQ s185 1)), p0:(AND (EQ s11 1) (EQ s20 1) (EQ s26 1)), p1:(EQ s215 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 358 ms.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Knowledge obtained : [p2, p3, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 0 reset in 467 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 243 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2021-05-17 15:19:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:29] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:29] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Product exploration explored 100000 steps with 0 reset in 482 ms.
[2021-05-17 15:19:30] [INFO ] Flatten gal took : 12 ms
[2021-05-17 15:19:30] [INFO ] Flatten gal took : 12 ms
[2021-05-17 15:19:30] [INFO ] Time to serialize gal into /tmp/LTL6263597173231424006.gal : 3 ms
[2021-05-17 15:19:30] [INFO ] Time to serialize properties into /tmp/LTL4476630061607607252.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/LTL6263597173231424006.gal, -t, CGAL, -LTL, /tmp/LTL4476630061607607252.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/LTL6263597173231424006.gal -t CGAL -LTL /tmp/LTL4476630061607607252.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(((p11==1)&&(p20==1))&&(p26==1))")&&(F("(p215==1)")))U((G("(p47==0)"))||(G("((p182==0)||(p185==0))"))))))
Formula 0 simplified : !X(("(((p11==1)&&(p20==1))&&(p26==1))" & F"(p215==1)") U (G"(p47==0)" | G"((p182==0)||(p185==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:19:45] [INFO ] Flatten gal took : 12 ms
[2021-05-17 15:19:45] [INFO ] Applying decomposition
[2021-05-17 15:19:45] [INFO ] Flatten gal took : 12 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/graph7314335629272310254.txt, -o, /tmp/graph7314335629272310254.bin, -w, /tmp/graph7314335629272310254.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/graph7314335629272310254.bin, -l, -1, -v, -w, /tmp/graph7314335629272310254.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:19:45] [INFO ] Decomposing Gal with order
[2021-05-17 15:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:19:45] [INFO ] Removed a total of 90 redundant transitions.
[2021-05-17 15:19:45] [INFO ] Flatten gal took : 31 ms
[2021-05-17 15:19:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-17 15:19:45] [INFO ] Time to serialize gal into /tmp/LTL1881762221984144971.gal : 6 ms
[2021-05-17 15:19:45] [INFO ] Time to serialize properties into /tmp/LTL5990628634864468889.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/LTL1881762221984144971.gal, -t, CGAL, -LTL, /tmp/LTL5990628634864468889.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/LTL1881762221984144971.gal -t CGAL -LTL /tmp/LTL5990628634864468889.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(((i0.i1.u5.p11==1)&&(i1.i0.u9.p20==1))&&(i1.i0.u12.p26==1))")&&(F("(i13.i1.u107.p215==1)")))U((G("(i2.i1.u23.p47==0)"))||(G("((i11.i1.u90.p182==0)||(i11.i1.u92.p185==0))"))))))
Formula 0 simplified : !X(("(((i0.i1.u5.p11==1)&&(i1.i0.u9.p20==1))&&(i1.i0.u12.p26==1))" & F"(i13.i1.u107.p215==1)") U (G"(i2.i1.u23.p47==0)" | G"((i11.i1.u90.p182==0)||(i11.i1.u92.p185==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
42 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.474238,32808,1,0,27398,77,1112,82364,67,122,21937
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-030A-14 finished in 20808 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:46] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:46] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:46] [INFO ] Computed 121 place invariants in 0 ms
[2021-05-17 15:19:46] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2021-05-17 15:19:46] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 15:19:46] [INFO ] Dead Transitions using invariants and state equation in 272 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s219 0) (EQ s228 0) (EQ s234 0)), p1:(NEQ s201 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33255 reset in 983 ms.
Product exploration explored 100000 steps with 33294 reset in 1042 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 33594 reset in 1434 ms.
Product exploration explored 100000 steps with 33431 reset in 1152 ms.
[2021-05-17 15:19:52] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:19:52] [INFO ] Flatten gal took : 17 ms
[2021-05-17 15:19:52] [INFO ] Time to serialize gal into /tmp/LTL6327434572687986174.gal : 2 ms
[2021-05-17 15:19:52] [INFO ] Time to serialize properties into /tmp/LTL565989096397811412.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/LTL6327434572687986174.gal, -t, CGAL, -LTL, /tmp/LTL565989096397811412.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/LTL6327434572687986174.gal -t CGAL -LTL /tmp/LTL565989096397811412.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((X("(p201==0)"))&&("(((p219==0)||(p228==0))||(p234==0))")))))
Formula 0 simplified : !GF("(((p219==0)||(p228==0))||(p234==0))" & X"(p201==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
86 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.925078,30092,1,0,33,66826,28,8,7086,34703,76
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-030A-15 finished in 6888 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11287713446056804580
[2021-05-17 15:19:53] [INFO ] Computing symmetric may disable matrix : 242 transitions.
[2021-05-17 15:19:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:19:53] [INFO ] Computing symmetric may enable matrix : 242 transitions.
[2021-05-17 15:19:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:19:53] [INFO ] Applying decomposition
[2021-05-17 15:19:53] [INFO ] Flatten gal took : 10 ms
[2021-05-17 15:19:53] [INFO ] Computing Do-Not-Accords matrix : 242 transitions.
[2021-05-17 15:19:53] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:19:53] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11287713446056804580
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/ltsmin11287713446056804580]
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/graph4981459856786548110.txt, -o, /tmp/graph4981459856786548110.bin, -w, /tmp/graph4981459856786548110.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/graph4981459856786548110.bin, -l, -1, -v, -w, /tmp/graph4981459856786548110.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:19:53] [INFO ] Decomposing Gal with order
[2021-05-17 15:19:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:19:53] [INFO ] Removed a total of 90 redundant transitions.
[2021-05-17 15:19:53] [INFO ] Flatten gal took : 54 ms
[2021-05-17 15:19:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 15:19:53] [INFO ] Time to serialize gal into /tmp/LTLFireability3876961786313317172.gal : 5 ms
[2021-05-17 15:19:53] [INFO ] Time to serialize properties into /tmp/LTLFireability18215633866512686045.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/LTLFireability3876961786313317172.gal, -t, CGAL, -LTL, /tmp/LTLFireability18215633866512686045.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/LTLFireability3876961786313317172.gal -t CGAL -LTL /tmp/LTLFireability18215633866512686045.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i9.i1.u80.p161==1)")||(X((G("((i4.i1.u38.p78==0)||(i4.i1.u40.p81==0))"))U("(i8.i0.u66.p133==1)")))))))
Formula 0 simplified : !FG("(i9.i1.u80.p161==1)" | X(G"((i4.i1.u38.p78==0)||(i4.i1.u40.p81==0))" U "(i8.i0.u66.p133==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 2022 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11287713446056804580]
Link finished in 60 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, --when, --ltl, <>([](((LTLAPp0==true)||X(([]((LTLAPp1==true)) U (LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11287713446056804580]
LTSmin run took 825 ms.
FORMULA ShieldRVt-PT-030A-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621264797301

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="ShieldRVt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-030A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-smll-162106564700293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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