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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:41 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 332K 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 ShieldIIPs-PT-020B-00
FORMULA_NAME ShieldIIPs-PT-020B-01
FORMULA_NAME ShieldIIPs-PT-020B-02
FORMULA_NAME ShieldIIPs-PT-020B-03
FORMULA_NAME ShieldIIPs-PT-020B-04
FORMULA_NAME ShieldIIPs-PT-020B-05
FORMULA_NAME ShieldIIPs-PT-020B-06
FORMULA_NAME ShieldIIPs-PT-020B-07
FORMULA_NAME ShieldIIPs-PT-020B-08
FORMULA_NAME ShieldIIPs-PT-020B-09
FORMULA_NAME ShieldIIPs-PT-020B-10
FORMULA_NAME ShieldIIPs-PT-020B-11
FORMULA_NAME ShieldIIPs-PT-020B-12
FORMULA_NAME ShieldIIPs-PT-020B-13
FORMULA_NAME ShieldIIPs-PT-020B-14
FORMULA_NAME ShieldIIPs-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621071134082

Running Version 0
[2021-05-15 09:32:16] [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-15 09:32:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 09:32:16] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2021-05-15 09:32:16] [INFO ] Transformed 1203 places.
[2021-05-15 09:32:16] [INFO ] Transformed 1183 transitions.
[2021-05-15 09:32:16] [INFO ] Found NUPN structural information;
[2021-05-15 09:32:16] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 130 places :
Symmetric choice reduction at 0 with 130 rule applications. Total rules 130 place count 1073 transition count 1053
Iterating global reduction 0 with 130 rules applied. Total rules applied 260 place count 1073 transition count 1053
Applied a total of 260 rules in 217 ms. Remains 1073 /1203 variables (removed 130) and now considering 1053/1183 (removed 130) transitions.
// Phase 1: matrix 1053 rows 1073 cols
[2021-05-15 09:32:16] [INFO ] Computed 181 place invariants in 29 ms
[2021-05-15 09:32:17] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 1053 rows 1073 cols
[2021-05-15 09:32:17] [INFO ] Computed 181 place invariants in 8 ms
[2021-05-15 09:32:18] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
// Phase 1: matrix 1053 rows 1073 cols
[2021-05-15 09:32:18] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:32:18] [INFO ] Dead Transitions using invariants and state equation in 569 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1073/1203 places, 1053/1183 transitions.
[2021-05-15 09:32:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 09:32:18] [INFO ] Flatten gal took : 115 ms
FORMULA ShieldIIPs-PT-020B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 09:32:19] [INFO ] Flatten gal took : 69 ms
[2021-05-15 09:32:19] [INFO ] Input system was already deterministic with 1053 transitions.
Incomplete random walk after 100000 steps, including 39 resets, run finished after 719 ms. (steps per millisecond=139 ) properties (out of 32) seen :31
Running SMT prover for 1 properties.
// Phase 1: matrix 1053 rows 1073 cols
[2021-05-15 09:32:19] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:32:20] [INFO ] [Real]Absence check using 181 positive place invariants in 46 ms returned sat
[2021-05-15 09:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:32:20] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-15 09:32:20] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 18 ms to minimize.
[2021-05-15 09:32:21] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 1 ms to minimize.
[2021-05-15 09:32:21] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 2 ms to minimize.
[2021-05-15 09:32:21] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2021-05-15 09:32:21] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 2 ms to minimize.
[2021-05-15 09:32:22] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2021-05-15 09:32:22] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2021-05-15 09:32:22] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2021-05-15 09:32:22] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 0 ms to minimize.
[2021-05-15 09:32:23] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2021-05-15 09:32:23] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 0 ms to minimize.
[2021-05-15 09:32:23] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2021-05-15 09:32:23] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 1 ms to minimize.
[2021-05-15 09:32:24] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2021-05-15 09:32:24] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2021-05-15 09:32:24] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2021-05-15 09:32:24] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 0 ms to minimize.
[2021-05-15 09:32:25] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 0 ms to minimize.
[2021-05-15 09:32:25] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2021-05-15 09:32:25] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2021-05-15 09:32:25] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2021-05-15 09:32:25] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2021-05-15 09:32:26] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 0 ms to minimize.
[2021-05-15 09:32:26] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2021-05-15 09:32:26] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2021-05-15 09:32:26] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2021-05-15 09:32:26] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2021-05-15 09:32:26] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 5 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2021-05-15 09:32:27] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2021-05-15 09:32:28] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2021-05-15 09:32:28] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7670 ms
[2021-05-15 09:32:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:32:28] [INFO ] [Nat]Absence check using 181 positive place invariants in 46 ms returned sat
[2021-05-15 09:32:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:32:28] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2021-05-15 09:32:28] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2021-05-15 09:32:29] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2021-05-15 09:32:29] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2021-05-15 09:32:29] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2021-05-15 09:32:29] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2021-05-15 09:32:30] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 2 ms to minimize.
[2021-05-15 09:32:30] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2021-05-15 09:32:30] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 1 ms to minimize.
[2021-05-15 09:32:30] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2021-05-15 09:32:30] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2021-05-15 09:32:31] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 0 ms to minimize.
[2021-05-15 09:32:31] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2021-05-15 09:32:31] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2021-05-15 09:32:31] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2021-05-15 09:32:31] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 0 ms to minimize.
[2021-05-15 09:32:32] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 0 ms to minimize.
[2021-05-15 09:32:32] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2021-05-15 09:32:32] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2021-05-15 09:32:32] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 8 ms to minimize.
[2021-05-15 09:32:32] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2021-05-15 09:32:33] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 0 ms to minimize.
[2021-05-15 09:32:33] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 1 ms to minimize.
[2021-05-15 09:32:33] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2021-05-15 09:32:33] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 1 ms to minimize.
[2021-05-15 09:32:33] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2021-05-15 09:32:34] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2021-05-15 09:32:34] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2021-05-15 09:32:34] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2021-05-15 09:32:34] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2021-05-15 09:32:34] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2021-05-15 09:32:34] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 5 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2021-05-15 09:32:35] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2021-05-15 09:32:36] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2021-05-15 09:32:36] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2021-05-15 09:32:36] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7592 ms
[2021-05-15 09:32:36] [INFO ] Computed and/alt/rep : 1052/2353/1052 causal constraints (skipped 0 transitions) in 57 ms.
[2021-05-15 09:32:48] [INFO ] Added : 850 causal constraints over 170 iterations in 11929 ms. Result :unknown
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(X(X((p1&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1073 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 46 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:32:48] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:32:48] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:32:48] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:32:49] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:32:49] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:32:50] [INFO ] Dead Transitions using invariants and state equation in 537 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 439 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020B-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 8}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 11}], [{ cond=true, acceptance={} source=5 dest: 9}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 11}], [{ cond=(NOT p2), acceptance={0} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 10}]], initial=7, aps=[p0:(EQ s855 1), p1:(EQ s7 1), p2:(AND (EQ s7 0) (EQ s500 0))], 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-020B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-00 finished in 2392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(((p0&&X(p1))||G(p1))))||(p2&&X(F(((p0&&X(p1))||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1073 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 40 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:32:50] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:32:50] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:32:50] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:32:51] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:32:51] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:32:52] [INFO ] Dead Transitions using invariants and state equation in 603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-020B-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s875 0), p0:(NEQ s520 1), p1:(NEQ s367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 245 reset in 548 ms.
Product exploration explored 100000 steps with 260 reset in 497 ms.
Knowledge obtained : [(NOT p2), p0, p1]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 250 reset in 398 ms.
Product exploration explored 100000 steps with 261 reset in 438 ms.
[2021-05-15 09:32:54] [INFO ] Flatten gal took : 51 ms
[2021-05-15 09:32:55] [INFO ] Flatten gal took : 51 ms
[2021-05-15 09:32:55] [INFO ] Time to serialize gal into /tmp/LTL13822104952443831372.gal : 19 ms
[2021-05-15 09:32:55] [INFO ] Time to serialize properties into /tmp/LTL5725014836075380703.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/LTL13822104952443831372.gal, -t, CGAL, -LTL, /tmp/LTL5725014836075380703.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/LTL13822104952443831372.gal -t CGAL -LTL /tmp/LTL5725014836075380703.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F((("(p582!=1)")&&(X("(p410!=1)")))||(G("(p410!=1)")))))||(("(p986!=0)")&&(X(F((("(p582!=1)")&&(X("(p410!=1)")))||(G("(p410!=1)")))))))))
Formula 0 simplified : !F(GF(("(p582!=1)" & X"(p410!=1)") | G"(p410!=1)") | ("(p986!=0)" & XF(("(p582!=1)" & X"(p410!=1)") | G"(p410!=1)")))
Detected timeout of ITS tools.
[2021-05-15 09:33:10] [INFO ] Flatten gal took : 55 ms
[2021-05-15 09:33:10] [INFO ] Applying decomposition
[2021-05-15 09:33:10] [INFO ] Flatten gal took : 45 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/graph5876499253487759613.txt, -o, /tmp/graph5876499253487759613.bin, -w, /tmp/graph5876499253487759613.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/graph5876499253487759613.bin, -l, -1, -v, -w, /tmp/graph5876499253487759613.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 09:33:10] [INFO ] Decomposing Gal with order
[2021-05-15 09:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 09:33:10] [INFO ] Removed a total of 460 redundant transitions.
[2021-05-15 09:33:10] [INFO ] Flatten gal took : 120 ms
[2021-05-15 09:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-15 09:33:10] [INFO ] Time to serialize gal into /tmp/LTL582383267546073290.gal : 17 ms
[2021-05-15 09:33:10] [INFO ] Time to serialize properties into /tmp/LTL14739220744009003140.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/LTL582383267546073290.gal, -t, CGAL, -LTL, /tmp/LTL14739220744009003140.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/LTL582383267546073290.gal -t CGAL -LTL /tmp/LTL14739220744009003140.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F((("(i9.i1.u197.p582!=1)")&&(X("(i6.i2.u138.p410!=1)")))||(G("(i6.i2.u138.p410!=1)")))))||(("(i16.i5.u332.p986!=0)")&&(X(F((("(i9.i1.u197.p582!=1)")&&(X("(i6.i2.u138.p410!=1)")))||(G("(i6.i2.u138.p410!=1)")))))))))
Formula 0 simplified : !F(GF(("(i9.i1.u197.p582!=1)" & X"(i6.i2.u138.p410!=1)") | G"(i6.i2.u138.p410!=1)") | ("(i16.i5.u332.p986!=0)" & XF(("(i9.i1.u197.p582!=1)" & X"(i6.i2.u138.p410!=1)") | G"(i6.i2.u138.p410!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17335456466402180235
[2021-05-15 09:33:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17335456466402180235
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/ltsmin17335456466402180235]
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/ltsmin17335456466402180235] 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/ltsmin17335456466402180235] 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 ShieldIIPs-PT-020B-01 finished in 36138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1064 transition count 1044
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1064 transition count 1044
Applied a total of 18 rules in 42 ms. Remains 1064 /1073 variables (removed 9) and now considering 1044/1053 (removed 9) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2021-05-15 09:33:26] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:33:27] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 1044 rows 1064 cols
[2021-05-15 09:33:27] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:27] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
// Phase 1: matrix 1044 rows 1064 cols
[2021-05-15 09:33:27] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:28] [INFO ] Dead Transitions using invariants and state equation in 556 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1064/1073 places, 1044/1053 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s1038 1), p1:(EQ s384 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-02 finished in 1902 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))&&(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1073 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1062 transition count 1042
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1062 transition count 1042
Applied a total of 22 rules in 42 ms. Remains 1062 /1073 variables (removed 11) and now considering 1042/1053 (removed 11) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:33:28] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:29] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:33:29] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:29] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:33:29] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:30] [INFO ] Dead Transitions using invariants and state equation in 501 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1062/1073 places, 1042/1053 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s467 1), p2:(EQ s347 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 80 reset in 485 ms.
Product exploration explored 100000 steps with 79 reset in 597 ms.
Knowledge obtained : [(NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 77 reset in 545 ms.
Product exploration explored 100000 steps with 76 reset in 568 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Support contains 2 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 99 place count 1062 transition count 1047
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 141 place count 1062 transition count 1047
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 7 ms
Iterating global reduction 1 with 419 rules applied. Total rules applied 560 place count 1062 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 700 place count 922 transition count 907
Deduced a syphon composed of 420 places in 2 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 840 place count 922 transition count 907
Deduced a syphon composed of 420 places in 22 ms
Applied a total of 840 rules in 534 ms. Remains 922 /1062 variables (removed 140) and now considering 907/1042 (removed 135) transitions.
[2021-05-15 09:33:33] [INFO ] Redundant transitions in 276 ms returned [906]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[906]
// Phase 1: matrix 906 rows 922 cols
[2021-05-15 09:33:33] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:33:34] [INFO ] Dead Transitions using invariants and state equation in 470 ms returned []
Starting structural reductions, iteration 1 : 922/1062 places, 906/1042 transitions.
Deduced a syphon composed of 420 places in 1 ms
Applied a total of 0 rules in 38 ms. Remains 922 /922 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2021-05-15 09:33:34] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 906 rows 922 cols
[2021-05-15 09:33:34] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:33:34] [INFO ] Dead Transitions using invariants and state equation in 495 ms returned []
Finished structural reductions, in 2 iterations. Remains : 922/1062 places, 906/1042 transitions.
Product exploration explored 100000 steps with 188 reset in 761 ms.
Product exploration explored 100000 steps with 188 reset in 678 ms.
Starting structural reductions, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 28 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:33:36] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:36] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:33:36] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:37] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:33:37] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:33:38] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1042/1042 transitions.
[2021-05-15 09:33:38] [INFO ] Flatten gal took : 36 ms
[2021-05-15 09:33:38] [INFO ] Flatten gal took : 34 ms
[2021-05-15 09:33:38] [INFO ] Time to serialize gal into /tmp/LTL1082609238664220545.gal : 5 ms
[2021-05-15 09:33:38] [INFO ] Time to serialize properties into /tmp/LTL708566989717275503.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/LTL1082609238664220545.gal, -t, CGAL, -LTL, /tmp/LTL708566989717275503.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/LTL1082609238664220545.gal -t CGAL -LTL /tmp/LTL708566989717275503.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 13 LTL properties
Checking formula 0 : !((F((G(F((("(p582!=1)")&&(X("(p410!=1)")))||(G("(p410!=1)")))))||(("(p986!=0)")&&(X(F((("(p582!=1)")&&(X("(p410!=1)")))||(G("(p410!=1)")))))))))
Formula 0 simplified : !F(GF(("(p582!=1)" & X"(p410!=1)") | G"(p410!=1)") | ("(p986!=0)" & XF(("(p582!=1)" & X"(p410!=1)") | G"(p410!=1)")))
Detected timeout of ITS tools.
[2021-05-15 09:33:53] [INFO ] Flatten gal took : 34 ms
[2021-05-15 09:33:53] [INFO ] Applying decomposition
[2021-05-15 09:33:53] [INFO ] Flatten gal took : 35 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/graph14285890636578379174.txt, -o, /tmp/graph14285890636578379174.bin, -w, /tmp/graph14285890636578379174.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/graph14285890636578379174.bin, -l, -1, -v, -w, /tmp/graph14285890636578379174.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 09:33:53] [INFO ] Decomposing Gal with order
[2021-05-15 09:33:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 09:33:53] [INFO ] Removed a total of 460 redundant transitions.
[2021-05-15 09:33:53] [INFO ] Flatten gal took : 67 ms
[2021-05-15 09:33:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-15 09:33:53] [INFO ] Time to serialize gal into /tmp/LTL10583228641868104323.gal : 12 ms
[2021-05-15 09:33:53] [INFO ] Time to serialize properties into /tmp/LTL15738129838909311307.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/LTL10583228641868104323.gal, -t, CGAL, -LTL, /tmp/LTL15738129838909311307.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/LTL10583228641868104323.gal -t CGAL -LTL /tmp/LTL15738129838909311307.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F((G(F((("(i9.i6.u196.p582!=1)")&&(X("(i6.i3.u139.p410!=1)")))||(G("(i6.i3.u139.p410!=1)")))))||(("(i16.i4.u329.p986!=0)")&&(X(F((("(i9.i6.u196.p582!=1)")&&(X("(i6.i3.u139.p410!=1)")))||(G("(i6.i3.u139.p410!=1)")))))))))
Formula 0 simplified : !F(GF(("(i9.i6.u196.p582!=1)" & X"(i6.i3.u139.p410!=1)") | G"(i6.i3.u139.p410!=1)") | ("(i16.i4.u329.p986!=0)" & XF(("(i9.i6.u196.p582!=1)" & X"(i6.i3.u139.p410!=1)") | G"(i6.i3.u139.p410!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7665930258458675076
[2021-05-15 09:34:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7665930258458675076
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/ltsmin7665930258458675076]
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/ltsmin7665930258458675076] 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/ltsmin7665930258458675076] 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 ShieldIIPs-PT-020B-03 finished in 41143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p0))&&(G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 9 out of 1073 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 124 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:34:09] [INFO ] Computed 181 place invariants in 13 ms
[2021-05-15 09:34:10] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:34:10] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 09:34:10] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:34:10] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 09:34:11] [INFO ] Dead Transitions using invariants and state equation in 561 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020B-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s668 0) (EQ s678 0) (EQ s697 0) (AND (EQ s90 1) (EQ s92 1))), p2:(OR (NEQ s486 1) (NEQ s199 1) (NEQ s207 1) (NEQ s228 1)), p0:(OR (NEQ s668 1) (NEQ s678 1) (NEQ s697 1))], nbAcceptance=1, 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 50000 reset in 572 ms.
Product exploration explored 100000 steps with 50000 reset in 560 ms.
Knowledge obtained : [p1, p2, p0]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 53 ms :[(AND p1 (NOT p0)), (NOT p0)]
Support contains 5 out of 1063 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1062 transition count 1042
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1062 transition count 1042
Applied a total of 2 rules in 38 ms. Remains 1062 /1063 variables (removed 1) and now considering 1042/1043 (removed 1) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:34:13] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 09:34:13] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:34:13] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:34:14] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2021-05-15 09:34:14] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:34:14] [INFO ] Dead Transitions using invariants and state equation in 515 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1062/1063 places, 1042/1043 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 531 ms.
Product exploration explored 100000 steps with 50000 reset in 557 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(AND p1 (NOT p0)), (NOT p0)]
Support contains 5 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 99 place count 1062 transition count 1047
Deduced a syphon composed of 142 places in 2 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 142 place count 1062 transition count 1047
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 1 with 418 rules applied. Total rules applied 560 place count 1062 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 698 place count 924 transition count 909
Deduced a syphon composed of 422 places in 0 ms
Iterating global reduction 1 with 138 rules applied. Total rules applied 836 place count 924 transition count 909
Deduced a syphon composed of 422 places in 0 ms
Applied a total of 836 rules in 219 ms. Remains 924 /1062 variables (removed 138) and now considering 909/1042 (removed 133) transitions.
[2021-05-15 09:34:16] [INFO ] Redundant transitions in 57 ms returned [908]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[908]
// Phase 1: matrix 908 rows 924 cols
[2021-05-15 09:34:16] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 09:34:16] [INFO ] Dead Transitions using invariants and state equation in 465 ms returned []
Starting structural reductions, iteration 1 : 924/1062 places, 908/1042 transitions.
Deduced a syphon composed of 422 places in 0 ms
Applied a total of 0 rules in 37 ms. Remains 924 /924 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2021-05-15 09:34:16] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 908 rows 924 cols
[2021-05-15 09:34:16] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 09:34:17] [INFO ] Dead Transitions using invariants and state equation in 507 ms returned []
Finished structural reductions, in 2 iterations. Remains : 924/1062 places, 908/1042 transitions.
Product exploration explored 100000 steps with 50000 reset in 3195 ms.
Product exploration explored 100000 steps with 50000 reset in 3233 ms.
Starting structural reductions, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Applied a total of 0 rules in 17 ms. Remains 1063 /1063 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:34:23] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 09:34:24] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:34:24] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 09:34:24] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2021-05-15 09:34:24] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 09:34:25] [INFO ] Dead Transitions using invariants and state equation in 536 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1043/1043 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621071267206

--------------------
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="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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 r216-tall-162098204800269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B 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 ;