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-162037990300633.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-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300633
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-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.5K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 9.5M 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-040-00
FORMULA_NAME BART-PT-040-01
FORMULA_NAME BART-PT-040-02
FORMULA_NAME BART-PT-040-03
FORMULA_NAME BART-PT-040-04
FORMULA_NAME BART-PT-040-05
FORMULA_NAME BART-PT-040-06
FORMULA_NAME BART-PT-040-07
FORMULA_NAME BART-PT-040-08
FORMULA_NAME BART-PT-040-09
FORMULA_NAME BART-PT-040-10
FORMULA_NAME BART-PT-040-11
FORMULA_NAME BART-PT-040-12
FORMULA_NAME BART-PT-040-13
FORMULA_NAME BART-PT-040-14
FORMULA_NAME BART-PT-040-15

=== Now, execution of the tool begins

BK_START 1623177414376

Running Version 0
[2021-06-08 18:36:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:36:56] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2021-06-08 18:36:56] [INFO ] Transformed 5490 places.
[2021-06-08 18:36:56] [INFO ] Transformed 8080 transitions.
[2021-06-08 18:36:56] [INFO ] Found NUPN structural information;
[2021-06-08 18:36:56] [INFO ] Parsed PT model containing 5490 places and 8080 transitions in 502 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:36:56] [INFO ] Initial state test concluded for 6 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 5280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1266 places :
Symmetric choice reduction at 0 with 1266 rule applications. Total rules 1266 place count 4014 transition count 6814
Iterating global reduction 0 with 1266 rules applied. Total rules applied 2532 place count 4014 transition count 6814
Discarding 1058 places :
Symmetric choice reduction at 0 with 1058 rule applications. Total rules 3590 place count 2956 transition count 5756
Iterating global reduction 0 with 1058 rules applied. Total rules applied 4648 place count 2956 transition count 5756
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 4806 place count 2798 transition count 5598
Iterating global reduction 0 with 158 rules applied. Total rules applied 4964 place count 2798 transition count 5598
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5082 place count 2680 transition count 5480
Iterating global reduction 0 with 118 rules applied. Total rules applied 5200 place count 2680 transition count 5480
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5318 place count 2562 transition count 5362
Iterating global reduction 0 with 118 rules applied. Total rules applied 5436 place count 2562 transition count 5362
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5554 place count 2444 transition count 5244
Iterating global reduction 0 with 118 rules applied. Total rules applied 5672 place count 2444 transition count 5244
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 5789 place count 2327 transition count 5127
Iterating global reduction 0 with 117 rules applied. Total rules applied 5906 place count 2327 transition count 5127
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 6021 place count 2212 transition count 5012
Iterating global reduction 0 with 115 rules applied. Total rules applied 6136 place count 2212 transition count 5012
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 6214 place count 2134 transition count 4934
Iterating global reduction 0 with 78 rules applied. Total rules applied 6292 place count 2134 transition count 4934
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 6367 place count 2059 transition count 4859
Iterating global reduction 0 with 75 rules applied. Total rules applied 6442 place count 2059 transition count 4859
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 6480 place count 2021 transition count 4821
Iterating global reduction 0 with 38 rules applied. Total rules applied 6518 place count 2021 transition count 4821
Applied a total of 6518 rules in 2658 ms. Remains 2021 /5280 variables (removed 3259) and now considering 4821/8080 (removed 3259) transitions.
// Phase 1: matrix 4821 rows 2021 cols
[2021-06-08 18:36:59] [INFO ] Computed 40 place invariants in 41 ms
[2021-06-08 18:37:00] [INFO ] Implicit Places using invariants in 485 ms returned []
// Phase 1: matrix 4821 rows 2021 cols
[2021-06-08 18:37:00] [INFO ] Computed 40 place invariants in 28 ms
[2021-06-08 18:37:00] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
// Phase 1: matrix 4821 rows 2021 cols
[2021-06-08 18:37:00] [INFO ] Computed 40 place invariants in 35 ms
[2021-06-08 18:37:02] [INFO ] Dead Transitions using invariants and state equation in 1911 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2021/5280 places, 4821/8080 transitions.
[2021-06-08 18:37:03] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-08 18:37:03] [INFO ] Flatten gal took : 277 ms
FORMULA BART-PT-040-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:37:03] [INFO ] Flatten gal took : 158 ms
[2021-06-08 18:37:03] [INFO ] Input system was already deterministic with 4821 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 832 ms. (steps per millisecond=120 ) properties (out of 15) seen :13
Running SMT prover for 2 properties.
// Phase 1: matrix 4821 rows 2021 cols
[2021-06-08 18:37:04] [INFO ] Computed 40 place invariants in 35 ms
[2021-06-08 18:37:04] [INFO ] [Real]Absence check using 40 positive place invariants in 30 ms returned sat
[2021-06-08 18:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:37:05] [INFO ] [Real]Absence check using state equation in 1116 ms returned sat
[2021-06-08 18:37:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:37:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned unsat
[2021-06-08 18:37:06] [INFO ] [Real]Absence check using 40 positive place invariants in 30 ms returned sat
[2021-06-08 18:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:37:07] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2021-06-08 18:37:08] [INFO ] Computed and/alt/rep : 3381/7541/3381 causal constraints (skipped 0 transitions) in 249 ms.
[2021-06-08 18:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:37:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2021-06-08 18:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-08 18:37:09] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2021-06-08 18:37:10] [INFO ] Computed and/alt/rep : 3381/7541/3381 causal constraints (skipped 0 transitions) in 245 ms.
[2021-06-08 18:37:28] [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 1
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1997 transition count 4797
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1997 transition count 4797
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1982 transition count 4782
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1982 transition count 4782
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1977 transition count 4777
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1977 transition count 4777
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 1972 transition count 4772
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 1972 transition count 4772
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1969 transition count 4769
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1969 transition count 4769
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 1967 transition count 4767
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 1967 transition count 4767
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 1965 transition count 4765
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 1965 transition count 4765
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 1963 transition count 4763
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 1963 transition count 4763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 1962 transition count 4762
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 1962 transition count 4762
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 1961 transition count 4761
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 1961 transition count 4761
Applied a total of 120 rules in 733 ms. Remains 1961 /2021 variables (removed 60) and now considering 4761/4821 (removed 60) transitions.
// Phase 1: matrix 4761 rows 1961 cols
[2021-06-08 18:37:29] [INFO ] Computed 40 place invariants in 15 ms
[2021-06-08 18:37:29] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 4761 rows 1961 cols
[2021-06-08 18:37:29] [INFO ] Computed 40 place invariants in 14 ms
[2021-06-08 18:37:30] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
// Phase 1: matrix 4761 rows 1961 cols
[2021-06-08 18:37:30] [INFO ] Computed 40 place invariants in 17 ms
[2021-06-08 18:37:32] [INFO ] Dead Transitions using invariants and state equation in 1815 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1961/2021 places, 4761/4821 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1880 0) (EQ s801 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 24511 steps with 0 reset in 240 ms.
FORMULA BART-PT-040-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-00 finished in 3909 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2000 transition count 4800
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2000 transition count 4800
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 1988 transition count 4788
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 1988 transition count 4788
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1984 transition count 4784
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1984 transition count 4784
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1980 transition count 4780
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1980 transition count 4780
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1978 transition count 4778
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1978 transition count 4778
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 1976 transition count 4776
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 1976 transition count 4776
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 1974 transition count 4774
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 1974 transition count 4774
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 1972 transition count 4772
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 1972 transition count 4772
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 1971 transition count 4771
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 1971 transition count 4771
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 1970 transition count 4770
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 1970 transition count 4770
Applied a total of 102 rules in 646 ms. Remains 1970 /2021 variables (removed 51) and now considering 4770/4821 (removed 51) transitions.
// Phase 1: matrix 4770 rows 1970 cols
[2021-06-08 18:37:33] [INFO ] Computed 40 place invariants in 17 ms
[2021-06-08 18:37:33] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 4770 rows 1970 cols
[2021-06-08 18:37:33] [INFO ] Computed 40 place invariants in 11 ms
[2021-06-08 18:37:34] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
// Phase 1: matrix 4770 rows 1970 cols
[2021-06-08 18:37:34] [INFO ] Computed 40 place invariants in 12 ms
[2021-06-08 18:37:35] [INFO ] Dead Transitions using invariants and state equation in 1799 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1970/2021 places, 4770/4821 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-040-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1282 0) (EQ s1847 1)), p1:(OR (EQ s1685 0) (EQ s840 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], 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-040-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-01 finished in 3417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Graph (trivial) has 4819 edges and 2021 vertex of which 2019 / 2021 are part of one of the 40 SCC in 14 ms
Free SCC test removed 1979 places
Ensure Unique test removed 4778 transitions
Reduce isomorphic transitions removed 4778 transitions.
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 3 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 40 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 2 transition count 3
Applied a total of 42 rules in 48 ms. Remains 2 /2021 variables (removed 2019) and now considering 3/4821 (removed 4818) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:37:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:37:36] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:37:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:37:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-06-08 18:37:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:37:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:37:36] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2021 places, 3/4821 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : BART-PT-040-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-02 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Graph (trivial) has 4809 edges and 2021 vertex of which 2017 / 2021 are part of one of the 40 SCC in 9 ms
Free SCC test removed 1977 places
Ensure Unique test removed 4773 transitions
Reduce isomorphic transitions removed 4773 transitions.
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 8 transition count 13
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 8 transition count 9
Applied a total of 40 rules in 21 ms. Remains 8 /2021 variables (removed 2013) and now considering 9/4821 (removed 4812) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:37:36] [INFO ] Computed 4 place invariants in 2 ms
[2021-06-08 18:37:36] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:37:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:37:36] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-06-08 18:37:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:37:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:37:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/2021 places, 9/4821 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-040-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s1 0) (EQ s2 1)) (AND (EQ s0 0) (EQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-040-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-03 finished in 106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||(F(p0)&&G(F((p1 U (p2||G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2001 transition count 4801
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2001 transition count 4801
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1991 transition count 4791
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1991 transition count 4791
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1989 transition count 4789
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1989 transition count 4789
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1987 transition count 4787
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1987 transition count 4787
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1985 transition count 4785
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1985 transition count 4785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1984 transition count 4784
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1984 transition count 4784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1983 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1983 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1982 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1982 transition count 4782
Applied a total of 78 rules in 537 ms. Remains 1982 /2021 variables (removed 39) and now considering 4782/4821 (removed 39) transitions.
// Phase 1: matrix 4782 rows 1982 cols
[2021-06-08 18:37:36] [INFO ] Computed 40 place invariants in 15 ms
[2021-06-08 18:37:37] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 4782 rows 1982 cols
[2021-06-08 18:37:37] [INFO ] Computed 40 place invariants in 14 ms
[2021-06-08 18:37:37] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
// Phase 1: matrix 4782 rows 1982 cols
[2021-06-08 18:37:37] [INFO ] Computed 40 place invariants in 13 ms
[2021-06-08 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 1745 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1982/2021 places, 4782/4821 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-040-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1338 0) (EQ s643 1)), p2:(AND (OR (EQ s1047 0) (EQ s280 1)) (NEQ s1452 0) (NEQ s1371 1)), p1:(AND (NEQ s1452 0) (NEQ s1371 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 13 reset in 710 ms.
Product exploration explored 100000 steps with 15 reset in 727 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 16 reset in 618 ms.
Product exploration explored 100000 steps with 16 reset in 634 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 1982 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1982/1982 places, 4782/4782 transitions.
Graph (trivial) has 4767 edges and 1982 vertex of which 1959 / 1982 are part of one of the 40 SCC in 11 ms
Free SCC test removed 1919 places
Ensure Unique test removed 4703 transitions
Reduce isomorphic transitions removed 4703 transitions.
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 28 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 28 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 43 place count 28 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 28 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 28 transition count 41
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 28 transition count 36
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 23 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 23 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 23 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 71 place count 23 transition count 26
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 23 transition count 26
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 78 place count 19 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 19 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 82 rules in 33 ms. Remains 19 /1982 variables (removed 1963) and now considering 22/4782 (removed 4760) transitions.
[2021-06-08 18:37:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 19 cols
[2021-06-08 18:37:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-06-08 18:37:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/1982 places, 22/4782 transitions.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 78 ms.
[2021-06-08 18:37:43] [INFO ] Flatten gal took : 94 ms
[2021-06-08 18:37:43] [INFO ] Flatten gal took : 89 ms
[2021-06-08 18:37:43] [INFO ] Time to serialize gal into /tmp/LTL4570725336443679233.gal : 54 ms
[2021-06-08 18:37:43] [INFO ] Time to serialize properties into /tmp/LTL13820979865301264925.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4570725336443679233.gal, -t, CGAL, -LTL, /tmp/LTL13820979865301264925.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/LTL4570725336443679233.gal -t CGAL -LTL /tmp/LTL13820979865301264925.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((TrainState_8_1_28==0)||(TrainState_20_4_13==1))")))||((F("((TrainState_8_1_28==0)||(TrainState_20_4_13==1))"))&&(G(F(("((TrainState_31_4_29!=0)&&(TrainState_33_4_28!=1))")U(("((((TrainState_14_3_21==0)||(TrainState_20_2_6==1))&&(TrainState_31_4_29!=0))&&(TrainState_33_4_28!=1))")||(G("((TrainState_31_4_29!=0)&&(TrainState_33_4_28!=1))"))))))))))
Formula 0 simplified : !X(GF"((TrainState_8_1_28==0)||(TrainState_20_4_13==1))" | (F"((TrainState_8_1_28==0)||(TrainState_20_4_13==1))" & GF("((TrainState_31_4_29!=0)&&(TrainState_33_4_28!=1))" U ("((((TrainState_14_3_21==0)||(TrainState_20_2_6==1))&&(TrainState_31_4_29!=0))&&(TrainState_33_4_28!=1))" | G"((TrainState_31_4_29!=0)&&(TrainState_33_4_28!=1))"))))
Detected timeout of ITS tools.
[2021-06-08 18:37:58] [INFO ] Flatten gal took : 85 ms
[2021-06-08 18:37:58] [INFO ] Applying decomposition
[2021-06-08 18:37:58] [INFO ] Flatten gal took : 87 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/graph4947154292749780244.txt, -o, /tmp/graph4947154292749780244.bin, -w, /tmp/graph4947154292749780244.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/graph4947154292749780244.bin, -l, -1, -v, -w, /tmp/graph4947154292749780244.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:37:59] [INFO ] Decomposing Gal with order
[2021-06-08 18:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:37:59] [INFO ] Removed a total of 1565 redundant transitions.
[2021-06-08 18:37:59] [INFO ] Flatten gal took : 230 ms
[2021-06-08 18:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 820 labels/synchronizations in 46 ms.
[2021-06-08 18:37:59] [INFO ] Time to serialize gal into /tmp/LTL1585098629408523332.gal : 24 ms
[2021-06-08 18:37:59] [INFO ] Time to serialize properties into /tmp/LTL13650344915084780836.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/LTL1585098629408523332.gal, -t, CGAL, -LTL, /tmp/LTL13650344915084780836.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/LTL1585098629408523332.gal -t CGAL -LTL /tmp/LTL13650344915084780836.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i8.u285.TrainState_8_1_28==0)||(i9.u145.TrainState_20_4_13==1))")))||((F("((i8.u285.TrainState_8_1_28==0)||(i9.u145.TrainState_20_4_13==1))"))&&(G(F(("((i33.u352.TrainState_31_4_29!=0)&&(i19.u308.TrainState_33_4_28!=1))")U(("((((i1.u257.TrainState_14_3_21==0)||(i9.u40.TrainState_20_2_6==1))&&(i33.u352.TrainState_31_4_29!=0))&&(i19.u308.TrainState_33_4_28!=1))")||(G("((i33.u352.TrainState_31_4_29!=0)&&(i19.u308.TrainState_33_4_28!=1))"))))))))))
Formula 0 simplified : !X(GF"((i8.u285.TrainState_8_1_28==0)||(i9.u145.TrainState_20_4_13==1))" | (F"((i8.u285.TrainState_8_1_28==0)||(i9.u145.TrainState_20_4_13==1))" & GF("((i33.u352.TrainState_31_4_29!=0)&&(i19.u308.TrainState_33_4_28!=1))" U ("((((i1.u257.TrainState_14_3_21==0)||(i9.u40.TrainState_20_2_6==1))&&(i33.u352.TrainState_31_4_29!=0))&&(i19.u308.TrainState_33_4_28!=1))" | G"((i33.u352.TrainState_31_4_29!=0)&&(i19.u308.TrainState_33_4_28!=1))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
54 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.783719,39836,1,0,8018,1581,4562,8827,694,3349,21381
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-05 finished in 24287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2000 transition count 4800
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2000 transition count 4800
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 1988 transition count 4788
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 1988 transition count 4788
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1984 transition count 4784
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1984 transition count 4784
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1980 transition count 4780
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1980 transition count 4780
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1978 transition count 4778
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1978 transition count 4778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1977 transition count 4777
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1977 transition count 4777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1976 transition count 4776
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1976 transition count 4776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1975 transition count 4775
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1975 transition count 4775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1974 transition count 4774
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1974 transition count 4774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1973 transition count 4773
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1973 transition count 4773
Applied a total of 96 rules in 846 ms. Remains 1973 /2021 variables (removed 48) and now considering 4773/4821 (removed 48) transitions.
// Phase 1: matrix 4773 rows 1973 cols
[2021-06-08 18:38:01] [INFO ] Computed 40 place invariants in 17 ms
[2021-06-08 18:38:01] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 4773 rows 1973 cols
[2021-06-08 18:38:01] [INFO ] Computed 40 place invariants in 12 ms
[2021-06-08 18:38:02] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
// Phase 1: matrix 4773 rows 1973 cols
[2021-06-08 18:38:02] [INFO ] Computed 40 place invariants in 10 ms
[2021-06-08 18:38:04] [INFO ] Dead Transitions using invariants and state equation in 1788 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1973/2021 places, 4773/4821 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-040-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1167 0) (EQ s522 1)), p1:(AND (EQ s198 0) (EQ s1771 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 574 ms.
Product exploration explored 100000 steps with 0 reset in 645 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 551 ms.
Product exploration explored 100000 steps with 0 reset in 691 ms.
[2021-06-08 18:38:07] [INFO ] Flatten gal took : 72 ms
[2021-06-08 18:38:07] [INFO ] Flatten gal took : 71 ms
[2021-06-08 18:38:07] [INFO ] Time to serialize gal into /tmp/LTL10149531961586536799.gal : 10 ms
[2021-06-08 18:38:07] [INFO ] Time to serialize properties into /tmp/LTL14140221187527495513.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/LTL10149531961586536799.gal, -t, CGAL, -LTL, /tmp/LTL14140221187527495513.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/LTL10149531961586536799.gal -t CGAL -LTL /tmp/LTL14140221187527495513.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((TrainState_37_3_24==0)||(TrainState_25_4_11==1))"))&&(X("((TrainState_39_1_4==0)&&(TrainState_24_2_36==1))"))))))
Formula 0 simplified : !XF(G"((TrainState_37_3_24==0)||(TrainState_25_4_11==1))" & X"((TrainState_39_1_4==0)&&(TrainState_24_2_36==1))")
Detected timeout of ITS tools.
[2021-06-08 18:38:22] [INFO ] Flatten gal took : 76 ms
[2021-06-08 18:38:22] [INFO ] Applying decomposition
[2021-06-08 18:38:22] [INFO ] Flatten gal took : 76 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/graph16967734062442485262.txt, -o, /tmp/graph16967734062442485262.bin, -w, /tmp/graph16967734062442485262.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/graph16967734062442485262.bin, -l, -1, -v, -w, /tmp/graph16967734062442485262.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:38:22] [INFO ] Decomposing Gal with order
[2021-06-08 18:38:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:38:22] [INFO ] Removed a total of 1536 redundant transitions.
[2021-06-08 18:38:23] [INFO ] Flatten gal took : 147 ms
[2021-06-08 18:38:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 877 labels/synchronizations in 25 ms.
[2021-06-08 18:38:23] [INFO ] Time to serialize gal into /tmp/LTL12784242880704678383.gal : 18 ms
[2021-06-08 18:38:23] [INFO ] Time to serialize properties into /tmp/LTL5370120666743882096.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12784242880704678383.gal, -t, CGAL, -LTL, /tmp/LTL5370120666743882096.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/LTL12784242880704678383.gal -t CGAL -LTL /tmp/LTL5370120666743882096.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i39.u274.TrainState_37_3_24==0)||(i19.u172.TrainState_25_4_11==1))"))&&(X("((i37.u44.TrainState_39_1_4==0)&&(i7.u382.TrainState_24_2_36==1))"))))))
Formula 0 simplified : !XF(G"((i39.u274.TrainState_37_3_24==0)||(i19.u172.TrainState_25_4_11==1))" & X"((i37.u44.TrainState_39_1_4==0)&&(i7.u382.TrainState_24_2_36==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
61 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.857946,38856,1,0,17337,1229,3393,37446,535,2628,29526
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-07 finished in 23425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((F(p0)||X(X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1998 transition count 4798
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1998 transition count 4798
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 1984 transition count 4784
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 1984 transition count 4784
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1979 transition count 4779
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1979 transition count 4779
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 1974 transition count 4774
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 1974 transition count 4774
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 1971 transition count 4771
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 1971 transition count 4771
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 1969 transition count 4769
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 1969 transition count 4769
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 1967 transition count 4767
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 1967 transition count 4767
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 1965 transition count 4765
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 1965 transition count 4765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 1964 transition count 4764
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 1964 transition count 4764
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 1963 transition count 4763
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 1963 transition count 4763
Applied a total of 116 rules in 697 ms. Remains 1963 /2021 variables (removed 58) and now considering 4763/4821 (removed 58) transitions.
// Phase 1: matrix 4763 rows 1963 cols
[2021-06-08 18:38:24] [INFO ] Computed 40 place invariants in 17 ms
[2021-06-08 18:38:24] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 4763 rows 1963 cols
[2021-06-08 18:38:24] [INFO ] Computed 40 place invariants in 11 ms
[2021-06-08 18:38:25] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
// Phase 1: matrix 4763 rows 1963 cols
[2021-06-08 18:38:25] [INFO ] Computed 40 place invariants in 14 ms
[2021-06-08 18:38:27] [INFO ] Dead Transitions using invariants and state equation in 1743 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1963/2021 places, 4763/4821 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-040-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s118 0) (EQ s560 1)), p1:(OR (EQ s1762 0) (EQ s809 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3780 ms.
Product exploration explored 100000 steps with 25000 reset in 3829 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 3859 ms.
Product exploration explored 100000 steps with 25000 reset in 3866 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1963 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1963/1963 places, 4763/4763 transitions.
Graph (trivial) has 4753 edges and 1963 vertex of which 1910 / 1963 are part of one of the 39 SCC in 6 ms
Free SCC test removed 1871 places
Ensure Unique test removed 4598 transitions
Reduce isomorphic transitions removed 4598 transitions.
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 56 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 37 place count 56 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 56 transition count 130
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 56 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 56 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 48 transition count 120
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 48 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 48 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 48 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 47 transition count 117
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 47 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 47 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 47 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 46 transition count 114
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 46 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 46 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 46 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 81 place count 45 transition count 111
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 45 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 45 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 85 place count 45 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 86 place count 44 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 87 place count 44 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 88 place count 44 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 90 place count 44 transition count 106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 91 place count 43 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 92 place count 43 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 93 place count 43 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 95 place count 43 transition count 103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 96 place count 42 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 97 place count 42 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 42 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 100 place count 42 transition count 100
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 101 place count 41 transition count 99
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 102 place count 41 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 103 place count 41 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 105 place count 41 transition count 97
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 106 place count 40 transition count 96
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 107 place count 40 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 108 place count 40 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 110 place count 40 transition count 94
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 111 place count 39 transition count 93
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 112 place count 39 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 113 place count 39 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 115 place count 39 transition count 91
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 116 place count 38 transition count 90
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 117 place count 38 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 118 place count 38 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 120 place count 38 transition count 88
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 121 place count 37 transition count 87
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 122 place count 37 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 123 place count 37 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 125 place count 37 transition count 85
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 126 place count 36 transition count 84
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 127 place count 36 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 128 place count 36 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 130 place count 36 transition count 82
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 131 place count 35 transition count 81
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 132 place count 35 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 133 place count 35 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 135 place count 35 transition count 79
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 136 place count 34 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 137 place count 34 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 138 place count 34 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 140 place count 34 transition count 76
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 141 place count 33 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 142 place count 33 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 143 place count 33 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 145 place count 33 transition count 73
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 146 place count 32 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 147 place count 32 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 148 place count 32 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 150 place count 32 transition count 70
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 151 place count 31 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 152 place count 31 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 153 place count 31 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 155 place count 31 transition count 67
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 156 place count 30 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 157 place count 30 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 158 place count 30 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 160 place count 30 transition count 64
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 161 place count 29 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 162 place count 29 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 163 place count 29 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 165 place count 29 transition count 61
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 166 place count 28 transition count 60
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 167 place count 28 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 168 place count 28 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 170 place count 28 transition count 58
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 171 place count 27 transition count 57
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 172 place count 27 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 173 place count 27 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 175 place count 27 transition count 55
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 176 place count 26 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 177 place count 26 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 178 place count 26 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 180 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 181 place count 25 transition count 51
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 182 place count 25 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 183 place count 25 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 185 place count 25 transition count 49
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 186 place count 24 transition count 48
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 187 place count 24 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 188 place count 24 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 190 place count 24 transition count 46
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 191 place count 23 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 192 place count 23 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 193 place count 23 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 195 place count 23 transition count 43
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 196 place count 22 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 197 place count 22 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 198 place count 22 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 200 place count 22 transition count 40
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 201 place count 21 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 202 place count 21 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 203 place count 21 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 205 place count 21 transition count 37
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 206 place count 20 transition count 36
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 207 place count 20 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 208 place count 20 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 210 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 211 place count 19 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 212 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 213 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 215 place count 19 transition count 31
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 216 place count 18 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 217 place count 18 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 218 place count 18 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 220 place count 18 transition count 28
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 221 place count 17 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 222 place count 17 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 223 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 225 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 226 place count 16 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 227 place count 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 228 place count 16 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 230 place count 16 transition count 22
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 231 place count 15 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 232 place count 15 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 233 place count 15 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 235 place count 15 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 235 place count 15 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 236 place count 15 transition count 19
Discarding 4 places :
Symmetric choice reduction at 36 with 4 rule applications. Total rules 240 place count 11 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 36 with 4 rules applied. Total rules applied 244 place count 11 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 36 with 3 rules applied. Total rules applied 247 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 247 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 248 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 248 rules in 53 ms. Remains 11 /1963 variables (removed 1952) and now considering 12/4763 (removed 4751) transitions.
[2021-06-08 18:38:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2021-06-08 18:38:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:38:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/1963 places, 12/4763 transitions.
Product exploration explored 100000 steps with 25000 reset in 3888 ms.
Product exploration explored 100000 steps with 25000 reset in 3877 ms.
[2021-06-08 18:38:51] [INFO ] Flatten gal took : 68 ms
[2021-06-08 18:38:51] [INFO ] Flatten gal took : 72 ms
[2021-06-08 18:38:51] [INFO ] Time to serialize gal into /tmp/LTL6493564518642706935.gal : 10 ms
[2021-06-08 18:38:51] [INFO ] Time to serialize properties into /tmp/LTL9757861153869718987.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6493564518642706935.gal, -t, CGAL, -LTL, /tmp/LTL9757861153869718987.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/LTL6493564518642706935.gal -t CGAL -LTL /tmp/LTL9757861153869718987.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("((TrainState_39_1_2==0)||(TrainState_19_3_12==1))"))||(X(X(F("((TrainState_35_2_36==0)||(TrainState_8_1_17==1))")))))))))
Formula 0 simplified : !XXX(F"((TrainState_39_1_2==0)||(TrainState_19_3_12==1))" | XXF"((TrainState_35_2_36==0)||(TrainState_8_1_17==1))")
Detected timeout of ITS tools.
[2021-06-08 18:39:06] [INFO ] Flatten gal took : 70 ms
[2021-06-08 18:39:06] [INFO ] Applying decomposition
[2021-06-08 18:39:06] [INFO ] Flatten gal took : 71 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/graph9165764054028581645.txt, -o, /tmp/graph9165764054028581645.bin, -w, /tmp/graph9165764054028581645.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/graph9165764054028581645.bin, -l, -1, -v, -w, /tmp/graph9165764054028581645.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:39:06] [INFO ] Decomposing Gal with order
[2021-06-08 18:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:39:07] [INFO ] Removed a total of 1530 redundant transitions.
[2021-06-08 18:39:07] [INFO ] Flatten gal took : 136 ms
[2021-06-08 18:39:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 857 labels/synchronizations in 14 ms.
[2021-06-08 18:39:07] [INFO ] Time to serialize gal into /tmp/LTL11738243854588965916.gal : 14 ms
[2021-06-08 18:39:07] [INFO ] Time to serialize properties into /tmp/LTL10063669472380621919.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/LTL11738243854588965916.gal, -t, CGAL, -LTL, /tmp/LTL10063669472380621919.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/LTL11738243854588965916.gal -t CGAL -LTL /tmp/LTL10063669472380621919.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("((i35.u11.TrainState_39_1_2==0)||(i5.u168.TrainState_19_3_12==1))"))||(X(X(F("((i29.u378.TrainState_35_2_36==0)||(i32.u211.TrainState_8_1_17==1))")))))))))
Formula 0 simplified : !XXX(F"((i35.u11.TrainState_39_1_2==0)||(i5.u168.TrainState_19_3_12==1))" | XXF"((i29.u378.TrainState_35_2_36==0)||(i32.u211.TrainState_8_1_17==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
45 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.713711,38372,1,0,3998,932,2114,3657,494,1791,8402
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-040-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-09 finished in 43864 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1998 transition count 4798
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1998 transition count 4798
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 1984 transition count 4784
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 1984 transition count 4784
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1979 transition count 4779
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1979 transition count 4779
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 1974 transition count 4774
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 1974 transition count 4774
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 1971 transition count 4771
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 1971 transition count 4771
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 1969 transition count 4769
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 1969 transition count 4769
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 1967 transition count 4767
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 1967 transition count 4767
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 1965 transition count 4765
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 1965 transition count 4765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 1964 transition count 4764
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 1964 transition count 4764
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 1963 transition count 4763
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 1963 transition count 4763
Applied a total of 116 rules in 697 ms. Remains 1963 /2021 variables (removed 58) and now considering 4763/4821 (removed 58) transitions.
// Phase 1: matrix 4763 rows 1963 cols
[2021-06-08 18:39:08] [INFO ] Computed 40 place invariants in 20 ms
[2021-06-08 18:39:08] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 4763 rows 1963 cols
[2021-06-08 18:39:08] [INFO ] Computed 40 place invariants in 11 ms
[2021-06-08 18:39:09] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
// Phase 1: matrix 4763 rows 1963 cols
[2021-06-08 18:39:09] [INFO ] Computed 40 place invariants in 10 ms
[2021-06-08 18:39:11] [INFO ] Dead Transitions using invariants and state equation in 1776 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1963/2021 places, 4763/4821 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s166 1) (EQ s1122 0) (EQ s338 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 0 reset in 558 ms.
Product exploration explored 100000 steps with 0 reset in 633 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 550 ms.
Product exploration explored 100000 steps with 0 reset in 611 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1963 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1963/1963 places, 4763/4763 transitions.
Graph (trivial) has 4755 edges and 1963 vertex of which 1959 / 1963 are part of one of the 40 SCC in 7 ms
Free SCC test removed 1919 places
Ensure Unique test removed 4716 transitions
Reduce isomorphic transitions removed 4716 transitions.
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 7 transition count 11
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 40 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 41 rules in 15 ms. Remains 7 /1963 variables (removed 1956) and now considering 8/4763 (removed 4755) transitions.
[2021-06-08 18:39:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-06-08 18:39:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:39:13] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/1963 places, 8/4763 transitions.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-11 finished in 6011 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 2021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2021/2021 places, 4821/4821 transitions.
Graph (trivial) has 4819 edges and 2021 vertex of which 2020 / 2021 are part of one of the 40 SCC in 1 ms
Free SCC test removed 1980 places
Ensure Unique test removed 4779 transitions
Reduce isomorphic transitions removed 4779 transitions.
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 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 40 place count 2 transition count 3
Applied a total of 40 rules in 7 ms. Remains 2 /2021 variables (removed 2019) and now considering 3/4821 (removed 4818) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:39:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:39:13] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:39:13] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:39:13] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-06-08 18:39:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:39:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:39:13] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2021 places, 3/4821 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-040-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-040-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-14 finished in 76 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177555296

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-040"
export BK_EXAMINATION="LTLCardinality"
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-040, examination is LTLCardinality"
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-162037990300633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-040.tgz
mv BART-PT-040 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;