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.r064-tall-162038397100341.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 DLCround-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397100341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 08:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 08:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 398K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620512614082

Running Version 0
[2021-05-08 22:23:35] [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-08 22:23:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:23:35] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2021-05-08 22:23:35] [INFO ] Transformed 229 places.
[2021-05-08 22:23:35] [INFO ] Transformed 1597 transitions.
[2021-05-08 22:23:35] [INFO ] Found NUPN structural information;
[2021-05-08 22:23:35] [INFO ] Parsed PT model containing 229 places and 1597 transitions in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 22:23:35] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA DLCround-PT-07a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 1437/1437 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 217 transition count 1301
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 217 transition count 1301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 217 transition count 1299
Drop transitions removed 427 transitions
Redundant transition composition rules discarded 427 transitions
Iterating global reduction 1 with 427 rules applied. Total rules applied 453 place count 217 transition count 872
Applied a total of 453 rules in 82 ms. Remains 217 /229 variables (removed 12) and now considering 872/1437 (removed 565) transitions.
[2021-05-08 22:23:36] [INFO ] Flow matrix only has 156 transitions (discarded 716 similar events)
// Phase 1: matrix 156 rows 217 cols
[2021-05-08 22:23:36] [INFO ] Computed 132 place invariants in 18 ms
[2021-05-08 22:23:36] [INFO ] Implicit Places using invariants in 528 ms returned [97, 98, 99, 101, 102, 103, 104, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 118, 120, 121, 122, 123, 125, 126, 128, 129, 130, 131, 132, 134, 135, 137, 139, 141, 142, 143, 145, 146, 147, 149, 150, 151, 152, 153, 156, 157, 158, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 179, 180, 181, 182, 183, 185, 186, 187, 188, 189, 190, 192, 193, 194, 198, 199, 200, 204, 205, 206, 207, 208, 209, 210, 211, 212, 214, 215, 216]
Discarding 94 places :
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Implicit Place search using SMT only with invariants took 556 ms to find 94 implicit places.
[2021-05-08 22:23:36] [INFO ] Flow matrix only has 156 transitions (discarded 211 similar events)
// Phase 1: matrix 156 rows 123 cols
[2021-05-08 22:23:36] [INFO ] Computed 38 place invariants in 2 ms
[2021-05-08 22:23:36] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Starting structural reductions, iteration 1 : 123/229 places, 367/1437 transitions.
Drop transitions removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 123 transition count 207
Applied a total of 160 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 207/367 (removed 160) transitions.
[2021-05-08 22:23:36] [INFO ] Flow matrix only has 156 transitions (discarded 51 similar events)
// Phase 1: matrix 156 rows 123 cols
[2021-05-08 22:23:36] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-08 22:23:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2021-05-08 22:23:36] [INFO ] Flow matrix only has 156 transitions (discarded 51 similar events)
// Phase 1: matrix 156 rows 123 cols
[2021-05-08 22:23:36] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-08 22:23:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 123/229 places, 207/1437 transitions.
[2021-05-08 22:23:37] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 22:23:37] [INFO ] Flatten gal took : 37 ms
FORMULA DLCround-PT-07a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 22:23:37] [INFO ] Flatten gal took : 13 ms
[2021-05-08 22:23:37] [INFO ] Input system was already deterministic with 207 transitions.
Finished random walk after 953 steps, including 0 resets, run visited all 27 properties in 15 ms. (steps per millisecond=63 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U X(X(p1)))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 100 transition count 207
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 35 place count 88 transition count 183
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 88 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 88 transition count 181
Applied a total of 49 rules in 5 ms. Remains 88 /123 variables (removed 35) and now considering 181/207 (removed 26) transitions.
[2021-05-08 22:23:37] [INFO ] Flow matrix only has 142 transitions (discarded 39 similar events)
// Phase 1: matrix 142 rows 88 cols
[2021-05-08 22:23:37] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-08 22:23:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-08 22:23:37] [INFO ] Flow matrix only has 142 transitions (discarded 39 similar events)
// Phase 1: matrix 142 rows 88 cols
[2021-05-08 22:23:37] [INFO ] Computed 15 place invariants in 5 ms
[2021-05-08 22:23:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:37] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2021-05-08 22:23:37] [INFO ] Flow matrix only has 142 transitions (discarded 39 similar events)
// Phase 1: matrix 142 rows 88 cols
[2021-05-08 22:23:37] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-08 22:23:37] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/123 places, 181/207 transitions.
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-07a-00 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 6}, { cond=(NOT p2), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={} source=3 dest: 7}, { cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 10}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(OR (EQ s66 0) (EQ s87 0)), p0:(AND (EQ s68 1) (EQ s86 1)), p1:(AND (EQ s20 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 519 steps with 85 reset in 21 ms.
FORMULA DLCround-PT-07a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-00 finished in 725 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Graph (trivial) has 194 edges and 123 vertex of which 89 / 123 are part of one of the 12 SCC in 3 ms
Free SCC test removed 77 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Graph (complete) has 68 edges and 46 vertex of which 22 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 22 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 30
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 13 place count 12 transition count 21
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 12 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 12 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 12 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 11 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 11 transition count 18
Applied a total of 27 rules in 16 ms. Remains 11 /123 variables (removed 112) and now considering 18/207 (removed 189) transitions.
[2021-05-08 22:23:37] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
// Phase 1: matrix 12 rows 11 cols
[2021-05-08 22:23:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 22:23:37] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-08 22:23:37] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
// Phase 1: matrix 12 rows 11 cols
[2021-05-08 22:23:37] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:23:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:37] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-08 22:23:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-08 22:23:37] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
// Phase 1: matrix 12 rows 11 cols
[2021-05-08 22:23:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 22:23:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/123 places, 18/207 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-07a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s10 1)), p1:(AND (EQ s2 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-07a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-01 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 98 transition count 207
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 87 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 87 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 87 transition count 183
Applied a total of 49 rules in 4 ms. Remains 87 /123 variables (removed 36) and now considering 183/207 (removed 24) transitions.
[2021-05-08 22:23:38] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 87 cols
[2021-05-08 22:23:38] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 22:23:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-08 22:23:38] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 87 cols
[2021-05-08 22:23:38] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 22:23:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-08 22:23:38] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 87 cols
[2021-05-08 22:23:38] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 22:23:38] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/123 places, 183/207 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07a-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s53 1), p0:(AND (EQ s81 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Graph (complete) has 195 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 87/87 places, 183/183 transitions.
Graph (trivial) has 175 edges and 87 vertex of which 80 / 87 are part of one of the 12 SCC in 0 ms
Free SCC test removed 68 places
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 25
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 10 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 10 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 20 rules in 5 ms. Remains 10 /87 variables (removed 77) and now considering 16/183 (removed 167) transitions.
[2021-05-08 22:23:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-08 22:23:39] [INFO ] Flow matrix only has 11 transitions (discarded 5 similar events)
// Phase 1: matrix 11 rows 10 cols
[2021-05-08 22:23:39] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 22:23:39] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/87 places, 16/183 transitions.
Product exploration explored 100000 steps with 50000 reset in 233 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
[2021-05-08 22:23:40] [INFO ] Flatten gal took : 8 ms
[2021-05-08 22:23:40] [INFO ] Flatten gal took : 7 ms
[2021-05-08 22:23:40] [INFO ] Time to serialize gal into /tmp/LTL14911357948659149702.gal : 15 ms
[2021-05-08 22:23:40] [INFO ] Time to serialize properties into /tmp/LTL14015126601980114770.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/LTL14911357948659149702.gal, -t, CGAL, -LTL, /tmp/LTL14015126601980114770.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/LTL14911357948659149702.gal -t CGAL -LTL /tmp/LTL14015126601980114770.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p103==1)&&(p225==1))"))||(X(F("(p69!=1)")))))
Formula 0 simplified : !(G"((p103==1)&&(p225==1))" | XF"(p69!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
4 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.066393,17896,1,0,6,9155,24,0,1975,1198,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-07a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DLCround-PT-07a-02 finished in 2158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(((p1||(p2 U p0)) U (p2 U X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 100 transition count 207
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 90 transition count 187
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 90 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 90 transition count 186
Applied a total of 44 rules in 4 ms. Remains 90 /123 variables (removed 33) and now considering 186/207 (removed 21) transitions.
[2021-05-08 22:23:40] [INFO ] Flow matrix only has 145 transitions (discarded 41 similar events)
// Phase 1: matrix 145 rows 90 cols
[2021-05-08 22:23:40] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-08 22:23:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-08 22:23:40] [INFO ] Flow matrix only has 145 transitions (discarded 41 similar events)
// Phase 1: matrix 145 rows 90 cols
[2021-05-08 22:23:40] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-08 22:23:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-08 22:23:40] [INFO ] Flow matrix only has 145 transitions (discarded 41 similar events)
// Phase 1: matrix 145 rows 90 cols
[2021-05-08 22:23:40] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-08 22:23:40] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/123 places, 186/207 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), true, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND (NOT p0) p2 p1 (NOT p3))]
Running random walk in product with property : DLCround-PT-07a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p0 p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p3), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={0} source=9 dest: 9}]], initial=1, aps=[p0:(AND (EQ s12 1) (EQ s88 1)), p2:(AND (EQ s29 1) (EQ s87 1)), p1:(AND (EQ s64 1) (EQ s89 1)), p3:(OR (EQ s29 0) (EQ s87 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-03 finished in 565 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 99 transition count 207
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 89 transition count 187
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 89 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Applied a total of 46 rules in 4 ms. Remains 89 /123 variables (removed 34) and now considering 185/207 (removed 22) transitions.
[2021-05-08 22:23:40] [INFO ] Flow matrix only has 144 transitions (discarded 41 similar events)
// Phase 1: matrix 144 rows 89 cols
[2021-05-08 22:23:40] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 22:23:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-08 22:23:40] [INFO ] Flow matrix only has 144 transitions (discarded 41 similar events)
// Phase 1: matrix 144 rows 89 cols
[2021-05-08 22:23:40] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-08 22:23:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2021-05-08 22:23:40] [INFO ] Flow matrix only has 144 transitions (discarded 41 similar events)
// Phase 1: matrix 144 rows 89 cols
[2021-05-08 22:23:40] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-08 22:23:40] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 89/123 places, 185/207 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07a-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s72 0) (EQ s88 0)), p1:(AND (EQ s18 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-04 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&(((p2 U p3)||p1) U ((G(!p2)&&((p2 U p3)||p4))||G(((p2 U p3)||p5)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Graph (trivial) has 187 edges and 123 vertex of which 84 / 123 are part of one of the 12 SCC in 0 ms
Free SCC test removed 72 places
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 78 edges and 51 vertex of which 29 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 29 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 28 transition count 40
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 12 place count 20 transition count 31
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 20 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 20 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 19 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 19 transition count 28
Applied a total of 25 rules in 7 ms. Remains 19 /123 variables (removed 104) and now considering 28/207 (removed 179) transitions.
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 18 transitions (discarded 10 similar events)
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 22:23:41] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 18 transitions (discarded 10 similar events)
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 22:23:41] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-08 22:23:41] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 18 transitions (discarded 10 similar events)
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 22:23:41] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/123 places, 28/207 transitions.
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5))), (OR (AND (NOT p3) (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5))), (AND p2 (NOT p3) (NOT p5)), (OR (AND (NOT p3) (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5))), (OR (AND (NOT p3) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p3) (NOT p5)) (AND p2 (NOT p3) (NOT p5))), (AND p2 (NOT p3) (NOT p5)), (OR (AND (NOT p3) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p3) (NOT p5)) (AND p2 (NOT p3) (NOT p5))), (OR (AND (NOT p3) (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p3))), (OR (AND p2 (NOT p3) (NOT p5)) (AND (NOT p0) p2))]
Running random walk in product with property : DLCround-PT-07a-05 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) (NOT p5) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 (NOT p4) (NOT p3) p5 p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) p1), acceptance={1} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2) p4 p5 p1) (AND p0 (NOT p2) p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND p0 (NOT p2) p4 (NOT p3) p5 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) p5 (NOT p1)), acceptance={0} source=0 dest: 6}, { cond=(AND p0 p2 (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=0 dest: 7}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=0 dest: 8}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(OR p2 (AND (NOT p4) (NOT p3) p5 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p5) p1), acceptance={1} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p4 p5 p1) (AND (NOT p2) p3)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) p4 (NOT p3) p5 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p5 (NOT p1)), acceptance={0} source=1 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=1 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=1 dest: 8}], [{ cond=p2, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p5) p1), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p2) p5 p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p5 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p5 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p5) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p4 (NOT p3) p5 p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p3) p5 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p4 (NOT p3) p5 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p5 (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=3 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=3 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) (NOT p5) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) p5 p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p4 (NOT p3) p5 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 p1), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2 (NOT p3) p5) (AND p2 (NOT p3) p5 (NOT p1))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p4 (NOT p3) p5 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) p5) (AND (NOT p2) (NOT p4) (NOT p3) p5 (NOT p1))), acceptance={0} source=4 dest: 6}, { cond=(OR (AND (NOT p0) p2 (NOT p3) (NOT p5)) (AND p2 (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=4 dest: 8}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p5) p1), acceptance={1} source=5 dest: 2}, { cond=(OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p5 p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p5) (AND (NOT p2) (NOT p3) p5 (NOT p1))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 6}, { cond=(OR (AND (NOT p0) p2 (NOT p3) (NOT p5)) (AND p2 (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=5 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p5) (NOT p1))), acceptance={1} source=5 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) (NOT p5) p1), acceptance={0, 1} source=6 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 (NOT p4) (NOT p3) p5 p1)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) p1), acceptance={1} source=6 dest: 2}, { cond=(OR (AND p0 (NOT p2) p4 p5 p1) (AND p0 (NOT p2) p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p2) p4 (NOT p3) p5 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p0) p5) (AND (NOT p2) (NOT p4) (NOT p3) p5 (NOT p1))), acceptance={0} source=6 dest: 6}, { cond=(OR (AND (NOT p0) p2 (NOT p3) (NOT p5)) (AND p2 (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=6 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) (NOT p5) p1), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) p5 p1), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) p1), acceptance={1} source=7 dest: 2}, { cond=(AND p0 (NOT p2) p4 (NOT p3) p5 p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 p1), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p2) p4 (NOT p3) p5 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p4) (NOT p3) p5 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p5) (NOT p1))), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p4 (NOT p3) (NOT p5) (NOT p1)), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p5) p1), acceptance={1} source=8 dest: 2}, { cond=(OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p5 p1)), acceptance={} source=8 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p5) p1), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p3) p5 (NOT p1)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3) p5 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p5) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3) (NOT p5) (NOT p1))), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s18 0)), p2:(AND (EQ s9 1) (EQ s17 1)), p4:(OR (NEQ s5 1) (NEQ s15 1) (NEQ s9 1) (NEQ s17 1)), p3:(AND (EQ s7 1) (EQ s16 1)), p5:(OR (NEQ s5 1) (NEQ s15 1) (NEQ s9 1) (NEQ s17 1)), p1:(OR (NEQ s5 1) (NEQ s15 1) (NEQ s9 1) (NEQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-07a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-05 finished in 590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Graph (trivial) has 200 edges and 123 vertex of which 93 / 123 are part of one of the 12 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 187 transitions
Reduce isomorphic transitions removed 187 transitions.
Graph (complete) has 57 edges and 42 vertex of which 17 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 8 transition count 11
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 8 transition count 11
Applied a total of 20 rules in 2 ms. Remains 8 /123 variables (removed 115) and now considering 11/207 (removed 196) transitions.
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-08 22:23:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-08 22:23:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-08 22:23:41] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-08 22:23:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 22:23:41] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/123 places, 11/207 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-07a-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s7 1)), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-07 finished in 94 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 98 transition count 207
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 86 transition count 183
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 86 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 86 transition count 181
Applied a total of 51 rules in 3 ms. Remains 86 /123 variables (removed 37) and now considering 181/207 (removed 26) transitions.
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 142 transitions (discarded 39 similar events)
// Phase 1: matrix 142 rows 86 cols
[2021-05-08 22:23:41] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 142 transitions (discarded 39 similar events)
// Phase 1: matrix 142 rows 86 cols
[2021-05-08 22:23:41] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 22:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 142 transitions (discarded 39 similar events)
// Phase 1: matrix 142 rows 86 cols
[2021-05-08 22:23:41] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 22:23:41] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/123 places, 181/207 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-07a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-09 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Graph (trivial) has 186 edges and 123 vertex of which 83 / 123 are part of one of the 12 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Graph (complete) has 82 edges and 52 vertex of which 29 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 29 transition count 44
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 27 transition count 43
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 16 place count 17 transition count 32
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 17 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 17 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 17 transition count 31
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 16 transition count 30
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 16 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 16 transition count 29
Applied a total of 31 rules in 5 ms. Remains 16 /123 variables (removed 107) and now considering 29/207 (removed 178) transitions.
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 21 transitions (discarded 8 similar events)
// Phase 1: matrix 21 rows 16 cols
[2021-05-08 22:23:41] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 21 transitions (discarded 8 similar events)
// Phase 1: matrix 21 rows 16 cols
[2021-05-08 22:23:41] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-08 22:23:41] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 21 transitions (discarded 8 similar events)
// Phase 1: matrix 21 rows 16 cols
[2021-05-08 22:23:41] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-08 22:23:41] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/123 places, 29/207 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07a-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s5 1) (EQ s15 1)) (AND (EQ s6 1) (EQ s13 1) (EQ s11 1) (EQ s14 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-11 finished in 88 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 98 transition count 207
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 87 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 87 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 87 transition count 183
Applied a total of 49 rules in 2 ms. Remains 87 /123 variables (removed 36) and now considering 183/207 (removed 24) transitions.
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 87 cols
[2021-05-08 22:23:41] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 22:23:41] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-08 22:23:41] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 87 cols
[2021-05-08 22:23:41] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-08 22:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 87 cols
[2021-05-08 22:23:42] [INFO ] Computed 13 place invariants in 5 ms
[2021-05-08 22:23:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/123 places, 183/207 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-07a-13 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 (EQ s63 0) (EQ s86 0))], 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 191 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-13 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Graph (trivial) has 194 edges and 123 vertex of which 89 / 123 are part of one of the 11 SCC in 0 ms
Free SCC test removed 78 places
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Graph (complete) has 64 edges and 45 vertex of which 22 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 24
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 15 place count 12 transition count 16
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 12 transition count 16
Applied a total of 23 rules in 3 ms. Remains 12 /123 variables (removed 111) and now considering 16/207 (removed 191) transitions.
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 12 cols
[2021-05-08 22:23:42] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 22:23:42] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 12 cols
[2021-05-08 22:23:42] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 22:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:42] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-08 22:23:42] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 12 cols
[2021-05-08 22:23:42] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 22:23:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/123 places, 16/207 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DLCround-PT-07a-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s10 1)), p0:(AND (OR (NEQ s3 1) (NEQ s11 1)) (OR (EQ s5 0) (EQ s9 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07a-14 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F((p1 U ((F(p3)&&p2)||G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 207/207 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 99 transition count 207
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 35 place count 88 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 88 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 88 transition count 183
Applied a total of 48 rules in 2 ms. Remains 88 /123 variables (removed 35) and now considering 183/207 (removed 24) transitions.
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 88 cols
[2021-05-08 22:23:42] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 22:23:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 88 cols
[2021-05-08 22:23:42] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 22:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:23:42] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-08 22:23:42] [INFO ] Flow matrix only has 143 transitions (discarded 40 similar events)
// Phase 1: matrix 143 rows 88 cols
[2021-05-08 22:23:42] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 22:23:42] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/123 places, 183/207 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : DLCround-PT-07a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s60 1) (EQ s86 1) (OR (EQ s65 0) (EQ s87 0))), p2:(AND (NEQ s65 0) (NEQ s87 0)), p1:(AND (NEQ s65 0) (NEQ s87 0)), p3:(OR (NEQ s60 1) (NEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Graph (complete) has 196 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1), p3]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 4 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 183/183 transitions.
Graph (trivial) has 175 edges and 88 vertex of which 81 / 88 are part of one of the 13 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 20 transition count 23
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 11 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 11 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 21 rules in 3 ms. Remains 11 /88 variables (removed 77) and now considering 14/183 (removed 169) transitions.
[2021-05-08 22:23:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-08 22:23:43] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
// Phase 1: matrix 9 rows 11 cols
[2021-05-08 22:23:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 22:23:43] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/88 places, 14/183 transitions.
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
[2021-05-08 22:23:44] [INFO ] Flatten gal took : 7 ms
[2021-05-08 22:23:44] [INFO ] Flatten gal took : 6 ms
[2021-05-08 22:23:44] [INFO ] Time to serialize gal into /tmp/LTL3911556446067150412.gal : 3 ms
[2021-05-08 22:23:44] [INFO ] Time to serialize properties into /tmp/LTL8650305485913718233.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/LTL3911556446067150412.gal, -t, CGAL, -LTL, /tmp/LTL8650305485913718233.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/LTL3911556446067150412.gal -t CGAL -LTL /tmp/LTL8650305485913718233.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F(("((p84!=0)&&(p214!=0))")U((("((p84!=0)&&(p214!=0))")&&(F("((p78!=1)||(p207!=1))")))||(G("((p84!=0)&&(p214!=0))"))))))||("(((p78==1)&&(p207==1))&&((p84==0)||(p214==0)))")))))
Formula 0 simplified : !XF("(((p78==1)&&(p207==1))&&((p84==0)||(p214==0)))" | GF("((p84!=0)&&(p214!=0))" U (("((p84!=0)&&(p214!=0))" & F"((p78!=1)||(p207!=1))") | G"((p84!=0)&&(p214!=0))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
5 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.060064,19092,1,0,6,9216,21,0,1992,1192,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-07a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DLCround-PT-07a-15 finished in 1994 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620512625876

--------------------
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="DLCround-PT-07a"
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 DLCround-PT-07a, 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 r064-tall-162038397100341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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