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.r311-tall-162132108600597.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 UtilityControlRoom-PT-Z4T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108600597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 136K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 604K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 266K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 990K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 19K May 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K May 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 11 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 11 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 191K May 12 08:13 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 UtilityControlRoom-PT-Z4T3N06-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-15

=== Now, execution of the tool begins

BK_START 1621486310046

Running Version 0
[2021-05-20 04:51:51] [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-20 04:51:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 04:51:51] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-20 04:51:51] [INFO ] Transformed 228 places.
[2021-05-20 04:51:51] [INFO ] Transformed 450 transitions.
[2021-05-20 04:51:51] [INFO ] Parsed PT model containing 228 places and 450 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 04:51:51] [INFO ] Reduced 18 identical enabling conditions.
[2021-05-20 04:51:51] [INFO ] Reduced 18 identical enabling conditions.
[2021-05-20 04:51:51] [INFO ] Reduced 18 identical enabling conditions.
[2021-05-20 04:51:51] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 173 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 14 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2021-05-20 04:51:51] [INFO ] Computed 15 place invariants in 14 ms
[2021-05-20 04:51:52] [INFO ] Implicit Places using invariants in 183 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
// Phase 1: matrix 354 rows 227 cols
[2021-05-20 04:51:52] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-20 04:51:52] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Starting structural reductions, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 14 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2021-05-20 04:51:52] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-20 04:51:52] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 227/228 places, 354/354 transitions.
[2021-05-20 04:51:52] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-20 04:51:52] [INFO ] Flatten gal took : 61 ms
FORMULA UtilityControlRoom-PT-Z4T3N06-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 04:51:52] [INFO ] Flatten gal took : 32 ms
[2021-05-20 04:51:52] [INFO ] Input system was already deterministic with 354 transitions.
Finished random walk after 751 steps, including 0 resets, run visited all 20 properties in 13 ms. (steps per millisecond=57 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 125 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2021-05-20 04:51:53] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-20 04:51:53] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 354 rows 227 cols
[2021-05-20 04:51:53] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-20 04:51:53] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 227 cols
[2021-05-20 04:51:53] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-20 04:51:53] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 354/354 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (GEQ s64 1) (GEQ s131 1) (GEQ s129 1) (GEQ s66 1) (GEQ s68 1) (GEQ s135 1) (GEQ s133 1) (GEQ s70 1) (GEQ s139 1) (GEQ s72 1) (GEQ s74 1) (GEQ s137 1) (GEQ s76 1) (GEQ s143 1) (GEQ s141 1) (GEQ s78 1) (GEQ s80 1) (GEQ s147 1) (GEQ s145 1) (GEQ s82 1) (GEQ s84 1) (GEQ s151 1) (GEQ s149 1) (GEQ s86 1) (GEQ s88 1) (GEQ s90 1) (GEQ s153 1) (GEQ s92 1) (GEQ s94 1) (GEQ s96 1) (GEQ s98 1) (GEQ s100 1) (GEQ s102 1) (GEQ s106 1) (GEQ s104 1) (GEQ s110 1) (GEQ s108 1) (GEQ s114 1) (GEQ s112 1) (GEQ s118 1) (GEQ s116 1) (GEQ s122 1) (GEQ s59 1) (GEQ s120 1) (GEQ s61 1) (GEQ s126 1) (GEQ s124 1) (GEQ s63 1) (GEQ s65 1) (GEQ s130 1) (GEQ s128 1) (GEQ s67 1) (GEQ s69 1) (GEQ s134 1) (GEQ s132 1) (GEQ s71 1) (GEQ s138 1) (GEQ s73 1) (GEQ s75 1) (GEQ s136 1) (GEQ s77 1) (GEQ s142 1) (GEQ s140 1) (GEQ s79 1) (GEQ s81 1) (GEQ s146 1) (GEQ s144 1) (GEQ s83 1) (GEQ s85 1) (GEQ s150 1) (GEQ s148 1) (GEQ s87 1) (GEQ s89 1) (GEQ s91 1) (GEQ s152 1) (GEQ s93 1) (GEQ s95 1) (GEQ s97 1) (GEQ s99 1) (GEQ s101 1) (GEQ s103 1) (GEQ s107 1) (GEQ s105 1) (GEQ s111 1) (GEQ s109 1) (GEQ s115 1) (GEQ s113 1) (GEQ s119 1) (GEQ s117 1) (GEQ s123 1) (GEQ s58 1) (GEQ s121 1) (GEQ s60 1) (GEQ s127 1) (GEQ s125 1) (GEQ s62 1)), p1:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s28 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s31 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s30 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s32 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s27 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s29 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s24 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s30 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s30 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s33 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s27 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s32 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s28 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s29 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s26 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s32 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s24 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s29 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s32 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s25 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s31 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s31 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s28 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s28 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s25 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s29 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s31 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s26 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s30 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s33 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s27 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s184 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s184 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s184 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-00 finished in 697 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((p0&&X(p1)))||X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 15 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:51:53] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:51:53] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:51:53] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:51:53] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:51:53] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-20 04:51:54] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s93 1) (GEQ s127 1)) (AND (GEQ s103 1) (GEQ s130 1)) (AND (GEQ s83 1) (GEQ s125 1)) (AND (GEQ s88 1) (GEQ s126 1)) (AND (GEQ s96 1) (GEQ s128 1)) (AND (GEQ s100 1) (GEQ s129 1)) (AND (GEQ s98 1) (GEQ s129 1)) (AND (GEQ s90 1) (GEQ s127 1)) (AND (GEQ s101 1) (GEQ s129 1)) (AND (GEQ s105 1) (GEQ s130 1)) (AND (GEQ s84 1) (GEQ s125 1)) (AND (GEQ s86 1) (GEQ s126 1)) (AND (GEQ s82 1) (GEQ s125 1)) (AND (GEQ s92 1) (GEQ s127 1)) (AND (GEQ s104 1) (GEQ s130 1)) (AND (GEQ s94 1) (GEQ s128 1)) (AND (GEQ s99 1) (GEQ s129 1)) (AND (GEQ s102 1) (GEQ s130 1)) (AND (GEQ s97 1) (GEQ s128 1)) (AND (GEQ s95 1) (GEQ s128 1)) (AND (GEQ s91 1) (GEQ s127 1)) (AND (GEQ s89 1) (GEQ s126 1)) (AND (GEQ s87 1) (GEQ s126 1)) (AND (GEQ s85 1) (GEQ s125 1))), p1:(AND (LT s107 1) (LT s106 1) (LT s111 1) (LT s110 1) (LT s109 1) (LT s108 1) (LT s114 1) (LT s113 1) (LT s118 1) (LT s117 1) (LT s116 1) (LT s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4304 reset in 445 ms.
Product exploration explored 100000 steps with 4326 reset in 419 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 4314 reset in 384 ms.
Product exploration explored 100000 steps with 4329 reset in 405 ms.
[2021-05-20 04:51:56] [INFO ] Flatten gal took : 17 ms
[2021-05-20 04:51:56] [INFO ] Flatten gal took : 16 ms
[2021-05-20 04:51:56] [INFO ] Time to serialize gal into /tmp/LTL2059382341719544778.gal : 12 ms
[2021-05-20 04:51:56] [INFO ] Time to serialize properties into /tmp/LTL4280620372883684003.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/LTL2059382341719544778.gal, -t, CGAL, -LTL, /tmp/LTL4280620372883684003.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/LTL2059382341719544778.gal -t CGAL -LTL /tmp/LTL4280620372883684003.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F(("(((((((((((((((((((((((((StartSecuring_2_3>=1)&&(ClientsTimeout_2>=1))||((StartSecuring_5_1>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_0_1>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_2>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_3_2>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_4_2>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_4_0>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_2_0>=1)&&(ClientsTimeout_2>=1)))||((StartSecuring_4_3>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_5_3>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_0_2>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_0>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_2_2>=1)&&(ClientsTimeout_2>=1)))||((StartSecuring_5_2>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_3_0>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_4_1>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_5_0>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_3_3>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_3_1>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_2_1>=1)&&(ClientsTimeout_2>=1)))||((StartSecuring_1_3>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_1_1>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_3>=1)&&(ClientsTimeout_0>=1)))")&&(X("((((((((((((ControlRoomDispatch_1<1)&&(ControlRoomDispatch_0<1))&&(ControlRoomDispatch_5<1))&&(ControlRoomDispatch_4<1))&&(ControlRoomDispatch_3<1))&&(ControlRoomDispatch_2<1))&&(Finished_1<1))&&(Finished_0<1))&&(Finished_5<1))&&(Finished_4<1))&&(Finished_3<1))&&(Finished_2<1))"))))||(X(G("(((((((((((((((((((((((((StartSecuring_2_3<1)||(ClientsTimeout_2<1))&&((StartSecuring_5_1<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_1_2<1)||(ClientsTimeout_1<1)))&&((StartSecuring_3_2<1)||(ClientsTimeout_3<1)))&&((StartSecuring_4_2<1)||(ClientsTimeout_4<1)))&&((StartSecuring_4_0<1)||(ClientsTimeout_4<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_4_3<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_3<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_2<1)||(ClientsTimeout_0<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))&&((StartSecuring_2_2<1)||(ClientsTimeout_2<1)))&&((StartSecuring_5_2<1)||(ClientsTimeout_5<1)))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_4_1<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_0<1)||(ClientsTimeout_5<1)))&&((StartSecuring_3_3<1)||(ClientsTimeout_3<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_3<1)||(ClientsTimeout_1<1)))&&((StartSecuring_1_1<1)||(ClientsTimeout_1<1)))&&((StartSecuring_0_3<1)||(ClientsTimeout_0<1)))"))))))
Formula 0 simplified : !X(F("(((((((((((((((((((((((((StartSecuring_2_3>=1)&&(ClientsTimeout_2>=1))||((StartSecuring_5_1>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_0_1>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_2>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_3_2>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_4_2>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_4_0>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_2_0>=1)&&(ClientsTimeout_2>=1)))||((StartSecuring_4_3>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_5_3>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_0_2>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_0>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_2_2>=1)&&(ClientsTimeout_2>=1)))||((StartSecuring_5_2>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_3_0>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_4_1>=1)&&(ClientsTimeout_4>=1)))||((StartSecuring_5_0>=1)&&(ClientsTimeout_5>=1)))||((StartSecuring_3_3>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_3_1>=1)&&(ClientsTimeout_3>=1)))||((StartSecuring_2_1>=1)&&(ClientsTimeout_2>=1)))||((StartSecuring_1_3>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_1_1>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_3>=1)&&(ClientsTimeout_0>=1)))" & X"((((((((((((ControlRoomDispatch_1<1)&&(ControlRoomDispatch_0<1))&&(ControlRoomDispatch_5<1))&&(ControlRoomDispatch_4<1))&&(ControlRoomDispatch_3<1))&&(ControlRoomDispatch_2<1))&&(Finished_1<1))&&(Finished_0<1))&&(Finished_5<1))&&(Finished_4<1))&&(Finished_3<1))&&(Finished_2<1))") | XG"(((((((((((((((((((((((((StartSecuring_2_3<1)||(ClientsTimeout_2<1))&&((StartSecuring_5_1<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_1_2<1)||(ClientsTimeout_1<1)))&&((StartSecuring_3_2<1)||(ClientsTimeout_3<1)))&&((StartSecuring_4_2<1)||(ClientsTimeout_4<1)))&&((StartSecuring_4_0<1)||(ClientsTimeout_4<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_4_3<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_3<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_2<1)||(ClientsTimeout_0<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))&&((StartSecuring_2_2<1)||(ClientsTimeout_2<1)))&&((StartSecuring_5_2<1)||(ClientsTimeout_5<1)))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_4_1<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_0<1)||(ClientsTimeout_5<1)))&&((StartSecuring_3_3<1)||(ClientsTimeout_3<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_3<1)||(ClientsTimeout_1<1)))&&((StartSecuring_1_1<1)||(ClientsTimeout_1<1)))&&((StartSecuring_0_3<1)||(ClientsTimeout_0<1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-20 04:52:11] [INFO ] Flatten gal took : 16 ms
[2021-05-20 04:52:11] [INFO ] Applying decomposition
[2021-05-20 04:52:11] [INFO ] Flatten gal took : 16 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/graph17568175838276470221.txt, -o, /tmp/graph17568175838276470221.bin, -w, /tmp/graph17568175838276470221.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/graph17568175838276470221.bin, -l, -1, -v, -w, /tmp/graph17568175838276470221.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 04:52:11] [INFO ] Decomposing Gal with order
[2021-05-20 04:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 04:52:11] [INFO ] Removed a total of 405 redundant transitions.
[2021-05-20 04:52:11] [INFO ] Flatten gal took : 67 ms
[2021-05-20 04:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 13 ms.
[2021-05-20 04:52:11] [INFO ] Time to serialize gal into /tmp/LTL7458007595563981871.gal : 5 ms
[2021-05-20 04:52:11] [INFO ] Time to serialize properties into /tmp/LTL6703863303125331444.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/LTL7458007595563981871.gal, -t, CGAL, -LTL, /tmp/LTL6703863303125331444.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/LTL7458007595563981871.gal -t CGAL -LTL /tmp/LTL6703863303125331444.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(("(((((((((((((((((((((((((i2.i0.u34.StartSecuring_2_3>=1)&&(i2.i0.u46.ClientsTimeout_2>=1))||((i5.i1.u58.StartSecuring_5_1>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i0.i0.u49.StartSecuring_0_1>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))||((i1.i0.u30.StartSecuring_1_2>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i4.u36.StartSecuring_3_2>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i6.i1.u56.StartSecuring_4_2>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i6.i1.u54.StartSecuring_4_0>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i2.i0.u31.StartSecuring_2_0>=1)&&(i2.i0.u46.ClientsTimeout_2>=1)))||((i6.i1.u57.StartSecuring_4_3>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i5.i1.u59.StartSecuring_5_3>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i0.i1.u28.StartSecuring_0_2>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))||((i1.i1.u50.StartSecuring_1_0>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i0.i1.u27.StartSecuring_0_0>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))||((i2.i0.u33.StartSecuring_2_2>=1)&&(i2.i0.u46.ClientsTimeout_2>=1)))||((i5.i1.u39.StartSecuring_5_2>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i4.u53.StartSecuring_3_0>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i6.i1.u55.StartSecuring_4_1>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i5.i1.u38.StartSecuring_5_0>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i4.u37.StartSecuring_3_3>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i4.u35.StartSecuring_3_1>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i2.i0.u32.StartSecuring_2_1>=1)&&(i2.i0.u46.ClientsTimeout_2>=1)))||((i1.i1.u52.StartSecuring_1_3>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i1.i1.u51.StartSecuring_1_1>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i0.i1.u29.StartSecuring_0_3>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))")&&(X("((((((((((((i1.i1.u5.ControlRoomDispatch_1<1)&&(i0.i1.u4.ControlRoomDispatch_0<1))&&(i5.i0.u14.ControlRoomDispatch_5<1))&&(i6.i0.u11.ControlRoomDispatch_4<1))&&(i3.u10.ControlRoomDispatch_3<1))&&(i2.i1.u8.ControlRoomDispatch_2<1))&&(i1.i1.u40.Finished_1<1))&&(i0.i1.u0.Finished_0<1))&&(i5.i1.u2.Finished_5<1))&&(i6.i1.u1.Finished_4<1))&&(i4.u42.Finished_3<1))&&(i2.i0.u41.Finished_2<1))"))))||(X(G("(((((((((((((((((((((((((i2.i0.u34.StartSecuring_2_3<1)||(i2.i0.u46.ClientsTimeout_2<1))&&((i5.i1.u58.StartSecuring_5_1<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i0.i0.u49.StartSecuring_0_1<1)||(i0.i1.u45.ClientsTimeout_0<1)))&&((i1.i0.u30.StartSecuring_1_2<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i4.u36.StartSecuring_3_2<1)||(i4.u47.ClientsTimeout_3<1)))&&((i6.i1.u56.StartSecuring_4_2<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i6.i1.u54.StartSecuring_4_0<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i2.i0.u31.StartSecuring_2_0<1)||(i2.i0.u46.ClientsTimeout_2<1)))&&((i6.i1.u57.StartSecuring_4_3<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i5.i1.u59.StartSecuring_5_3<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i0.i1.u28.StartSecuring_0_2<1)||(i0.i1.u45.ClientsTimeout_0<1)))&&((i1.i1.u50.StartSecuring_1_0<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i0.i1.u27.StartSecuring_0_0<1)||(i0.i1.u45.ClientsTimeout_0<1)))&&((i2.i0.u33.StartSecuring_2_2<1)||(i2.i0.u46.ClientsTimeout_2<1)))&&((i5.i1.u39.StartSecuring_5_2<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i4.u53.StartSecuring_3_0<1)||(i4.u47.ClientsTimeout_3<1)))&&((i6.i1.u55.StartSecuring_4_1<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i5.i1.u38.StartSecuring_5_0<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i4.u37.StartSecuring_3_3<1)||(i4.u47.ClientsTimeout_3<1)))&&((i4.u35.StartSecuring_3_1<1)||(i4.u47.ClientsTimeout_3<1)))&&((i2.i0.u32.StartSecuring_2_1<1)||(i2.i0.u46.ClientsTimeout_2<1)))&&((i1.i1.u52.StartSecuring_1_3<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i1.i1.u51.StartSecuring_1_1<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i0.i1.u29.StartSecuring_0_3<1)||(i0.i1.u45.ClientsTimeout_0<1)))"))))))
Formula 0 simplified : !X(F("(((((((((((((((((((((((((i2.i0.u34.StartSecuring_2_3>=1)&&(i2.i0.u46.ClientsTimeout_2>=1))||((i5.i1.u58.StartSecuring_5_1>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i0.i0.u49.StartSecuring_0_1>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))||((i1.i0.u30.StartSecuring_1_2>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i4.u36.StartSecuring_3_2>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i6.i1.u56.StartSecuring_4_2>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i6.i1.u54.StartSecuring_4_0>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i2.i0.u31.StartSecuring_2_0>=1)&&(i2.i0.u46.ClientsTimeout_2>=1)))||((i6.i1.u57.StartSecuring_4_3>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i5.i1.u59.StartSecuring_5_3>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i0.i1.u28.StartSecuring_0_2>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))||((i1.i1.u50.StartSecuring_1_0>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i0.i1.u27.StartSecuring_0_0>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))||((i2.i0.u33.StartSecuring_2_2>=1)&&(i2.i0.u46.ClientsTimeout_2>=1)))||((i5.i1.u39.StartSecuring_5_2>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i4.u53.StartSecuring_3_0>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i6.i1.u55.StartSecuring_4_1>=1)&&(i6.i1.u44.ClientsTimeout_4>=1)))||((i5.i1.u38.StartSecuring_5_0>=1)&&(i5.i1.u48.ClientsTimeout_5>=1)))||((i4.u37.StartSecuring_3_3>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i4.u35.StartSecuring_3_1>=1)&&(i4.u47.ClientsTimeout_3>=1)))||((i2.i0.u32.StartSecuring_2_1>=1)&&(i2.i0.u46.ClientsTimeout_2>=1)))||((i1.i1.u52.StartSecuring_1_3>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i1.i1.u51.StartSecuring_1_1>=1)&&(i1.i1.u43.ClientsTimeout_1>=1)))||((i0.i1.u29.StartSecuring_0_3>=1)&&(i0.i1.u45.ClientsTimeout_0>=1)))" & X"((((((((((((i1.i1.u5.ControlRoomDispatch_1<1)&&(i0.i1.u4.ControlRoomDispatch_0<1))&&(i5.i0.u14.ControlRoomDispatch_5<1))&&(i6.i0.u11.ControlRoomDispatch_4<1))&&(i3.u10.ControlRoomDispatch_3<1))&&(i2.i1.u8.ControlRoomDispatch_2<1))&&(i1.i1.u40.Finished_1<1))&&(i0.i1.u0.Finished_0<1))&&(i5.i1.u2.Finished_5<1))&&(i6.i1.u1.Finished_4<1))&&(i4.u42.Finished_3<1))&&(i2.i0.u41.Finished_2<1))") | XG"(((((((((((((((((((((((((i2.i0.u34.StartSecuring_2_3<1)||(i2.i0.u46.ClientsTimeout_2<1))&&((i5.i1.u58.StartSecuring_5_1<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i0.i0.u49.StartSecuring_0_1<1)||(i0.i1.u45.ClientsTimeout_0<1)))&&((i1.i0.u30.StartSecuring_1_2<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i4.u36.StartSecuring_3_2<1)||(i4.u47.ClientsTimeout_3<1)))&&((i6.i1.u56.StartSecuring_4_2<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i6.i1.u54.StartSecuring_4_0<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i2.i0.u31.StartSecuring_2_0<1)||(i2.i0.u46.ClientsTimeout_2<1)))&&((i6.i1.u57.StartSecuring_4_3<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i5.i1.u59.StartSecuring_5_3<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i0.i1.u28.StartSecuring_0_2<1)||(i0.i1.u45.ClientsTimeout_0<1)))&&((i1.i1.u50.StartSecuring_1_0<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i0.i1.u27.StartSecuring_0_0<1)||(i0.i1.u45.ClientsTimeout_0<1)))&&((i2.i0.u33.StartSecuring_2_2<1)||(i2.i0.u46.ClientsTimeout_2<1)))&&((i5.i1.u39.StartSecuring_5_2<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i4.u53.StartSecuring_3_0<1)||(i4.u47.ClientsTimeout_3<1)))&&((i6.i1.u55.StartSecuring_4_1<1)||(i6.i1.u44.ClientsTimeout_4<1)))&&((i5.i1.u38.StartSecuring_5_0<1)||(i5.i1.u48.ClientsTimeout_5<1)))&&((i4.u37.StartSecuring_3_3<1)||(i4.u47.ClientsTimeout_3<1)))&&((i4.u35.StartSecuring_3_1<1)||(i4.u47.ClientsTimeout_3<1)))&&((i2.i0.u32.StartSecuring_2_1<1)||(i2.i0.u46.ClientsTimeout_2<1)))&&((i1.i1.u52.StartSecuring_1_3<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i1.i1.u51.StartSecuring_1_1<1)||(i1.i1.u43.ClientsTimeout_1<1)))&&((i0.i1.u29.StartSecuring_0_3<1)||(i0.i1.u45.ClientsTimeout_0<1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1349 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,13.5235,297440,1,0,480266,1246,2554,1.23551e+06,141,6187,548413
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N06-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N06-01 finished in 32903 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 276 place count 101 transition count 204
Applied a total of 276 rules in 33 ms. Remains 101 /227 variables (removed 126) and now considering 204/354 (removed 150) transitions.
// Phase 1: matrix 204 rows 101 cols
[2021-05-20 04:52:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:26] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 204 rows 101 cols
[2021-05-20 04:52:26] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-20 04:52:26] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2021-05-20 04:52:26] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 204 rows 101 cols
[2021-05-20 04:52:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:26] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/227 places, 204/354 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-02 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:(OR (AND (GEQ s3 1) (GEQ s27 1) (GEQ s58 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s58 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s58 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s58 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s58 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s58 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s58 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s58 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s58 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s58 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s58 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s58 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s58 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s58 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s58 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s58 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s58 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s58 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 11115 reset in 354 ms.
Product exploration explored 100000 steps with 11184 reset in 376 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11079 reset in 357 ms.
Product exploration explored 100000 steps with 11026 reset in 367 ms.
[2021-05-20 04:52:28] [INFO ] Flatten gal took : 11 ms
[2021-05-20 04:52:28] [INFO ] Flatten gal took : 11 ms
[2021-05-20 04:52:28] [INFO ] Time to serialize gal into /tmp/LTL11864680881895584121.gal : 5 ms
[2021-05-20 04:52:28] [INFO ] Time to serialize properties into /tmp/LTL8494711369733852051.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/LTL11864680881895584121.gal, -t, CGAL, -LTL, /tmp/LTL8494711369733852051.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/LTL11864680881895584121.gal -t CGAL -LTL /tmp/LTL8494711369733852051.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((((((((((((IdleTechs_3>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))"))))
Formula 0 simplified : !GF"((((((((((((((((((((((((((IdleTechs_3>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))"
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
807 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,8.10497,266840,1,0,56,1.21057e+06,24,1,3247,1.43714e+06,146
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N06-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T3N06-02 finished in 11549 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 35 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Applied a total of 264 rules in 33 ms. Remains 107 /227 variables (removed 120) and now considering 210/354 (removed 144) transitions.
// Phase 1: matrix 210 rows 107 cols
[2021-05-20 04:52:38] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:38] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 210 rows 107 cols
[2021-05-20 04:52:38] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:38] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2021-05-20 04:52:38] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 210 rows 107 cols
[2021-05-20 04:52:38] [INFO ] Computed 14 place invariants in 14 ms
[2021-05-20 04:52:38] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/227 places, 210/354 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-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:(OR (GEQ s59 1) (GEQ s58 1) (GEQ s63 1) (GEQ s62 1) (GEQ s61 1) (GEQ s60 1) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s28 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s31 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s32 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s27 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s29 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s24 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s33 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s27 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s32 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s28 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s29 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s32 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s24 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s29 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s32 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s25 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s31 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s31 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s28 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s28 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s25 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s29 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s31 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s26 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s30 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s33 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s27 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s64 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 9546 reset in 404 ms.
Product exploration explored 100000 steps with 9472 reset in 483 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9605 reset in 387 ms.
Product exploration explored 100000 steps with 9297 reset in 395 ms.
[2021-05-20 04:52:40] [INFO ] Flatten gal took : 11 ms
[2021-05-20 04:52:40] [INFO ] Flatten gal took : 10 ms
[2021-05-20 04:52:40] [INFO ] Time to serialize gal into /tmp/LTL11631842983531271590.gal : 1 ms
[2021-05-20 04:52:40] [INFO ] Time to serialize properties into /tmp/LTL13199119966262247729.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/LTL11631842983531271590.gal, -t, CGAL, -LTL, /tmp/LTL13199119966262247729.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/LTL11631842983531271590.gal -t CGAL -LTL /tmp/LTL13199119966262247729.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((ControlRoomDispatch_1>=1)||(ControlRoomDispatch_0>=1))||(ControlRoomDispatch_5>=1))||(ControlRoomDispatch_4>=1))||(ControlRoomDispatch_3>=1))||(ControlRoomDispatch_2>=1))||(((IdleTechs_1>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))"))))
Formula 0 simplified : !GF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((ControlRoomDispatch_1>=1)||(ControlRoomDispatch_0>=1))||(ControlRoomDispatch_5>=1))||(ControlRoomDispatch_4>=1))||(ControlRoomDispatch_3>=1))||(ControlRoomDispatch_2>=1))||(((IdleTechs_1>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_3_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
198 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,2.0284,70984,1,0,31,301456,24,1,3554,172896,79
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N06-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T3N06-03 finished in 4400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(!p0))&&(F(p0)||p1))))], workingDir=/home/mcc/execution]
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 12 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:42] [INFO ] Computed 14 place invariants in 12 ms
[2021-05-20 04:52:42] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:42] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s112 1))), p1:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s112 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 3 reset in 975 ms.
Stack based approach found an accepted trace after 4737 steps with 0 reset with depth 4738 and stack size 4738 in 48 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-04 finished in 1400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(!p0))||(p1 U p0))))], workingDir=/home/mcc/execution]
Support contains 35 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 5 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:43] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:44] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:44] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:44] [INFO ] Computed 14 place invariants in 13 ms
[2021-05-20 04:52:44] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, false, p0, false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s112 1))), p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11782 steps with 2914 reset in 41 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-05 finished in 459 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 4 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:44] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:44] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:44] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:44] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:44] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:44] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s32 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s28 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s29 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s31 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s26 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s30 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s33 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s27 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s112 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s112 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s112 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s112 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-06 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 30 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 128 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 128 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 240 place count 110 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 258 place count 110 transition count 144
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 295 place count 91 transition count 126
Applied a total of 295 rules in 15 ms. Remains 91 /227 variables (removed 136) and now considering 126/354 (removed 228) transitions.
// Phase 1: matrix 126 rows 91 cols
[2021-05-20 04:52:44] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-20 04:52:44] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 126 rows 91 cols
[2021-05-20 04:52:44] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-20 04:52:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-20 04:52:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 126 rows 91 cols
[2021-05-20 04:52:44] [INFO ] Computed 13 place invariants in 7 ms
[2021-05-20 04:52:44] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/227 places, 126/354 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s65 1) (GEQ s87 1)) (AND (GEQ s75 1) (GEQ s90 1)) (AND (GEQ s55 1) (GEQ s85 1)) (AND (GEQ s60 1) (GEQ s86 1)) (AND (GEQ s68 1) (GEQ s88 1)) (AND (GEQ s72 1) (GEQ s89 1)) (AND (GEQ s70 1) (GEQ s89 1)) (AND (GEQ s62 1) (GEQ s87 1)) (AND (GEQ s73 1) (GEQ s89 1)) (AND (GEQ s77 1) (GEQ s90 1)) (AND (GEQ s56 1) (GEQ s85 1)) (AND (GEQ s58 1) (GEQ s86 1)) (AND (GEQ s54 1) (GEQ s85 1)) (AND (GEQ s64 1) (GEQ s87 1)) (AND (GEQ s76 1) (GEQ s90 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s71 1) (GEQ s89 1)) (AND (GEQ s74 1) (GEQ s90 1)) (AND (GEQ s69 1) (GEQ s88 1)) (AND (GEQ s67 1) (GEQ s88 1)) (AND (GEQ s63 1) (GEQ s87 1)) (AND (GEQ s61 1) (GEQ s86 1)) (AND (GEQ s59 1) (GEQ s86 1)) (AND (GEQ s57 1) (GEQ s85 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6693 reset in 239 ms.
Stack based approach found an accepted trace after 3167 steps with 214 reset with depth 17 and stack size 17 in 11 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-07 finished in 464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G((F(G(p0))&&(X(G(p2))||p1)))) U (p3&&X(G((F(G(p0))&&(X(G(p2))||p4))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 156 transition count 283
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 156 transition count 283
Applied a total of 142 rules in 5 ms. Remains 156 /227 variables (removed 71) and now considering 283/354 (removed 71) transitions.
// Phase 1: matrix 283 rows 156 cols
[2021-05-20 04:52:45] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:45] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 283 rows 156 cols
[2021-05-20 04:52:45] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:45] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 156 cols
[2021-05-20 04:52:45] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-20 04:52:45] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/227 places, 283/354 transitions.
Stuttering acceptance computed with spot in 544 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p2) (NOT p4))), (OR (NOT p3) (NOT p0) (AND (NOT p2) (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p0), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p4) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={0, 1} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={1} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p4)), acceptance={0, 1} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p4)), acceptance={0, 1} source=3 dest: 10}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=3 dest: 11}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p4) p1), acceptance={} source=4 dest: 11}, { cond=(AND p4 (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 5}, { cond=p0, acceptance={1} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={1} source=8 dest: 3}, { cond=(NOT p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p4) (NOT p2)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p3 (NOT p4) p2), acceptance={0} source=8 dest: 8}, { cond=(AND p4 p2), acceptance={} source=8 dest: 8}, { cond=(OR (AND p3 p2) (AND p4 p2)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p3) (NOT p4) (NOT p2)), acceptance={0, 1} source=8 dest: 10}, { cond=(AND (NOT p3) (NOT p4) p2), acceptance={0} source=8 dest: 10}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=8 dest: 11}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND p3 (NOT p4) p1), acceptance={} source=9 dest: 11}, { cond=(AND p4 (NOT p1)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=10 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND p3 p2), acceptance={0} source=10 dest: 8}, { cond=(AND p3 p2), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p3) p2), acceptance={} source=10 dest: 11}], [{ cond=(NOT p2), acceptance={} source=11 dest: 2}, { cond=(NOT p2), acceptance={} source=11 dest: 5}, { cond=(NOT p1), acceptance={} source=11 dest: 6}, { cond=(AND p1 p2), acceptance={} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 5}, { cond=(NOT p4), acceptance={} source=12 dest: 6}, { cond=(AND p4 p2), acceptance={} source=12 dest: 12}, { cond=(AND p4 (NOT p2)), acceptance={} source=12 dest: 13}], [{ cond=(NOT p4), acceptance={} source=13 dest: 6}, { cond=p4, acceptance={} source=13 dest: 13}]], initial=0, aps=[p3:(GEQ s70 1), p1:(OR (LT s3 1) (LT s29 1) (LT s113 1)), p0:(OR (LT s3 1) (LT s18 1) (LT s113 1)), p4:(OR (LT s3 1) (LT s29 1) (LT s113 1)), p2:(OR (LT s3 1) (LT s29 1) (LT s113 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 19487 steps with 0 reset with depth 19488 and stack size 19488 in 57 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-08 finished in 1164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(G(p1)&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:46] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:46] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:46] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 6}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LT s116 1), p2:(LT s113 1), p0:(LT s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-10 finished in 491 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||(F(p0)&&F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:46] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:46] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:46] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 155 cols
[2021-05-20 04:52:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:47] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s17 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 355 reset in 207 ms.
Product exploration explored 100000 steps with 360 reset in 219 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 377 reset in 222 ms.
Stack based approach found an accepted trace after 5404 steps with 19 reset with depth 161 and stack size 161 in 12 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-11 finished in 1188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 227 transition count 259
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 214 place count 132 transition count 235
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 214 place count 132 transition count 212
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 260 place count 109 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 262 place count 107 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 107 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 276 place count 95 transition count 152
Iterating global reduction 2 with 12 rules applied. Total rules applied 288 place count 95 transition count 152
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 299 place count 84 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 310 place count 84 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 320 place count 74 transition count 110
Iterating global reduction 2 with 10 rules applied. Total rules applied 330 place count 74 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 340 place count 74 transition count 100
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 388 place count 50 transition count 76
Applied a total of 388 rules in 22 ms. Remains 50 /227 variables (removed 177) and now considering 76/354 (removed 278) transitions.
// Phase 1: matrix 76 rows 50 cols
[2021-05-20 04:52:48] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:52:48] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 76 rows 50 cols
[2021-05-20 04:52:48] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:48] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-20 04:52:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 76 rows 50 cols
[2021-05-20 04:52:48] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:52:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/227 places, 76/354 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s36 1) (LT s44 1)), p1:(LT s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 82 reset in 213 ms.
Product exploration explored 100000 steps with 69 reset in 231 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 95 reset in 212 ms.
Product exploration explored 100000 steps with 86 reset in 227 ms.
[2021-05-20 04:52:49] [INFO ] Flatten gal took : 4 ms
[2021-05-20 04:52:49] [INFO ] Flatten gal took : 4 ms
[2021-05-20 04:52:49] [INFO ] Time to serialize gal into /tmp/LTL3868327127736789983.gal : 0 ms
[2021-05-20 04:52:49] [INFO ] Time to serialize properties into /tmp/LTL4091429278618873812.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/LTL3868327127736789983.gal, -t, CGAL, -LTL, /tmp/LTL4091429278618873812.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/LTL3868327127736789983.gal -t CGAL -LTL /tmp/LTL4091429278618873812.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((StartSecuring_0_0<1)||(ClientsTimeout_0<1))"))||(G(F("(MovetoZ_5_3_2<1)"))))))
Formula 0 simplified : !F(G"((StartSecuring_0_0<1)||(ClientsTimeout_0<1))" | GF"(MovetoZ_5_3_2<1)")
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
9 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.106188,20072,1,0,25,18404,34,14,1519,17063,68
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N06-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T3N06-13 finished in 1329 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(F(!p0))&&F(p1)) U G((p2||F(p3)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 156 transition count 283
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 156 transition count 283
Applied a total of 142 rules in 5 ms. Remains 156 /227 variables (removed 71) and now considering 283/354 (removed 71) transitions.
// Phase 1: matrix 283 rows 156 cols
[2021-05-20 04:52:49] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:49] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 283 rows 156 cols
[2021-05-20 04:52:49] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:52:49] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 156 cols
[2021-05-20 04:52:49] [INFO ] Computed 14 place invariants in 17 ms
[2021-05-20 04:52:49] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/227 places, 283/354 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s11 1) (GEQ s113 1)), p3:(GEQ s61 1), p1:(GEQ s7 1), p0:(LT s114 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 2080 reset in 207 ms.
Stack based approach found an accepted trace after 40243 steps with 860 reset with depth 33 and stack size 33 in 92 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-14 finished in 727 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621486370905

--------------------
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="UtilityControlRoom-PT-Z4T3N06"
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 UtilityControlRoom-PT-Z4T3N06, 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 r311-tall-162132108600597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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