Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990300626.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.3M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 7.1M Mar 20 13:27 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 BART-PT-030-00
FORMULA_NAME BART-PT-030-01
FORMULA_NAME BART-PT-030-02
FORMULA_NAME BART-PT-030-03
FORMULA_NAME BART-PT-030-04
FORMULA_NAME BART-PT-030-05
FORMULA_NAME BART-PT-030-06
FORMULA_NAME BART-PT-030-07
FORMULA_NAME BART-PT-030-08
FORMULA_NAME BART-PT-030-09
FORMULA_NAME BART-PT-030-10
FORMULA_NAME BART-PT-030-11
FORMULA_NAME BART-PT-030-12
FORMULA_NAME BART-PT-030-13
FORMULA_NAME BART-PT-030-14
FORMULA_NAME BART-PT-030-15

=== Now, execution of the tool begins

BK_START 1623177380944

Running Version 0
[2021-06-08 18:36:22] [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-06-08 18:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:36:22] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2021-06-08 18:36:22] [INFO ] Transformed 4170 places.
[2021-06-08 18:36:22] [INFO ] Transformed 6060 transitions.
[2021-06-08 18:36:22] [INFO ] Found NUPN structural information;
[2021-06-08 18:36:22] [INFO ] Parsed PT model containing 4170 places and 6060 transitions in 549 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:36:23] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 210 places and 0 transitions.
Support contains 36 out of 3960 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 951 places :
Symmetric choice reduction at 0 with 951 rule applications. Total rules 951 place count 3009 transition count 5109
Iterating global reduction 0 with 951 rules applied. Total rules applied 1902 place count 3009 transition count 5109
Discarding 799 places :
Symmetric choice reduction at 0 with 799 rule applications. Total rules 2701 place count 2210 transition count 4310
Iterating global reduction 0 with 799 rules applied. Total rules applied 3500 place count 2210 transition count 4310
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 3618 place count 2092 transition count 4192
Iterating global reduction 0 with 118 rules applied. Total rules applied 3736 place count 2092 transition count 4192
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3825 place count 2003 transition count 4103
Iterating global reduction 0 with 89 rules applied. Total rules applied 3914 place count 2003 transition count 4103
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4003 place count 1914 transition count 4014
Iterating global reduction 0 with 89 rules applied. Total rules applied 4092 place count 1914 transition count 4014
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4179 place count 1827 transition count 3927
Iterating global reduction 0 with 87 rules applied. Total rules applied 4266 place count 1827 transition count 3927
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4353 place count 1740 transition count 3840
Iterating global reduction 0 with 87 rules applied. Total rules applied 4440 place count 1740 transition count 3840
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 4526 place count 1654 transition count 3754
Iterating global reduction 0 with 86 rules applied. Total rules applied 4612 place count 1654 transition count 3754
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 4670 place count 1596 transition count 3696
Iterating global reduction 0 with 58 rules applied. Total rules applied 4728 place count 1596 transition count 3696
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 4785 place count 1539 transition count 3639
Iterating global reduction 0 with 57 rules applied. Total rules applied 4842 place count 1539 transition count 3639
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 4870 place count 1511 transition count 3611
Iterating global reduction 0 with 28 rules applied. Total rules applied 4898 place count 1511 transition count 3611
Applied a total of 4898 rules in 2358 ms. Remains 1511 /3960 variables (removed 2449) and now considering 3611/6060 (removed 2449) transitions.
// Phase 1: matrix 3611 rows 1511 cols
[2021-06-08 18:36:25] [INFO ] Computed 30 place invariants in 42 ms
[2021-06-08 18:36:26] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 3611 rows 1511 cols
[2021-06-08 18:36:26] [INFO ] Computed 30 place invariants in 21 ms
[2021-06-08 18:36:27] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
// Phase 1: matrix 3611 rows 1511 cols
[2021-06-08 18:36:27] [INFO ] Computed 30 place invariants in 18 ms
[2021-06-08 18:36:28] [INFO ] Dead Transitions using invariants and state equation in 1268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1511/3960 places, 3611/6060 transitions.
[2021-06-08 18:36:28] [INFO ] Flatten gal took : 193 ms
[2021-06-08 18:36:28] [INFO ] Flatten gal took : 119 ms
[2021-06-08 18:36:29] [INFO ] Input system was already deterministic with 3611 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=152 ) properties (out of 37) seen :34
Running SMT prover for 3 properties.
// Phase 1: matrix 3611 rows 1511 cols
[2021-06-08 18:36:29] [INFO ] Computed 30 place invariants in 15 ms
[2021-06-08 18:36:29] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2021-06-08 18:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:30] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2021-06-08 18:36:31] [INFO ] Computed and/alt/rep : 2531/5651/2531 causal constraints (skipped 0 transitions) in 166 ms.
[2021-06-08 18:36:31] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:36:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2021-06-08 18:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:32] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2021-06-08 18:36:32] [INFO ] Computed and/alt/rep : 2531/5651/2531 causal constraints (skipped 0 transitions) in 175 ms.
[2021-06-08 18:36:52] [INFO ] Deduced a trap composed of 49 places in 876 ms of which 8 ms to minimize.
[2021-06-08 18:36:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-06-08 18:36:52] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2021-06-08 18:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:53] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2021-06-08 18:36:53] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:36:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned unsat
[2021-06-08 18:36:53] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-06-08 18:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:54] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2021-06-08 18:36:54] [INFO ] Computed and/alt/rep : 2531/5651/2531 causal constraints (skipped 0 transitions) in 147 ms.
[2021-06-08 18:36:55] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:36:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-06-08 18:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:55] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2021-06-08 18:36:56] [INFO ] Computed and/alt/rep : 2531/5651/2531 causal constraints (skipped 0 transitions) in 153 ms.
[2021-06-08 18:37:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Graph (trivial) has 3570 edges and 1511 vertex of which 1461 / 1511 are part of one of the 29 SCC in 8 ms
Free SCC test removed 1432 places
Ensure Unique test removed 3461 transitions
Reduce isomorphic transitions removed 3461 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 51 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 49 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 49 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 48 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 38 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 38 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 65 place count 36 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 73 place count 34 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 81 place count 32 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 85 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 89 place count 30 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 93 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 97 place count 28 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 101 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 105 place count 26 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 109 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 113 place count 24 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 117 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 121 place count 22 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 125 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 129 place count 20 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 133 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 137 place count 18 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 141 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 145 place count 16 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 149 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 153 place count 14 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 157 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 161 place count 12 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 165 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 169 place count 10 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 173 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 177 place count 8 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 181 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 185 place count 6 transition count 11
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 189 place count 4 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 191 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 192 place count 4 transition count 5
Applied a total of 192 rules in 63 ms. Remains 4 /1511 variables (removed 1507) and now considering 5/3611 (removed 3606) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:15] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:15] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:15] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:37:15] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-06-08 18:37:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:15] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1511 places, 5/3611 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s2 1)), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-00 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0&&X((p1 U (p2||G(p1)))))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1500 transition count 3600
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1500 transition count 3600
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1493 transition count 3593
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1493 transition count 3593
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 1489 transition count 3589
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1481 transition count 3581
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1479 transition count 3579
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1479 transition count 3579
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1478 transition count 3578
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1478 transition count 3578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1477 transition count 3577
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1476 transition count 3576
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1476 transition count 3576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1475 transition count 3575
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Applied a total of 74 rules in 710 ms. Remains 1474 /1511 variables (removed 37) and now considering 3574/3611 (removed 37) transitions.
// Phase 1: matrix 3574 rows 1474 cols
[2021-06-08 18:37:16] [INFO ] Computed 30 place invariants in 12 ms
[2021-06-08 18:37:16] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 3574 rows 1474 cols
[2021-06-08 18:37:16] [INFO ] Computed 30 place invariants in 11 ms
[2021-06-08 18:37:17] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
// Phase 1: matrix 3574 rows 1474 cols
[2021-06-08 18:37:17] [INFO ] Computed 30 place invariants in 10 ms
[2021-06-08 18:37:18] [INFO ] Dead Transitions using invariants and state equation in 1244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1474/1511 places, 3574/3611 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BART-PT-030-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p3 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s988 1), p3:(OR (NEQ s720 1) (AND (NEQ s1292 0) (NEQ s720 1))), p2:(AND (NEQ s1292 0) (NEQ s720 1)), p1:(NEQ s720 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 634 ms.
Product exploration explored 100000 steps with 12 reset in 591 ms.
Knowledge obtained : [p0, p3, (NOT p2), p1]
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 5 reset in 499 ms.
Product exploration explored 100000 steps with 12 reset in 541 ms.
[2021-06-08 18:37:21] [INFO ] Flatten gal took : 115 ms
[2021-06-08 18:37:21] [INFO ] Flatten gal took : 79 ms
[2021-06-08 18:37:21] [INFO ] Time to serialize gal into /tmp/LTL2246592700609939155.gal : 60 ms
[2021-06-08 18:37:21] [INFO ] Time to serialize properties into /tmp/LTL15024122791622121048.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/LTL2246592700609939155.gal, -t, CGAL, -LTL, /tmp/LTL15024122791622121048.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/LTL2246592700609939155.gal -t CGAL -LTL /tmp/LTL15024122791622121048.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((TrainState_3_3_20!=1)||((TrainState_4_3_35!=0)&&(TrainState_3_3_20!=1)))"))||(("(TrainState_27_1_27!=1)")&&(X(("(TrainState_3_3_20!=1)")U(("((TrainState_4_3_35!=0)&&(TrainState_3_3_20!=1))")||(G("(TrainState_3_3_20!=1)"))))))))))
Formula 0 simplified : !GF(G"((TrainState_3_3_20!=1)||((TrainState_4_3_35!=0)&&(TrainState_3_3_20!=1)))" | ("(TrainState_27_1_27!=1)" & X("(TrainState_3_3_20!=1)" U ("((TrainState_4_3_35!=0)&&(TrainState_3_3_20!=1))" | G"(TrainState_3_3_20!=1)"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-06-08 18:37:37] [INFO ] Flatten gal took : 66 ms
[2021-06-08 18:37:37] [INFO ] Applying decomposition
[2021-06-08 18:37:37] [INFO ] Flatten gal took : 61 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/graph15875525706548424339.txt, -o, /tmp/graph15875525706548424339.bin, -w, /tmp/graph15875525706548424339.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/graph15875525706548424339.bin, -l, -1, -v, -w, /tmp/graph15875525706548424339.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:37:37] [INFO ] Decomposing Gal with order
[2021-06-08 18:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:37:37] [INFO ] Removed a total of 1136 redundant transitions.
[2021-06-08 18:37:37] [INFO ] Flatten gal took : 181 ms
[2021-06-08 18:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 639 labels/synchronizations in 22 ms.
[2021-06-08 18:37:37] [INFO ] Time to serialize gal into /tmp/LTL14701886455226841847.gal : 18 ms
[2021-06-08 18:37:37] [INFO ] Time to serialize properties into /tmp/LTL11057712049517367586.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/LTL14701886455226841847.gal, -t, CGAL, -LTL, /tmp/LTL11057712049517367586.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/LTL14701886455226841847.gal -t CGAL -LTL /tmp/LTL11057712049517367586.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i21.u160.TrainState_3_3_20!=1)||((i13.u278.TrainState_4_3_35!=0)&&(i21.u160.TrainState_3_3_20!=1)))"))||(("(i5.u220.TrainState_27_1_27!=1)")&&(X(("(i21.u160.TrainState_3_3_20!=1)")U(("((i13.u278.TrainState_4_3_35!=0)&&(i21.u160.TrainState_3_3_20!=1))")||(G("(i21.u160.TrainState_3_3_20!=1)"))))))))))
Formula 0 simplified : !GF(G"((i21.u160.TrainState_3_3_20!=1)||((i13.u278.TrainState_4_3_35!=0)&&(i21.u160.TrainState_3_3_20!=1)))" | ("(i5.u220.TrainState_27_1_27!=1)" & X("(i21.u160.TrainState_3_3_20!=1)" U ("((i13.u278.TrainState_4_3_35!=0)&&(i21.u160.TrainState_3_3_20!=1))" | G"(i21.u160.TrainState_3_3_20!=1)"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
30 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.508404,34848,1,0,2480,1557,3184,1893,745,2749,9028
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-01 finished in 22841 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&(G(p2) U (p3 U p4)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Graph (trivial) has 3564 edges and 1511 vertex of which 1459 / 1511 are part of one of the 29 SCC in 8 ms
Free SCC test removed 1430 places
Ensure Unique test removed 3457 transitions
Reduce isomorphic transitions removed 3457 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 55 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 53 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 53 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 52 transition count 126
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 42 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 42 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 40 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 40 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 38 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 71 place count 38 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 75 place count 36 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 79 place count 36 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 83 place count 34 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 87 place count 34 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 91 place count 32 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 95 place count 32 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 99 place count 30 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 103 place count 30 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 107 place count 28 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 111 place count 28 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 115 place count 26 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 119 place count 26 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 123 place count 24 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 127 place count 24 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 131 place count 22 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 135 place count 22 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 139 place count 20 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 143 place count 20 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 147 place count 18 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 151 place count 18 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 155 place count 16 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 159 place count 16 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 163 place count 14 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 167 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 171 place count 12 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 175 place count 12 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 179 place count 10 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 183 place count 10 transition count 17
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 187 place count 8 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 189 place count 8 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 192 place count 8 transition count 9
Applied a total of 192 rules in 30 ms. Remains 8 /1511 variables (removed 1503) and now considering 9/3611 (removed 3602) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:37:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:37:38] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:37:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:37:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-06-08 18:37:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:37:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:37:38] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/1511 places, 9/3611 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p1) (NOT p4)), true, (NOT p2), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p4))), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4)]
Running random walk in product with property : BART-PT-030-02 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p4) (NOT p3) (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p4) p2 p0), acceptance={0} source=0 dest: 5}, { cond=(AND p1 (NOT p4) (NOT p3) p2 p0), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p4) p3 (NOT p2) p0), acceptance={0} source=0 dest: 7}, { cond=(AND p1 (NOT p4) p2 (NOT p0)), acceptance={} source=0 dest: 9}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p4) p3 p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p4) (NOT p3) p2 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p4) p3 (NOT p2) p0), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p4) p3 p2 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p4) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p4) (NOT p3) p2 p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p4) p3 (NOT p2) p0), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p4) p2 (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p4) (NOT p3) (NOT p2) p0)), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p4) (NOT p3) p2 (NOT p0))), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p4) p3 p2 p0), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p2 p0) (AND (NOT p4) (NOT p3) p2 p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p4) p3 (NOT p2) p0), acceptance={0} source=6 dest: 7}, { cond=(AND p1 (NOT p4) p3 p2 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p3) p0) (AND (NOT p4) (NOT p3) (NOT p2) p0)), acceptance={0} source=7 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p4) (NOT p3) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p4) p3 (NOT p0)) (AND (NOT p4) p3 (NOT p2) (NOT p0))), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p4) p2 p0), acceptance={0} source=7 dest: 5}, { cond=(AND p1 (NOT p4) (NOT p3) p2 p0), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p4) p3 p0) (AND (NOT p4) p3 (NOT p2) p0)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p4) p2 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p4) p3 p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p4) p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s2 0), p0:(EQ s0 0), p4:(EQ s4 1), p3:(EQ s3 0), p2:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-02 finished in 571 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Graph (trivial) has 3607 edges and 1511 vertex of which 1510 / 1511 are part of one of the 30 SCC in 5 ms
Free SCC test removed 1480 places
Ensure Unique test removed 3579 transitions
Reduce isomorphic transitions removed 3579 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2 transition count 3
Applied a total of 30 rules in 12 ms. Remains 2 /1511 variables (removed 1509) and now considering 3/3611 (removed 3608) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:37:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:37:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:37:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:37:38] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-06-08 18:37:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:37:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:37:38] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1511 places, 3/3611 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-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:(EQ s0 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-03 finished in 118 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1499 transition count 3599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1499 transition count 3599
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1491 transition count 3591
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1491 transition count 3591
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1487 transition count 3587
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1487 transition count 3587
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1483 transition count 3583
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1483 transition count 3583
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1479 transition count 3579
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1479 transition count 3579
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1477 transition count 3577
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1476 transition count 3576
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1476 transition count 3576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1475 transition count 3575
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Applied a total of 78 rules in 700 ms. Remains 1472 /1511 variables (removed 39) and now considering 3572/3611 (removed 39) transitions.
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:39] [INFO ] Computed 30 place invariants in 19 ms
[2021-06-08 18:37:39] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:40] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:37:40] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:40] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:37:42] [INFO ] Dead Transitions using invariants and state equation in 1225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1472/1511 places, 3572/3611 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-PT-030-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s480 1), p0:(EQ s534 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-04 finished in 3172 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 2 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Graph (trivial) has 3605 edges and 1511 vertex of which 1509 / 1511 are part of one of the 30 SCC in 5 ms
Free SCC test removed 1479 places
Ensure Unique test removed 3577 transitions
Reduce isomorphic transitions removed 3577 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 4 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 4 transition count 5
Applied a total of 30 rules in 14 ms. Remains 4 /1511 variables (removed 1507) and now considering 5/3611 (removed 3606) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:42] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:42] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-06-08 18:37:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:42] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1511 places, 5/3611 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-030-05 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:(EQ s0 1), p1:(EQ s1 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 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-05 finished in 164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G((p1&&X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1499 transition count 3599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1499 transition count 3599
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1491 transition count 3591
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1491 transition count 3591
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1487 transition count 3587
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1487 transition count 3587
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1483 transition count 3583
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1483 transition count 3583
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1479 transition count 3579
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1479 transition count 3579
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1477 transition count 3577
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1476 transition count 3576
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1476 transition count 3576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1475 transition count 3575
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Applied a total of 78 rules in 710 ms. Remains 1472 /1511 variables (removed 39) and now considering 3572/3611 (removed 39) transitions.
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:43] [INFO ] Computed 30 place invariants in 16 ms
[2021-06-08 18:37:43] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:43] [INFO ] Computed 30 place invariants in 12 ms
[2021-06-08 18:37:44] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:44] [INFO ] Computed 30 place invariants in 39 ms
[2021-06-08 18:37:45] [INFO ] Dead Transitions using invariants and state equation in 1321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1472/1511 places, 3572/3611 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : BART-PT-030-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s20 1), p1:(EQ s870 1), p2:(NEQ s448 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 20 steps with 0 reset in 3 ms.
FORMULA BART-PT-030-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-06 finished in 3308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&(X(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1499 transition count 3599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1499 transition count 3599
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1491 transition count 3591
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1491 transition count 3591
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1487 transition count 3587
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1487 transition count 3587
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1483 transition count 3583
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1483 transition count 3583
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1479 transition count 3579
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1479 transition count 3579
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1477 transition count 3577
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1476 transition count 3576
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1476 transition count 3576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1475 transition count 3575
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Applied a total of 78 rules in 711 ms. Remains 1472 /1511 variables (removed 39) and now considering 3572/3611 (removed 39) transitions.
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:46] [INFO ] Computed 30 place invariants in 13 ms
[2021-06-08 18:37:46] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:46] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:37:47] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
// Phase 1: matrix 3572 rows 1472 cols
[2021-06-08 18:37:47] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:37:48] [INFO ] Dead Transitions using invariants and state equation in 1177 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1472/1511 places, 3572/3611 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BART-PT-030-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1189 0), p2:(NEQ s16 1), p1:(EQ s1170 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 435 ms.
Product exploration explored 100000 steps with 0 reset in 547 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 440 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
[2021-06-08 18:37:51] [INFO ] Flatten gal took : 59 ms
[2021-06-08 18:37:51] [INFO ] Flatten gal took : 60 ms
[2021-06-08 18:37:51] [INFO ] Time to serialize gal into /tmp/LTL17957314420246977487.gal : 11 ms
[2021-06-08 18:37:51] [INFO ] Time to serialize properties into /tmp/LTL12579315502029273298.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/LTL17957314420246977487.gal, -t, CGAL, -LTL, /tmp/LTL12579315502029273298.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/LTL17957314420246977487.gal -t CGAL -LTL /tmp/LTL12579315502029273298.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(TrainState_19_1_33==0)"))&&((X("(TrainState_14_3_32==1)"))||(G("(TrainState_17_0_0!=1)"))))))
Formula 0 simplified : !F(G"(TrainState_19_1_33==0)" & (X"(TrainState_14_3_32==1)" | G"(TrainState_17_0_0!=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-06-08 18:38:06] [INFO ] Flatten gal took : 54 ms
[2021-06-08 18:38:06] [INFO ] Applying decomposition
[2021-06-08 18:38:06] [INFO ] Flatten gal took : 53 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/graph10352634671707495324.txt, -o, /tmp/graph10352634671707495324.bin, -w, /tmp/graph10352634671707495324.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/graph10352634671707495324.bin, -l, -1, -v, -w, /tmp/graph10352634671707495324.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:38:06] [INFO ] Decomposing Gal with order
[2021-06-08 18:38:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:38:06] [INFO ] Removed a total of 1131 redundant transitions.
[2021-06-08 18:38:07] [INFO ] Flatten gal took : 121 ms
[2021-06-08 18:38:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 640 labels/synchronizations in 17 ms.
[2021-06-08 18:38:07] [INFO ] Time to serialize gal into /tmp/LTL12332236809414891797.gal : 13 ms
[2021-06-08 18:38:07] [INFO ] Time to serialize properties into /tmp/LTL16174634961318075834.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/LTL12332236809414891797.gal, -t, CGAL, -LTL, /tmp/LTL16174634961318075834.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/LTL12332236809414891797.gal -t CGAL -LTL /tmp/LTL16174634961318075834.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(i22.u239.TrainState_19_1_33==0)"))&&((X("(i20.u249.TrainState_14_3_32==1)"))||(G("(i7.u66.TrainState_17_0_0!=1)"))))))
Formula 0 simplified : !F(G"(i22.u239.TrainState_19_1_33==0)" & (X"(i20.u249.TrainState_14_3_32==1)" | G"(i7.u66.TrainState_17_0_0!=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.511845,34396,1,0,5681,1813,2862,7876,735,3531,13743
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-07 finished in 21948 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1498 transition count 3598
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1498 transition count 3598
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1489 transition count 3589
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1475 transition count 3575
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1471 transition count 3571
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1470 transition count 3570
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1470 transition count 3570
Applied a total of 82 rules in 740 ms. Remains 1470 /1511 variables (removed 41) and now considering 3570/3611 (removed 41) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:08] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:08] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:08] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:09] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:09] [INFO ] Computed 30 place invariants in 10 ms
[2021-06-08 18:38:10] [INFO ] Dead Transitions using invariants and state equation in 1268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1470/1511 places, 3570/3611 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-030-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s30 1), p2:(OR (EQ s30 1) (EQ s349 0)), p1:(EQ s639 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16516 steps with 0 reset in 76 ms.
FORMULA BART-PT-030-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-08 finished in 3378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1499 transition count 3599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1499 transition count 3599
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1491 transition count 3591
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1491 transition count 3591
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 1488 transition count 3588
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 1488 transition count 3588
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1485 transition count 3585
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1485 transition count 3585
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1482 transition count 3582
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1482 transition count 3582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1481 transition count 3581
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1481 transition count 3581
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1480 transition count 3580
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1480 transition count 3580
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1479 transition count 3579
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1479 transition count 3579
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1478 transition count 3578
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1478 transition count 3578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1477 transition count 3577
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1476 transition count 3576
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1476 transition count 3576
Applied a total of 70 rules in 707 ms. Remains 1476 /1511 variables (removed 35) and now considering 3576/3611 (removed 35) transitions.
// Phase 1: matrix 3576 rows 1476 cols
[2021-06-08 18:38:11] [INFO ] Computed 30 place invariants in 16 ms
[2021-06-08 18:38:11] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 3576 rows 1476 cols
[2021-06-08 18:38:11] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:12] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 3576 rows 1476 cols
[2021-06-08 18:38:12] [INFO ] Computed 30 place invariants in 13 ms
[2021-06-08 18:38:14] [INFO ] Dead Transitions using invariants and state equation in 1218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1476/1511 places, 3576/3611 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BART-PT-030-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s24 1), p0:(AND (EQ s1008 1) (EQ s810 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 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-09 finished in 3124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(F(G(p1))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1500 transition count 3600
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1500 transition count 3600
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1493 transition count 3593
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1493 transition count 3593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1491 transition count 3591
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1491 transition count 3591
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1489 transition count 3589
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1489 transition count 3589
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1487 transition count 3587
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1487 transition count 3587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1486 transition count 3586
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1486 transition count 3586
Applied a total of 50 rules in 400 ms. Remains 1486 /1511 variables (removed 25) and now considering 3586/3611 (removed 25) transitions.
// Phase 1: matrix 3586 rows 1486 cols
[2021-06-08 18:38:14] [INFO ] Computed 30 place invariants in 16 ms
[2021-06-08 18:38:14] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 3586 rows 1486 cols
[2021-06-08 18:38:14] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:15] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
// Phase 1: matrix 3586 rows 1486 cols
[2021-06-08 18:38:15] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:16] [INFO ] Dead Transitions using invariants and state equation in 1207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1486/1511 places, 3586/3611 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-030-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1143 1), p2:(NEQ s937 1), p1:(NEQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 428 ms.
Product exploration explored 100000 steps with 0 reset in 511 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 429 ms.
Product exploration explored 100000 steps with 0 reset in 519 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1486 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1486/1486 places, 3586/3586 transitions.
Graph (trivial) has 3578 edges and 1486 vertex of which 1468 / 1486 are part of one of the 30 SCC in 6 ms
Free SCC test removed 1438 places
Ensure Unique test removed 3523 transitions
Reduce isomorphic transitions removed 3523 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 20 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 20 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 20 transition count 34
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 20 transition count 34
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 53 place count 20 transition count 24
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 63 place count 10 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 73 place count 10 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 75 rules in 21 ms. Remains 10 /1486 variables (removed 1476) and now considering 12/3586 (removed 3574) transitions.
[2021-06-08 18:38:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 10 cols
[2021-06-08 18:38:19] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:38:19] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/1486 places, 12/3586 transitions.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-10 finished in 5461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1498 transition count 3598
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1498 transition count 3598
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1489 transition count 3589
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1475 transition count 3575
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1471 transition count 3571
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1470 transition count 3570
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1470 transition count 3570
Applied a total of 82 rules in 518 ms. Remains 1470 /1511 variables (removed 41) and now considering 3570/3611 (removed 41) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:20] [INFO ] Computed 30 place invariants in 7 ms
[2021-06-08 18:38:20] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:20] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:21] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:21] [INFO ] Computed 30 place invariants in 13 ms
[2021-06-08 18:38:22] [INFO ] Dead Transitions using invariants and state equation in 1221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1470/1511 places, 3570/3611 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s340 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 19 reset in 451 ms.
Product exploration explored 100000 steps with 11 reset in 471 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17 reset in 445 ms.
Product exploration explored 100000 steps with 12 reset in 462 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1470 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1470/1470 places, 3570/3570 transitions.
Graph (trivial) has 3566 edges and 1470 vertex of which 1469 / 1470 are part of one of the 30 SCC in 4 ms
Free SCC test removed 1439 places
Ensure Unique test removed 3538 transitions
Reduce isomorphic transitions removed 3538 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2 transition count 3
Applied a total of 30 rules in 12 ms. Remains 2 /1470 variables (removed 1468) and now considering 3/3570 (removed 3567) transitions.
[2021-06-08 18:38:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:38:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1470 places, 3/3570 transitions.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-11 finished in 4951 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1499 transition count 3599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1499 transition count 3599
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 1490 transition count 3590
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 1490 transition count 3590
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1486 transition count 3586
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1486 transition count 3586
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1482 transition count 3582
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1482 transition count 3582
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1478 transition count 3578
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1478 transition count 3578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 1476 transition count 3576
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 1476 transition count 3576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1475 transition count 3575
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1471 transition count 3571
Applied a total of 80 rules in 589 ms. Remains 1471 /1511 variables (removed 40) and now considering 3571/3611 (removed 40) transitions.
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:38:25] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:25] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:38:25] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:26] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:38:26] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:38:27] [INFO ] Dead Transitions using invariants and state equation in 1215 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1471/1511 places, 3571/3611 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s660 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]]
Product exploration explored 100000 steps with 11 reset in 457 ms.
Product exploration explored 100000 steps with 8 reset in 490 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 447 ms.
Product exploration explored 100000 steps with 7 reset in 485 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1471/1471 places, 3571/3571 transitions.
Graph (trivial) has 3569 edges and 1471 vertex of which 1470 / 1471 are part of one of the 30 SCC in 2 ms
Free SCC test removed 1440 places
Ensure Unique test removed 3539 transitions
Reduce isomorphic transitions removed 3539 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2 transition count 3
Applied a total of 30 rules in 10 ms. Remains 2 /1471 variables (removed 1469) and now considering 3/3571 (removed 3568) transitions.
[2021-06-08 18:38:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:38:29] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1471 places, 3/3571 transitions.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-12 finished in 5268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1498 transition count 3598
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1498 transition count 3598
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1489 transition count 3589
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1477 transition count 3577
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1475 transition count 3575
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1475 transition count 3575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1474 transition count 3574
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1473 transition count 3573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1471 transition count 3571
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1470 transition count 3570
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1470 transition count 3570
Applied a total of 82 rules in 565 ms. Remains 1470 /1511 variables (removed 41) and now considering 3570/3611 (removed 41) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:30] [INFO ] Computed 30 place invariants in 13 ms
[2021-06-08 18:38:30] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:30] [INFO ] Computed 30 place invariants in 13 ms
[2021-06-08 18:38:31] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
// Phase 1: matrix 3570 rows 1470 cols
[2021-06-08 18:38:31] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:38:32] [INFO ] Dead Transitions using invariants and state equation in 1191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1470/1511 places, 3570/3611 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-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:(NEQ s29 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 1 ms.
FORMULA BART-PT-030-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-13 finished in 2889 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Graph (trivial) has 3607 edges and 1511 vertex of which 1510 / 1511 are part of one of the 30 SCC in 1 ms
Free SCC test removed 1480 places
Ensure Unique test removed 3579 transitions
Reduce isomorphic transitions removed 3579 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2 transition count 3
Applied a total of 30 rules in 5 ms. Remains 2 /1511 variables (removed 1509) and now considering 3/3611 (removed 3608) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:38:32] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-06-08 18:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:38:32] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1511 places, 3/3611 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-030-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-14 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1511/1511 places, 3611/3611 transitions.
Graph (trivial) has 3574 edges and 1511 vertex of which 1462 / 1511 are part of one of the 29 SCC in 1 ms
Free SCC test removed 1433 places
Ensure Unique test removed 3463 transitions
Reduce isomorphic transitions removed 3463 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 49 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 47 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 33 place count 47 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 46 transition count 117
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 36 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 36 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 34 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 66 place count 34 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 32 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 74 place count 32 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 78 place count 30 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 82 place count 30 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 86 place count 28 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 90 place count 28 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 94 place count 26 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 98 place count 26 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 102 place count 24 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 106 place count 24 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 110 place count 22 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 114 place count 22 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 118 place count 20 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 122 place count 20 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 126 place count 18 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 130 place count 18 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 134 place count 16 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 138 place count 16 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 142 place count 14 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 146 place count 14 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 150 place count 12 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 154 place count 12 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 158 place count 10 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 162 place count 10 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 166 place count 8 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 170 place count 8 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 174 place count 6 transition count 18
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 178 place count 6 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 182 place count 4 transition count 12
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 186 place count 4 transition count 8
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 190 place count 2 transition count 5
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 192 place count 2 transition count 3
Applied a total of 192 rules in 14 ms. Remains 2 /1511 variables (removed 1509) and now considering 3/3611 (removed 3608) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-06-08 18:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:38:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1511 places, 3/3611 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-15 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:(EQ s0 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-15 finished in 126 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177513898

--------------------
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="BART-PT-030"
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 BART-PT-030, 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 r007-tall-162037990300626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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