Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291400069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 CircularTrains-PT-048, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291400069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 37K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620558733588

Running Version 0
[2021-05-09 11:12:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 11:12:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 11:12:15] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-09 11:12:15] [INFO ] Transformed 96 places.
[2021-05-09 11:12:15] [INFO ] Transformed 48 transitions.
[2021-05-09 11:12:15] [INFO ] Parsed PT model containing 96 places and 48 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 11:12:15] [INFO ] Initial state test concluded for 2 properties.
Support contains 52 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 28 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2021-05-09 11:12:15] [INFO ] Computed 49 place invariants in 24 ms
[2021-05-09 11:12:16] [INFO ] Implicit Places using invariants in 179 ms returned [1, 3, 63, 83, 84, 91, 94]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 212 ms to find 7 implicit places.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:16] [INFO ] Computed 42 place invariants in 5 ms
[2021-05-09 11:12:16] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:16] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:12:16] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/96 places, 48/48 transitions.
[2021-05-09 11:12:16] [INFO ] Flatten gal took : 39 ms
[2021-05-09 11:12:16] [INFO ] Flatten gal took : 15 ms
[2021-05-09 11:12:16] [INFO ] Input system was already deterministic with 48 transitions.
Finished random walk after 169 steps, including 0 resets, run visited all 31 properties in 4 ms. (steps per millisecond=42 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 77 transition count 36
Applied a total of 24 rules in 34 ms. Remains 77 /89 variables (removed 12) and now considering 36/48 (removed 12) transitions.
// Phase 1: matrix 36 rows 77 cols
[2021-05-09 11:12:16] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:12:16] [INFO ] Implicit Places using invariants in 86 ms returned [10, 12, 18, 48, 54, 69, 73, 74, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 89 ms to find 9 implicit places.
[2021-05-09 11:12:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 68 cols
[2021-05-09 11:12:16] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-09 11:12:16] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 68/89 places, 36/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 68 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 65 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 65 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 64 transition count 32
Applied a total of 8 rules in 4 ms. Remains 64 /68 variables (removed 4) and now considering 32/36 (removed 4) transitions.
// Phase 1: matrix 32 rows 64 cols
[2021-05-09 11:12:16] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 11:12:16] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2021-05-09 11:12:16] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-09 11:12:16] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 310 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 22058 steps with 0 reset with depth 22059 and stack size 22059 in 47 ms.
FORMULA CircularTrains-PT-048-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-00 finished in 1747 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 87 transition count 42
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 7 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2021-05-09 11:12:18] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:12:18] [INFO ] Implicit Places using invariants in 68 ms returned [10, 12, 18, 55, 70, 74, 75, 76]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 69 ms to find 8 implicit places.
[2021-05-09 11:12:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 70 cols
[2021-05-09 11:12:18] [INFO ] Computed 34 place invariants in 3 ms
[2021-05-09 11:12:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 70/89 places, 37/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 33
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 33
Applied a total of 8 rules in 4 ms. Remains 66 /70 variables (removed 4) and now considering 33/37 (removed 4) transitions.
// Phase 1: matrix 33 rows 66 cols
[2021-05-09 11:12:18] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:12:18] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2021-05-09 11:12:18] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:12:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Stack based approach found an accepted trace after 14513 steps with 0 reset with depth 14514 and stack size 14514 in 29 ms.
FORMULA CircularTrains-PT-048-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-01 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((F(p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:18] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:12:18] [INFO ] Implicit Places using invariants in 81 ms returned [11, 14, 54, 61, 85, 86]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 81 ms to find 6 implicit places.
// Phase 1: matrix 48 rows 83 cols
[2021-05-09 11:12:18] [INFO ] Computed 36 place invariants in 1 ms
[2021-05-09 11:12:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 83/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 83 cols
[2021-05-09 11:12:18] [INFO ] Computed 36 place invariants in 1 ms
[2021-05-09 11:12:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 83/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 1}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p2:(OR (LT s65 1) (LT s80 1)), p0:(AND (GEQ s0 1) (GEQ s74 1)), p1:(AND (GEQ s18 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-02 finished in 469 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F((!p0 U (p1||G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:19] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:12:19] [INFO ] Implicit Places using invariants in 142 ms returned [11, 14, 20, 54, 61, 78, 84, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 143 ms to find 9 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:12:19] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-09 11:12:19] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:12:19] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-09 11:12:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : CircularTrains-PT-048-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s34 1)), p1:(AND (OR (LT s55 1) (LT s60 1)) (GEQ s2 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-03 finished in 413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p1)&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 8 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:19] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:12:19] [INFO ] Implicit Places using invariants in 58 ms returned [11, 20, 54, 61, 78, 84, 85, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 69 ms to find 8 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:12:19] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:12:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:12:19] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:12:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (AND p1 (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s28 1) (GEQ s33 1)), p0:(AND (GEQ s16 1) (GEQ s48 1)), p2:(AND (GEQ s13 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-04 finished in 384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:20] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:12:20] [INFO ] Implicit Places using invariants in 75 ms returned [11, 14, 20, 54, 61, 78, 84, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 92 ms to find 9 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:12:20] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-09 11:12:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:12:20] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-09 11:12:20] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s58 1)), p1:(AND (GEQ s43 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1943 reset in 219 ms.
Product exploration explored 100000 steps with 1940 reset in 280 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1907 reset in 218 ms.
Product exploration explored 100000 steps with 1935 reset in 211 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 48/48 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 14 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2021-05-09 11:12:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:12:21] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 11:12:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Product exploration explored 100000 steps with 1994 reset in 250 ms.
Product exploration explored 100000 steps with 2018 reset in 246 ms.
[2021-05-09 11:12:22] [INFO ] Flatten gal took : 4 ms
[2021-05-09 11:12:22] [INFO ] Flatten gal took : 4 ms
[2021-05-09 11:12:22] [INFO ] Time to serialize gal into /tmp/LTL8268969533412851325.gal : 2 ms
[2021-05-09 11:12:22] [INFO ] Time to serialize properties into /tmp/LTL12669725201548532543.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/LTL8268969533412851325.gal, -t, CGAL, -LTL, /tmp/LTL12669725201548532543.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/LTL8268969533412851325.gal -t CGAL -LTL /tmp/LTL12669725201548532543.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("((Section_23>=1)&&(F24>=1))")&&(X(F("((Section_21>=1)&&(F22>=1))"))))))
Formula 0 simplified : !F("((Section_23>=1)&&(F24>=1))" & XF"((Section_21>=1)&&(F22>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-09 11:12:37] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:12:37] [INFO ] Applying decomposition
[2021-05-09 11:12:37] [INFO ] Flatten gal took : 3 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/graph18115434770698605646.txt, -o, /tmp/graph18115434770698605646.bin, -w, /tmp/graph18115434770698605646.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/graph18115434770698605646.bin, -l, -1, -v, -w, /tmp/graph18115434770698605646.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 11:12:37] [INFO ] Decomposing Gal with order
[2021-05-09 11:12:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 11:12:37] [INFO ] Flatten gal took : 150 ms
[2021-05-09 11:12:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 11:12:37] [INFO ] Time to serialize gal into /tmp/LTL7586182145591716842.gal : 6 ms
[2021-05-09 11:12:37] [INFO ] Time to serialize properties into /tmp/LTL143699446654573963.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/LTL7586182145591716842.gal, -t, CGAL, -LTL, /tmp/LTL143699446654573963.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/LTL7586182145591716842.gal -t CGAL -LTL /tmp/LTL143699446654573963.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("((i8.u13.Section_23>=1)&&(i8.u2.F24>=1))")&&(X(F("((i8.u13.Section_21>=1)&&(i8.u13.F22>=1))"))))))
Formula 0 simplified : !F("((i8.u13.Section_23>=1)&&(i8.u2.F24>=1))" & XF"((i8.u13.Section_21>=1)&&(i8.u13.F22>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
370 unique states visited
0 strongly connected components in search stack
372 transitions explored
188 items max in DFS search stack
847 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.486,222832,1,0,470013,95,334,350715,118,195,402127
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CircularTrains-PT-048-05 finished in 27032 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)&&F((p2||X((X(!p3) U (X(!p3)&&p4)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:12:47] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:12:47] [INFO ] Implicit Places using invariants in 136 ms returned [11, 14, 20, 61, 84, 85, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 144 ms to find 7 implicit places.
// Phase 1: matrix 48 rows 82 cols
[2021-05-09 11:12:47] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 11:12:47] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Starting structural reductions, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2021-05-09 11:12:47] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 11:12:47] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (NOT p0), (NOT p1), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (AND (NOT p2) p3)]
Running random walk in product with property : CircularTrains-PT-048-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p4), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p4 p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s74 1)), p1:(AND (GEQ s21 1) (GEQ s51 1) (GEQ s0 1) (GEQ s74 1)), p2:(AND (GEQ s9 1) (GEQ s17 1)), p4:(AND (GEQ s9 1) (GEQ s17 1)), p3:(OR (LT s21 1) (LT s51 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2498 reset in 191 ms.
Product exploration explored 100000 steps with 2385 reset in 256 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2), (NOT p4), p3]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (NOT p0), (NOT p1), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 2383 reset in 214 ms.
Product exploration explored 100000 steps with 2508 reset in 253 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (NOT p0), (NOT p1), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (AND (NOT p2) p3)]
Support contains 6 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 82/82 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 82 transition count 48
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 82 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 14 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2021-05-09 11:12:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2021-05-09 11:12:49] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 11:12:49] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 48/48 transitions.
Product exploration explored 100000 steps with 3167 reset in 248 ms.
Product exploration explored 100000 steps with 3233 reset in 257 ms.
[2021-05-09 11:12:50] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:12:50] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:12:50] [INFO ] Time to serialize gal into /tmp/LTL14519693560690679321.gal : 1 ms
[2021-05-09 11:12:50] [INFO ] Time to serialize properties into /tmp/LTL5116047282402165871.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/LTL14519693560690679321.gal, -t, CGAL, -LTL, /tmp/LTL5116047282402165871.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/LTL14519693560690679321.gal -t CGAL -LTL /tmp/LTL5116047282402165871.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((F("((Section_4>=1)&&(F5>=1))"))&&(F("((((Section_28>=1)&&(F29>=1))&&(Section_4>=1))&&(F5>=1))")))&&(F(("((Section_41>=1)&&(F42>=1))")||(X((X("((Section_28>=1)&&(F29>=1))"))U(("((Section_41>=1)&&(F42>=1))")&&(X("((Section_28>=1)&&(F29>=1))")))))))))
Formula 0 simplified : !(F"((Section_4>=1)&&(F5>=1))" & F"((((Section_28>=1)&&(F29>=1))&&(Section_4>=1))&&(F5>=1))" & F("((Section_41>=1)&&(F42>=1))" | X(X"((Section_28>=1)&&(F29>=1))" U ("((Section_41>=1)&&(F42>=1))" & X"((Section_28>=1)&&(F29>=1))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-09 11:13:05] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:13:05] [INFO ] Applying decomposition
[2021-05-09 11:13:05] [INFO ] Flatten gal took : 34 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/graph17745463031021946161.txt, -o, /tmp/graph17745463031021946161.bin, -w, /tmp/graph17745463031021946161.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/graph17745463031021946161.bin, -l, -1, -v, -w, /tmp/graph17745463031021946161.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 11:13:05] [INFO ] Decomposing Gal with order
[2021-05-09 11:13:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 11:13:05] [INFO ] Flatten gal took : 4 ms
[2021-05-09 11:13:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 11:13:05] [INFO ] Time to serialize gal into /tmp/LTL10286439211366006914.gal : 23 ms
[2021-05-09 11:13:05] [INFO ] Time to serialize properties into /tmp/LTL11930665823949041750.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/LTL10286439211366006914.gal, -t, CGAL, -LTL, /tmp/LTL11930665823949041750.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/LTL10286439211366006914.gal -t CGAL -LTL /tmp/LTL11930665823949041750.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((F("((i0.u0.Section_4>=1)&&(i0.u12.F5>=1))"))&&(F("((((i2.u3.Section_28>=1)&&(i2.u3.F29>=1))&&(i0.u0.Section_4>=1))&&(i0.u12.F5>=1))")))&&(F(("((i4.u10.Section_41>=1)&&(i4.u6.F42>=1))")||(X((X("((i2.u3.Section_28>=1)&&(i2.u3.F29>=1))"))U(("((i4.u10.Section_41>=1)&&(i4.u6.F42>=1))")&&(X("((i2.u3.Section_28>=1)&&(i2.u3.F29>=1))")))))))))
Formula 0 simplified : !(F"((i0.u0.Section_4>=1)&&(i0.u12.F5>=1))" & F"((((i2.u3.Section_28>=1)&&(i2.u3.F29>=1))&&(i0.u0.Section_4>=1))&&(i0.u12.F5>=1))" & F("((i4.u10.Section_41>=1)&&(i4.u6.F42>=1))" | X(X"((i2.u3.Section_28>=1)&&(i2.u3.F29>=1))" U ("((i4.u10.Section_41>=1)&&(i4.u6.F42>=1))" & X"((i2.u3.Section_28>=1)&&(i2.u3.F29>=1))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
73 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.751837,51304,1,0,92062,417,472,55619,190,1032,63568
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CircularTrains-PT-048-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CircularTrains-PT-048-06 finished in 19358 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||X(F(((p1&&X(!p2))||G(!p2))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:13:06] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:13:07] [INFO ] Implicit Places using invariants in 1152 ms returned [11, 14, 20, 54, 61, 78, 85, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1166 ms to find 8 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:13:07] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-09 11:13:07] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 32 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:13:07] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-09 11:13:08] [INFO ] Dead Transitions using invariants and state equation in 251 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Running random walk in product with property : CircularTrains-PT-048-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s59 1)), p1:(OR (LT s64 1) (LT s78 1)), p2:(AND (GEQ s9 1) (GEQ s17 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 4306 reset in 184 ms.
Product exploration explored 100000 steps with 4255 reset in 214 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 4317 reset in 180 ms.
Product exploration explored 100000 steps with 4323 reset in 224 ms.
[2021-05-09 11:13:09] [INFO ] Flatten gal took : 2 ms
[2021-05-09 11:13:09] [INFO ] Flatten gal took : 2 ms
[2021-05-09 11:13:09] [INFO ] Time to serialize gal into /tmp/LTL115869150748613303.gal : 2 ms
[2021-05-09 11:13:09] [INFO ] Time to serialize properties into /tmp/LTL5417313697294168648.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/LTL115869150748613303.gal, -t, CGAL, -LTL, /tmp/LTL5417313697294168648.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/LTL115869150748613303.gal -t CGAL -LTL /tmp/LTL5417313697294168648.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((Section_9>=1)&&(F10>=1))"))||(X(F((("((Section_40<1)||(F41<1))")&&(X("((Section_41<1)||(F42<1))")))||(G("((Section_41<1)||(F42<1))")))))))))
Formula 0 simplified : !XG(G"((Section_9>=1)&&(F10>=1))" | XF(("((Section_40<1)||(F41<1))" & X"((Section_41<1)||(F42<1))") | G"((Section_41<1)||(F42<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-09 11:13:24] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:13:24] [INFO ] Applying decomposition
[2021-05-09 11:13:24] [INFO ] Flatten gal took : 3 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/graph2346825929105455306.txt, -o, /tmp/graph2346825929105455306.bin, -w, /tmp/graph2346825929105455306.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/graph2346825929105455306.bin, -l, -1, -v, -w, /tmp/graph2346825929105455306.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 11:13:24] [INFO ] Decomposing Gal with order
[2021-05-09 11:13:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 11:13:24] [INFO ] Flatten gal took : 4 ms
[2021-05-09 11:13:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 11:13:24] [INFO ] Time to serialize gal into /tmp/LTL14909315982333782371.gal : 5 ms
[2021-05-09 11:13:24] [INFO ] Time to serialize properties into /tmp/LTL13124112351102207371.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/LTL14909315982333782371.gal, -t, CGAL, -LTL, /tmp/LTL13124112351102207371.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/LTL14909315982333782371.gal -t CGAL -LTL /tmp/LTL13124112351102207371.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((i2.u2.Section_9>=1)&&(i2.u2.F10>=1))"))||(X(F((("((i3.u11.Section_40<1)||(i3.u4.F41<1))")&&(X("((i3.u11.Section_41<1)||(i3.u4.F42<1))")))||(G("((i3.u11.Section_41<1)||(i3.u4.F42<1))")))))))))
Formula 0 simplified : !XG(G"((i2.u2.Section_9>=1)&&(i2.u2.F10>=1))" | XF(("((i3.u11.Section_40<1)||(i3.u4.F41<1))" & X"((i3.u11.Section_41<1)||(i3.u4.F42<1))") | G"((i3.u11.Section_41<1)||(i3.u4.F42<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10223676464881919813
[2021-05-09 11:13:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10223676464881919813
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10223676464881919813]
Compilation finished in 326 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10223676464881919813]
Link finished in 93 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10223676464881919813]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-048-07 finished in 48406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X((!p1||X((X(G(p2)) U (X(G(p2))&&p3))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:13:54] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:13:55] [INFO ] Implicit Places using invariants in 82 ms returned [11, 14, 20, 54, 61, 78, 84, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:13:55] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:13:55] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:13:55] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-09 11:13:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 655 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (NOT p2) (NOT p3)), (NOT p2), true, (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND p0 p1 p3), acceptance={0} source=7 dest: 9}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=7 dest: 10}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p3), acceptance={} source=8 dest: 11}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=9 dest: 9}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=true, acceptance={} source=11 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s78 1)), p1:(OR (LT s2 1) (LT s34 1)), p3:(AND (GEQ s2 1) (GEQ s34 1)), p2:(AND (GEQ s16 1) (GEQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 2 reset in 0 ms.
FORMULA CircularTrains-PT-048-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-08 finished in 891 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U X((F(p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:13:55] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:13:55] [INFO ] Implicit Places using invariants in 89 ms returned [14, 20, 54, 61, 84, 85, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 97 ms to find 7 implicit places.
// Phase 1: matrix 48 rows 82 cols
[2021-05-09 11:13:55] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 11:13:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2021-05-09 11:13:55] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 11:13:56] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (GEQ s50 1) (GEQ s52 1)), p1:(AND (GEQ s0 1) (GEQ s74 1)), p2:(AND (GEQ s0 1) (GEQ s74 1) (OR (LT s11 1) (LT s77 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-09 finished in 497 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))||(F(p0)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:13:56] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-09 11:13:56] [INFO ] Implicit Places using invariants in 82 ms returned [11, 14, 20, 54, 61, 78, 84, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 83 ms to find 9 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:13:56] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-09 11:13:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 14 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:13:56] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-09 11:13:56] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s55 1) (LT s60 1)) (OR (LT s33 1) (LT s50 1))), p0:(AND (GEQ s46 1) (GEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2927 reset in 305 ms.
Product exploration explored 100000 steps with 2955 reset in 252 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2932 reset in 170 ms.
Product exploration explored 100000 steps with 2934 reset in 188 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 10 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2021-05-09 11:13:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:13:58] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-09 11:13:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Product exploration explored 100000 steps with 5279 reset in 254 ms.
Product exploration explored 100000 steps with 5292 reset in 244 ms.
[2021-05-09 11:13:58] [INFO ] Flatten gal took : 7 ms
[2021-05-09 11:13:58] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:13:58] [INFO ] Time to serialize gal into /tmp/LTL11488982463075474283.gal : 6 ms
[2021-05-09 11:13:58] [INFO ] Time to serialize properties into /tmp/LTL14967452545413702621.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/LTL11488982463075474283.gal, -t, CGAL, -LTL, /tmp/LTL14967452545413702621.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/LTL11488982463075474283.gal -t CGAL -LTL /tmp/LTL14967452545413702621.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((F45>=1)&&(Section_44>=1))")))||(((F("((F45>=1)&&(Section_44>=1))"))&&("((Section_26<1)||(F27<1))"))&&("((F18<1)||(Section_17<1))"))))))
Formula 0 simplified : !XF(GF"((F45>=1)&&(Section_44>=1))" | ("((F18<1)||(Section_17<1))" & "((Section_26<1)||(F27<1))" & F"((F45>=1)&&(Section_44>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
438 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,4.42241,173792,1,0,923,960758,30,185,1707,1.06306e+06,1854
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-048-10 finished in 7951 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G((G(p2)||p1))||(G(p3)&&(G(p2)||p4)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 18 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2021-05-09 11:14:04] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:14:04] [INFO ] Implicit Places using invariants in 33 ms returned [10, 12, 18, 49, 70, 74, 75, 76]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 34 ms to find 8 implicit places.
[2021-05-09 11:14:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 70 cols
[2021-05-09 11:14:04] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-09 11:14:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 70/89 places, 37/48 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 69 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 66 transition count 33
Applied a total of 8 rules in 3 ms. Remains 66 /70 variables (removed 4) and now considering 33/37 (removed 4) transitions.
// Phase 1: matrix 33 rows 66 cols
[2021-05-09 11:14:04] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:14:04] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2021-05-09 11:14:04] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:14:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 452 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CircularTrains-PT-048-11 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p3) p0) (AND (NOT p1) (NOT p2) (NOT p4) p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2) (NOT p4) p0) (AND p1 (NOT p3) p0) (AND p2 (NOT p3) p0)), acceptance={0, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p2 (NOT p3) (NOT p0)) (AND (NOT p1) p2 (NOT p4) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p0)) (AND p1 (NOT p4) (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3 p4 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3 p4 p0), acceptance={0, 1} source=0 dest: 5}, { cond=(OR (AND p1 p3 p4 p0) (AND p2 p3 p0)), acceptance={0} source=0 dest: 5}, { cond=(AND (NOT p1) p2 p3 p4 p0), acceptance={1} source=0 dest: 6}, { cond=(OR (AND (NOT p1) p2 (NOT p3) p0) (AND (NOT p1) p2 (NOT p4) p0)), acceptance={1, 2} source=0 dest: 7}, { cond=(AND p1 p2 p3 (NOT p4) p0), acceptance={2} source=0 dest: 7}, { cond=(AND p1 p3 p4 (NOT p0)), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p1) p2 p3 p4 (NOT p0)), acceptance={} source=0 dest: 9}], [{ cond=true, acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p3) p0) (AND p2 (NOT p3) p0)), acceptance={0, 2} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND p1 p3 p0) (AND p2 p3 p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1} source=5 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={1, 2} source=5 dest: 7}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={0, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p2 p3 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p3) p0) (AND (NOT p1) (NOT p2) (NOT p4) p0)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(OR (AND p1 (NOT p2) (NOT p3) p0) (AND p1 (NOT p2) (NOT p4) p0)), acceptance={0, 2} source=7 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p1) p2 (NOT p3) (NOT p0)) (AND (NOT p1) p2 (NOT p4) (NOT p0))), acceptance={} source=7 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p0)) (AND p1 (NOT p4) (NOT p0))), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3 p4 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3 p4 p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) p3 p4 p0), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p2 p3 p4 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p1 p2 p3 p4 p0), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p1) p2 (NOT p3) p0) (AND (NOT p1) p2 (NOT p4) p0)), acceptance={1, 2} source=7 dest: 7}, { cond=(OR (AND p1 p2 (NOT p3) p0) (AND p1 p2 (NOT p4) p0)), acceptance={2} source=7 dest: 7}, { cond=(AND p1 p3 p4 (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p2 p3 p4 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=8 dest: 4}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 4}, { cond=(AND p2 p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (LT s49 1) (LT s60 1)), p2:(OR (LT s10 1) (LT s63 1)), p3:(OR (LT s7 1) (LT s14 1) (LT s49 1) (LT s60 1)), p0:(OR (LT s49 1) (LT s60 1)), p4:(OR (LT s49 1) (LT s60 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-11 finished in 677 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:14:04] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:14:05] [INFO ] Implicit Places using invariants in 47 ms returned [11, 14, 20, 54, 61, 78, 84, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 60 ms to find 9 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:14:05] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-09 11:14:05] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 11:14:05] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-09 11:14:05] [INFO ] Dead Transitions using invariants and state equation in 834 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s59 1)), p0:(AND (GEQ s9 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-12 finished in 1103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||G(p1)))&&X(X(G((!p1&&X(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:14:06] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:14:06] [INFO ] Implicit Places using invariants in 426 ms returned [11, 14, 20, 54, 61, 78, 84, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 433 ms to find 8 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:14:06] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-09 11:14:06] [INFO ] Dead Transitions using invariants and state equation in 283 ms returned []
Starting structural reductions, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:14:06] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:14:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, p1, true]
Running random walk in product with property : CircularTrains-PT-048-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s63 1) (GEQ s78 1)), p1:(AND (GEQ s8 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-13 finished in 944 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2021-05-09 11:14:07] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 11:14:07] [INFO ] Implicit Places using invariants in 50 ms returned [11, 14, 20, 54, 61, 78, 84, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 61 ms to find 8 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:14:07] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:14:09] [INFO ] Dead Transitions using invariants and state equation in 2171 ms returned []
Starting structural reductions, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 11:14:09] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-09 11:14:09] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s63 1) (GEQ s78 1)), p1:(AND (GEQ s6 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-14 finished in 2545 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((F(p0)&&F(p1)) U p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 89 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 88 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 88 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 7 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2021-05-09 11:14:09] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 11:14:09] [INFO ] Implicit Places using invariants in 57 ms returned [10, 12, 18, 49, 55, 71, 75, 76, 77]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 58 ms to find 9 implicit places.
[2021-05-09 11:14:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 70 cols
[2021-05-09 11:14:09] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 11:14:09] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 67 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 65 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 65 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 6 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2021-05-09 11:14:09] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 11:14:09] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2021-05-09 11:14:09] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 11:14:09] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s17 1) (GEQ s37 1)), p0:(AND (GEQ s39 1) (GEQ s57 1)), p1:(OR (LT s2 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3610 reset in 203 ms.
Product exploration explored 100000 steps with 3572 reset in 224 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3590 reset in 215 ms.
Product exploration explored 100000 steps with 3598 reset in 228 ms.
[2021-05-09 11:14:11] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:14:11] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:14:11] [INFO ] Time to serialize gal into /tmp/LTL16870616250595981553.gal : 1 ms
[2021-05-09 11:14:11] [INFO ] Time to serialize properties into /tmp/LTL3139822941490484405.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/LTL16870616250595981553.gal, -t, CGAL, -LTL, /tmp/LTL3139822941490484405.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/LTL16870616250595981553.gal -t CGAL -LTL /tmp/LTL3139822941490484405.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((F45>=1)&&(Section_44>=1))"))&&(F("((F7<1)||(Section_6<1))")))U("((F19>=1)&&(Section_18>=1))")))))
Formula 0 simplified : !FG((F"((F45>=1)&&(Section_44>=1))" & F"((F7<1)||(Section_6<1))") U "((F19>=1)&&(Section_18>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-09 11:14:26] [INFO ] Flatten gal took : 2 ms
[2021-05-09 11:14:26] [INFO ] Applying decomposition
[2021-05-09 11:14:26] [INFO ] Flatten gal took : 3 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/graph6703849664898339100.txt, -o, /tmp/graph6703849664898339100.bin, -w, /tmp/graph6703849664898339100.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/graph6703849664898339100.bin, -l, -1, -v, -w, /tmp/graph6703849664898339100.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 11:14:26] [INFO ] Decomposing Gal with order
[2021-05-09 11:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 11:14:26] [INFO ] Flatten gal took : 16 ms
[2021-05-09 11:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 11:14:26] [INFO ] Time to serialize gal into /tmp/LTL5747070301899975721.gal : 1 ms
[2021-05-09 11:14:26] [INFO ] Time to serialize properties into /tmp/LTL12603066940889174718.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/LTL5747070301899975721.gal, -t, CGAL, -LTL, /tmp/LTL12603066940889174718.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/LTL5747070301899975721.gal -t CGAL -LTL /tmp/LTL12603066940889174718.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((i5.i0.u23.F45>=1)&&(i5.i0.u28.Section_44>=1))"))&&(F("((i7.u1.F7<1)||(i7.u9.Section_6<1))")))U("((i2.i0.u31.F19>=1)&&(i6.i0.u16.Section_18>=1))")))))
Formula 0 simplified : !FG((F"((i5.i0.u23.F45>=1)&&(i5.i0.u28.Section_44>=1))" & F"((i7.u1.F7<1)||(i7.u9.Section_6<1))") U "((i2.i0.u31.F19>=1)&&(i6.i0.u16.Section_18>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5478785260223772568
[2021-05-09 11:14:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5478785260223772568
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5478785260223772568]
Compilation finished in 180 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5478785260223772568]
Link finished in 33 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([](((<>((LTLAPp0==true))&&<>((LTLAPp1==true))) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5478785260223772568]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-048-15 finished in 46994 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 11:14:56] [INFO ] Applying decomposition
[2021-05-09 11:14:56] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin5441691274699490674
[2021-05-09 11:14:56] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2021-05-09 11:14:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 11:14:56] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2021-05-09 11:14:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 11:14:56] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2021-05-09 11:14:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 11:14:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5441691274699490674
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5441691274699490674]
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/graph7707675918545765864.txt, -o, /tmp/graph7707675918545765864.bin, -w, /tmp/graph7707675918545765864.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/graph7707675918545765864.bin, -l, -1, -v, -w, /tmp/graph7707675918545765864.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 11:14:56] [INFO ] Decomposing Gal with order
[2021-05-09 11:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 11:14:56] [INFO ] Flatten gal took : 4 ms
[2021-05-09 11:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 11:14:56] [INFO ] Time to serialize gal into /tmp/LTLFireability13257770094972219071.gal : 15 ms
[2021-05-09 11:14:56] [INFO ] Time to serialize properties into /tmp/LTLFireability17682096731950264088.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/LTLFireability13257770094972219071.gal, -t, CGAL, -LTL, /tmp/LTLFireability17682096731950264088.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/LTLFireability13257770094972219071.gal -t CGAL -LTL /tmp/LTLFireability17682096731950264088.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(G((G("((i6.u15.Section_9>=1)&&(i6.u15.F10>=1))"))||(X(F((X(!("((i1.u7.Section_41>=1)&&(i1.u7.F42>=1))")))U(((!("((i1.u2.Section_40>=1)&&(i1.u7.F41>=1))"))&&(X(!("((i1.u7.Section_41>=1)&&(i1.u7.F42>=1))"))))||(G(X(!("((i1.u7.Section_41>=1)&&(i1.u7.F42>=1))"))))))))))))
Formula 0 simplified : !XG(G"((i6.u15.Section_9>=1)&&(i6.u15.F10>=1))" | XF(X!"((i1.u7.Section_41>=1)&&(i1.u7.F42>=1))" U ((!"((i1.u2.Section_40>=1)&&(i1.u7.F41>=1))" & X!"((i1.u7.Section_41>=1)&&(i1.u7.F42>=1))") | GX!"((i1.u7.Section_41>=1)&&(i1.u7.F42>=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 481 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5441691274699490674]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((((LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5441691274699490674]
3960 unique states visited
0 strongly connected components in search stack
4299 transitions explored
365 items max in DFS search stack
1156 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,11.5928,201644,1,0,410076,1639,665,367878,335,5311,415100
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(((F(!("((u17.F45<1)||(i1.u7.Section_44<1))")))&&(F("((i6.u8.F7<1)||(i6.u8.Section_6<1))")))U("((i4.i1.u10.F19>=1)&&(i4.i1.u10.Section_18>=1))")))))
Formula 1 simplified : !FG((F!"((u17.F45<1)||(i1.u7.Section_44<1))" & F"((i6.u8.F7<1)||(i6.u8.Section_6<1))") U "((i4.i1.u10.F19>=1)&&(i4.i1.u10.Section_18>=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.027: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: LTL layer: formula: X([](([]((LTLAPp0==true))||X(<>((((LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.050: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.050: "X([](([]((LTLAPp0==true))||X(<>((((LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.050: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.267: There are 55 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.267: State length is 90, there are 59 groups
pins2lts-mc-linux64( 0/ 8), 0.267: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.267: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.267: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.267: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.612: [Blue] ~120 levels ~960 states ~6328 transitions
pins2lts-mc-linux64( 6/ 8), 0.614: [Blue] ~210 levels ~1920 states ~9080 transitions
pins2lts-mc-linux64( 6/ 8), 0.615: [Blue] ~210 levels ~3840 states ~11936 transitions
pins2lts-mc-linux64( 7/ 8), 0.647: [Blue] ~265 levels ~7680 states ~18832 transitions
pins2lts-mc-linux64( 7/ 8), 0.663: [Blue] ~451 levels ~15360 states ~37080 transitions
pins2lts-mc-linux64( 5/ 8), 0.811: [Blue] ~535 levels ~30720 states ~71336 transitions
pins2lts-mc-linux64( 2/ 8), 1.028: [Blue] ~202 levels ~61440 states ~139328 transitions
pins2lts-mc-linux64( 6/ 8), 1.439: [Blue] ~210 levels ~122880 states ~304520 transitions
pins2lts-mc-linux64( 6/ 8), 2.674: [Blue] ~210 levels ~245760 states ~657152 transitions
pins2lts-mc-linux64( 4/ 8), 3.862: [Blue] ~191 levels ~491520 states ~1392032 transitions
pins2lts-mc-linux64( 4/ 8), 5.342: [Blue] ~191 levels ~983040 states ~2864552 transitions
pins2lts-mc-linux64( 3/ 8), 9.981: [Blue] ~205 levels ~1966080 states ~5271920 transitions
pins2lts-mc-linux64( 3/ 8), 18.395: [Blue] ~205 levels ~3932160 states ~11059752 transitions
pins2lts-mc-linux64( 3/ 8), 30.662: [Blue] ~205 levels ~7864320 states ~23711880 transitions
pins2lts-mc-linux64( 3/ 8), 61.154: [Blue] ~205 levels ~15728640 states ~48786368 transitions
pins2lts-mc-linux64( 3/ 8), 123.536: [Blue] ~205 levels ~31457280 states ~105528488 transitions
pins2lts-mc-linux64( 7/ 8), 126.721: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 126.768:
pins2lts-mc-linux64( 0/ 8), 126.768: Explored 29106766 states 107387518 transitions, fanout: 3.689
pins2lts-mc-linux64( 0/ 8), 126.768: Total exploration time 126.500 sec (126.440 sec minimum, 126.470 sec on average)
pins2lts-mc-linux64( 0/ 8), 126.768: States per second: 230093, Transitions per second: 848913
pins2lts-mc-linux64( 0/ 8), 126.768:
pins2lts-mc-linux64( 0/ 8), 126.768: State space has 29823264 states, 26369336 are accepting
pins2lts-mc-linux64( 0/ 8), 126.768: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 126.768: blue states: 29106766 (97.60%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 126.768: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 126.768: all-red states: 27270901 (91.44%), bogus 431248 (1.45%)
pins2lts-mc-linux64( 0/ 8), 126.768:
pins2lts-mc-linux64( 0/ 8), 126.768: Total memory used for local state coloring: 8.2MB
pins2lts-mc-linux64( 0/ 8), 126.768:
pins2lts-mc-linux64( 0/ 8), 126.768: Queue width: 8B, total height: 538040, memory: 4.10MB
pins2lts-mc-linux64( 0/ 8), 126.768: Tree memory: 483.5MB, 17.0 B/state, compr.: 4.7%
pins2lts-mc-linux64( 0/ 8), 126.768: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 126.768: Stored 48 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 126.768: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 126.768: Est. total memory use: 487.6MB (~1028.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((((LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5441691274699490674]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X(<>((((LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5441691274699490674]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 11:35:49] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:35:49] [INFO ] Time to serialize gal into /tmp/LTLFireability8068097172820265402.gal : 2 ms
[2021-05-09 11:35:49] [INFO ] Time to serialize properties into /tmp/LTLFireability11514453364980593310.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/LTLFireability8068097172820265402.gal, -t, CGAL, -LTL, /tmp/LTLFireability11514453364980593310.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/LTLFireability8068097172820265402.gal -t CGAL -LTL /tmp/LTLFireability11514453364980593310.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(((F(!("((F45<1)||(Section_44<1))")))&&(F("((F7<1)||(Section_6<1))")))U("((F19>=1)&&(Section_18>=1))")))))
Formula 0 simplified : !FG((F!"((F45<1)||(Section_44<1))" & F"((F7<1)||(Section_6<1))") U "((F19>=1)&&(Section_18>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-09 11:56:42] [INFO ] Flatten gal took : 15 ms
[2021-05-09 11:56:42] [INFO ] Input system was already deterministic with 48 transitions.
[2021-05-09 11:56:42] [INFO ] Transformed 89 places.
[2021-05-09 11:56:42] [INFO ] Transformed 48 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 11:56:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13742636590923712885.gal : 1 ms
[2021-05-09 11:56:42] [INFO ] Time to serialize properties into /tmp/LTLFireability5586658931714794327.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/LTLFireability13742636590923712885.gal, -t, CGAL, -LTL, /tmp/LTLFireability5586658931714794327.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability13742636590923712885.gal -t CGAL -LTL /tmp/LTLFireability5586658931714794327.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(((F(!("((F45<1)||(Section_44<1))")))&&(F("((F7<1)||(Section_6<1))")))U("((F19>=1)&&(Section_18>=1))")))))
Formula 0 simplified : !FG((F!"((F45<1)||(Section_44<1))" & F"((F7<1)||(Section_6<1))") U "((F19>=1)&&(Section_18>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-048"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-048, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r045-oct2-162038291400069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-048.tgz
mv CircularTrains-PT-048 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;