Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918900732.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 r024-tall-165251918900732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.6K Apr 30 07:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K May 10 09:33 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-LTLFireability-00
FORMULA_NAME CircularTrains-PT-048-LTLFireability-01
FORMULA_NAME CircularTrains-PT-048-LTLFireability-02
FORMULA_NAME CircularTrains-PT-048-LTLFireability-03
FORMULA_NAME CircularTrains-PT-048-LTLFireability-04
FORMULA_NAME CircularTrains-PT-048-LTLFireability-05
FORMULA_NAME CircularTrains-PT-048-LTLFireability-06
FORMULA_NAME CircularTrains-PT-048-LTLFireability-07
FORMULA_NAME CircularTrains-PT-048-LTLFireability-08
FORMULA_NAME CircularTrains-PT-048-LTLFireability-09
FORMULA_NAME CircularTrains-PT-048-LTLFireability-10
FORMULA_NAME CircularTrains-PT-048-LTLFireability-11
FORMULA_NAME CircularTrains-PT-048-LTLFireability-12
FORMULA_NAME CircularTrains-PT-048-LTLFireability-13
FORMULA_NAME CircularTrains-PT-048-LTLFireability-14
FORMULA_NAME CircularTrains-PT-048-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652681979574

Running Version 202205111006
[2022-05-16 06:19:40] [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]
[2022-05-16 06:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:19:40] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-16 06:19:40] [INFO ] Transformed 96 places.
[2022-05-16 06:19:40] [INFO ] Transformed 48 transitions.
[2022-05-16 06:19:40] [INFO ] Parsed PT model containing 96 places and 48 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-048-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 11 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2022-05-16 06:19:41] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-16 06:19:41] [INFO ] Implicit Places using invariants in 193 ms returned [13, 22, 56, 81, 83, 84, 89, 90, 92, 94]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 220 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/96 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 86/96 places, 48/48 transitions.
Support contains 54 out of 86 places after structural reductions.
[2022-05-16 06:19:41] [INFO ] Flatten gal took : 24 ms
[2022-05-16 06:19:41] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:19:41] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 52 out of 86 places (down from 54) after GAL structural reductions.
Finished random walk after 198 steps, including 0 resets, run visited all 32 properties in 34 ms. (steps per millisecond=5 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))&&G(X(p2))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:19:42] [INFO ] Computed 39 place invariants in 7 ms
[2022-05-16 06:19:42] [INFO ] Implicit Places using invariants in 106 ms returned [1, 3, 15, 60, 61, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 106 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s4 1) (LT s79 1) (LT s10 1) (LT s59 1)), p1:(AND (GEQ s10 1) (GEQ s59 1)), p2:(AND (GEQ s36 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-00 finished in 423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p1)||p0))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:19:42] [INFO ] Computed 39 place invariants in 8 ms
[2022-05-16 06:19:42] [INFO ] Implicit Places using invariants in 82 ms returned [1, 3, 15, 60, 61, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 87 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/86 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-LTLFireability-01 automaton TGBA Formula[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}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s39 1) (LT s66 1)), p0:(OR (LT s39 1) (LT s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 4 ms.
FORMULA CircularTrains-PT-048-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)&&F(p0)&&!X(p1)) U !X(p2))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:19:42] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:19:42] [INFO ] Implicit Places using invariants in 111 ms returned [1, 15, 60, 61, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 113 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/86 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 417 ms :[p2, p2, p2, p2, (AND (NOT p1) p2), (AND (NOT p0) p2), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s41 1)), p0:(AND (GEQ s3 1) (GEQ s35 1)), p2:(AND (GEQ s2 1) (GEQ s69 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84 steps with 23 reset in 4 ms.
FORMULA CircularTrains-PT-048-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 42
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 80 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 80 transition count 38
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 76 transition count 38
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 28 place count 72 transition count 34
Applied a total of 28 rules in 20 ms. Remains 72 /86 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 72 cols
[2022-05-16 06:19:43] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 06:19:43] [INFO ] Implicit Places using invariants in 65 ms returned [0, 2, 13, 53, 54, 69]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 66 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/86 places, 34/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 66 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 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 2 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 4 place count 64 transition count 32
Applied a total of 4 rules in 5 ms. Remains 64 /66 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:43] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:19:43] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:43] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:19:43] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/86 places, 32/48 transitions.
Finished structural reductions, in 2 iterations. Remains : 64/86 places, 32/48 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5629 reset in 334 ms.
Product exploration explored 100000 steps with 5575 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:44] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 06:19:44] [INFO ] [Real]Absence check using 31 positive place invariants in 6 ms returned sat
[2022-05-16 06:19:44] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:19:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-16 06:19:44] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 06:19:44] [INFO ] Added : 14 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:44] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:19:44] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:44] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:19:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-16 06:19:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:44] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:19:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:45] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-16 06:19:45] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2022-05-16 06:19:45] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:19:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 06:19:45] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 06:19:45] [INFO ] Added : 14 causal constraints over 3 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5658 reset in 355 ms.
Product exploration explored 100000 steps with 5615 reset in 227 ms.
Built C files in :
/tmp/ltsmin17032733634229021484
[2022-05-16 06:19:45] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-16 06:19:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:19:45] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-16 06:19:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:19:45] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-16 06:19:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:19:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17032733634229021484
Running compilation step : cd /tmp/ltsmin17032733634229021484;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 211 ms.
Running link step : cd /tmp/ltsmin17032733634229021484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17032733634229021484;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10193982562137597949.hoa' '--buchi-type=spotba'
LTSmin run took 70 ms.
FORMULA CircularTrains-PT-048-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 2971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((X(p0)||F(p1))))||G(!p1))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:19:46] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 06:19:46] [INFO ] Implicit Places using invariants in 54 ms returned [1, 15, 60, 61, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 55 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/86 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 131 ms :[false, false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s69 1)), p0:(AND (GEQ s28 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 48263 reset in 190 ms.
Product exploration explored 100000 steps with 48212 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 37 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:47] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 06:19:47] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:47] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 06:19:47] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:47] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 06:19:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 37 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 48273 reset in 137 ms.
Product exploration explored 100000 steps with 48095 reset in 148 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 127 ms :[false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 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 81 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-16 06:19:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:49] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 06:19:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 48/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Product exploration explored 100000 steps with 48247 reset in 156 ms.
Product exploration explored 100000 steps with 48116 reset in 171 ms.
Built C files in :
/tmp/ltsmin1089397510863529096
[2022-05-16 06:19:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1089397510863529096
Running compilation step : cd /tmp/ltsmin1089397510863529096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin1089397510863529096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1089397510863529096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6078418214908509715.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:20:04] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:20:04] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:20:04] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:20:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:20:04] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:20:04] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin18154651805957467160
[2022-05-16 06:20:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18154651805957467160
Running compilation step : cd /tmp/ltsmin18154651805957467160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin18154651805957467160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18154651805957467160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6881735645074365593.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:20:20] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:20:20] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:20:20] [INFO ] Time to serialize gal into /tmp/LTL14671485596068922396.gal : 1 ms
[2022-05-16 06:20:20] [INFO ] Time to serialize properties into /tmp/LTL5534071096033586059.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14671485596068922396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5534071096033586059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1467148...267
Read 1 LTL properties
Checking formula 0 : !((X((F(X((X("((F43>=1)&&(Section_42>=1))"))||(F("((F32>=1)&&(Section_31>=1))")))))||(G("((F32<1)||(Section_31<1))")))))
Formula 0 simplified : !X(FX(X"((F43>=1)&&(Section_42>=1))" | F"((F32>=1)&&(Section_31>=1))") | G"((F32<1)||(Section_31<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
134 unique states visited
0 strongly connected components in search stack
133 transitions explored
132 items max in DFS search stack
779 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,7.82171,225856,1,0,1410,1.20327e+06,40,409,1734,1.59315e+06,3214
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLFireability-04 finished in 43684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(X(F((G(p1)||p2))))||p0)))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 48/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 86 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 82 transition count 44
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 82 transition count 38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 76 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 26 place count 73 transition count 35
Applied a total of 26 rules in 12 ms. Remains 73 /86 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 73 cols
[2022-05-16 06:20:29] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 06:20:29] [INFO ] Implicit Places using invariants in 50 ms returned [0, 2, 13, 53, 54, 70]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 51 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/86 places, 35/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 67 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 64 transition count 32
Applied a total of 6 rules in 3 ms. Remains 64 /67 variables (removed 3) and now considering 32/35 (removed 3) transitions.
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:29] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:20:30] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:30] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:20:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/86 places, 32/48 transitions.
Finished structural reductions, in 2 iterations. Remains : 64/86 places, 32/48 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s11 1) (LT s50 1)), p2:(AND (OR (LT s11 1) (LT s50 1)) (OR (LT s13 1) (LT s60 1))), p0:(OR (LT s17 1) (LT s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1564 reset in 230 ms.
Product exploration explored 100000 steps with 1564 reset in 248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 144 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:31] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 06:20:31] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:31] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 06:20:31] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-16 06:20:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:31] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 06:20:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1609 reset in 214 ms.
Product exploration explored 100000 steps with 1649 reset in 250 ms.
Built C files in :
/tmp/ltsmin5051562317087609089
[2022-05-16 06:20:32] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-16 06:20:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:20:32] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-16 06:20:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:20:32] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-16 06:20:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:20:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5051562317087609089
Running compilation step : cd /tmp/ltsmin5051562317087609089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 117 ms.
Running link step : cd /tmp/ltsmin5051562317087609089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5051562317087609089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14350274902744229569.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:47] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:20:47] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:47] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:20:48] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-16 06:20:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:20:48] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-16 06:20:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin10572796611512757219
[2022-05-16 06:20:48] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-16 06:20:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:20:48] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-16 06:20:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:20:48] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-16 06:20:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:20:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10572796611512757219
Running compilation step : cd /tmp/ltsmin10572796611512757219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin10572796611512757219;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin10572796611512757219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9997872741200845447.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:21:03] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:21:03] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:21:03] [INFO ] Time to serialize gal into /tmp/LTL13360805160559655400.gal : 1 ms
[2022-05-16 06:21:03] [INFO ] Time to serialize properties into /tmp/LTL2949920999020925201.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13360805160559655400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2949920999020925201.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1336080...267
Read 1 LTL properties
Checking formula 0 : !((G(F(X(((F(X(F((G("((Section_23<1)||(F24<1))"))||("(((Section_23<1)||(F24<1))&&((F48<1)||(Section_47<1)))")))))||("(F19<1)"))||("(Se...173
Formula 0 simplified : !GFX("(F19<1)" | "(Section_18<1)" | FXF("(((Section_23<1)||(F24<1))&&((F48<1)||(Section_47<1)))" | G"((Section_23<1)||(F24<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
527 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,5.28848,161064,1,0,1072,942856,43,211,1458,1.03546e+06,2402
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 39993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:21:09] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:21:09] [INFO ] Implicit Places using invariants in 60 ms returned [1, 3, 15, 60, 61, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 61 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 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.
Finished structural reductions, in 2 iterations. Remains : 80/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s8 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-07 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(G(!p0))||p0)) U (F((X(p2)&&p1)) U p3)))'
Support contains 8 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:21:10] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 06:21:10] [INFO ] Implicit Places using invariants in 64 ms returned [1, 3, 15, 60, 61, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 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.
Finished structural reductions, in 2 iterations. Remains : 80/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=p1, acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={0} source=8 dest: 7}, { cond=(NOT p3), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(AND (GEQ s39 1) (GEQ s66 1)), p1:(AND (GEQ s27 1) (GEQ s32 1)), p0:(AND (GEQ s8 1) (GEQ s35 1)), p2:(AND (GEQ s9 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p1 p0 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p3) (NOT p1) p0)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p3) p1 p0)), (X (NOT (AND (NOT p3) p1 p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p3) p1 (NOT p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 1581 ms. Reduced automaton from 9 states, 32 edges and 4 AP to 9 states, 32 edges and 4 AP.
Stuttering acceptance computed with spot in 356 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
Finished random walk after 174 steps, including 0 resets, run visited all 20 properties in 13 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p3) p1 p0 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p3) (NOT p1) p0)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p3) p1 p0)), (X (NOT (AND (NOT p3) p1 p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p3) p1 (NOT p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT (AND p1 (NOT p3)))), (F p3), (F (AND (NOT p1) (NOT p3))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 6 factoid took 2096 ms. Reduced automaton from 9 states, 32 edges and 4 AP to 9 states, 32 edges and 4 AP.
Stuttering acceptance computed with spot in 360 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 322 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:15] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:21:15] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2022-05-16 06:21:15] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:21:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-16 06:21:15] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:21:15] [INFO ] Added : 29 causal constraints over 6 iterations in 65 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:15] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:21:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:16] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:21:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:16] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:21:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 1807 ms. Reduced automaton from 9 states, 32 edges and 4 AP to 9 states, 32 edges and 4 AP.
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
Finished random walk after 82 steps, including 0 resets, run visited all 20 properties in 17 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT (AND p1 (NOT p3)))), (F p3), (F (AND (NOT p1) (NOT p3))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 6 factoid took 2182 ms. Reduced automaton from 9 states, 32 edges and 4 AP to 9 states, 32 edges and 4 AP.
Stuttering acceptance computed with spot in 385 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 473 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:21] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:21:21] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2022-05-16 06:21:21] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:21:21] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 06:21:21] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 06:21:21] [INFO ] Added : 29 causal constraints over 6 iterations in 64 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 358 ms :[(NOT p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND p0 (NOT p3)), (AND p0 (NOT p2)), false, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 205 ms.
Product exploration explored 100000 steps with 0 reset in 261 ms.
Built C files in :
/tmp/ltsmin6600892477239456806
[2022-05-16 06:21:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6600892477239456806
Running compilation step : cd /tmp/ltsmin6600892477239456806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin6600892477239456806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6600892477239456806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12501986645580609851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 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
[2022-05-16 06:21:37] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-16 06:21:37] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:37] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:21:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:21:37] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:21:37] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin4098601672596447125
[2022-05-16 06:21:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4098601672596447125
Running compilation step : cd /tmp/ltsmin4098601672596447125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin4098601672596447125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4098601672596447125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6129352162185613088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:21:52] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:21:52] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:21:52] [INFO ] Time to serialize gal into /tmp/LTL3618408764476500064.gal : 1 ms
[2022-05-16 06:21:52] [INFO ] Time to serialize properties into /tmp/LTL1359541507934869475.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3618408764476500064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1359541507934869475.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3618408...266
Read 1 LTL properties
Checking formula 0 : !(((G((X(G(!("((Section_39>=1)&&(F40>=1))"))))||("((Section_39>=1)&&(F40>=1))")))U((F(((X("((Section_41>=1)&&(F42>=1))"))&&("(F43>=1)"...213
Formula 0 simplified : !(G("((Section_39>=1)&&(F40>=1))" | XG!"((Section_39>=1)&&(F40>=1))") U (F("(F43>=1)" & "(Section_42>=1)" & X"((Section_41>=1)&&(F42...194
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:22:07] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:22:07] [INFO ] Applying decomposition
[2022-05-16 06:22:07] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15039726623890656200.txt' '-o' '/tmp/graph15039726623890656200.bin' '-w' '/tmp/graph15039726623890656200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15039726623890656200.bin' '-l' '-1' '-v' '-w' '/tmp/graph15039726623890656200.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:22:08] [INFO ] Decomposing Gal with order
[2022-05-16 06:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:22:08] [INFO ] Flatten gal took : 32 ms
[2022-05-16 06:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:22:08] [INFO ] Time to serialize gal into /tmp/LTL8299244657057442702.gal : 1 ms
[2022-05-16 06:22:08] [INFO ] Time to serialize properties into /tmp/LTL16942454142746594826.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8299244657057442702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16942454142746594826.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8299244...246
Read 1 LTL properties
Checking formula 0 : !(((G((X(G(!("((i2.u9.Section_39>=1)&&(i2.u9.F40>=1))"))))||("((i2.u9.Section_39>=1)&&(i2.u9.F40>=1))")))U((F(((X("((i2.u9.Section_41>...274
Formula 0 simplified : !(G("((i2.u9.Section_39>=1)&&(i2.u9.F40>=1))" | XG!"((i2.u9.Section_39>=1)&&(i2.u9.F40>=1))") U (F("(i8.u3.F43>=1)" & "(i8.u3.Sectio...255
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11553535902799515295
[2022-05-16 06:22:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11553535902799515295
Running compilation step : cd /tmp/ltsmin11553535902799515295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 135 ms.
Running link step : cd /tmp/ltsmin11553535902799515295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11553535902799515295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X([](!(LTLAPp0==true)))||(LTLAPp0==true))) U (<>((X((LTLAPp2==true))&&(LTLAPp1==true))) U (LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 1625 ms.
FORMULA CircularTrains-PT-048-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 74790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)||p1)))&&X(p2))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:22:24] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:22:24] [INFO ] Implicit Places using invariants in 68 ms returned [1, 3, 60, 61, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/86 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.
Finished structural reductions, in 2 iterations. Remains : 81/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s42 1) (GEQ s63 1)), p0:(OR (LT s50 1) (LT s52 1) (LT s13 1) (LT s75 1)), p1:(AND (OR (LT s42 1) (LT s63 1)) (OR (LT s13 1) (LT s75 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1008 reset in 222 ms.
Product exploration explored 100000 steps with 1003 reset in 233 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 370 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 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
[2022-05-16 06:22:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:22:26] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:22:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:22:27] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:22:27] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:22:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 304 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 419 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1005 reset in 215 ms.
Product exploration explored 100000 steps with 1007 reset in 234 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 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 81 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-16 06:22:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:22:29] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:22:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 48/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Product exploration explored 100000 steps with 1659 reset in 239 ms.
Product exploration explored 100000 steps with 1637 reset in 261 ms.
Built C files in :
/tmp/ltsmin10138071698397026617
[2022-05-16 06:22:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10138071698397026617
Running compilation step : cd /tmp/ltsmin10138071698397026617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin10138071698397026617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10138071698397026617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased691094516476783714.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 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
[2022-05-16 06:22:45] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:22:45] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:22:45] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:22:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:22:45] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:22:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin5468815160453924989
[2022-05-16 06:22:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5468815160453924989
Running compilation step : cd /tmp/ltsmin5468815160453924989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 123 ms.
Running link step : cd /tmp/ltsmin5468815160453924989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5468815160453924989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17051920537569705950.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:23:00] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:23:00] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:23:00] [INFO ] Time to serialize gal into /tmp/LTL15873982177247288878.gal : 1 ms
[2022-05-16 06:23:00] [INFO ] Time to serialize properties into /tmp/LTL4161680706027971737.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15873982177247288878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4161680706027971737.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1587398...267
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((Section_48<1)||(F1<1))||((F14<1)||(Section_13<1)))"))||("(((Section_12<1)||(F13<1))&&((F14<1)||(Section_13<1)))"))))&...193
Formula 0 simplified : !F(GF("(((Section_12<1)||(F13<1))&&((F14<1)||(Section_13<1)))" | G"(((Section_48<1)||(F1<1))||((F14<1)||(Section_13<1)))") & X"((Sec...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:23:15] [INFO ] Flatten gal took : 18 ms
[2022-05-16 06:23:15] [INFO ] Applying decomposition
[2022-05-16 06:23:15] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18043441670301900767.txt' '-o' '/tmp/graph18043441670301900767.bin' '-w' '/tmp/graph18043441670301900767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18043441670301900767.bin' '-l' '-1' '-v' '-w' '/tmp/graph18043441670301900767.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:23:15] [INFO ] Decomposing Gal with order
[2022-05-16 06:23:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:23:15] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:23:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 06:23:15] [INFO ] Time to serialize gal into /tmp/LTL13187943271485349628.gal : 1 ms
[2022-05-16 06:23:15] [INFO ] Time to serialize properties into /tmp/LTL18130198309519280275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13187943271485349628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18130198309519280275.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1318794...247
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((i8.u15.Section_48<1)||(i8.u15.F1<1))||((i1.u4.F14<1)||(i1.u14.Section_13<1)))"))||("(((i1.u14.Section_12<1)||(i1.u14....261
Formula 0 simplified : !F(GF("(((i1.u14.Section_12<1)||(i1.u14.F13<1))&&((i1.u4.F14<1)||(i1.u14.Section_13<1)))" | G"(((i8.u15.Section_48<1)||(i8.u15.F1<1)...247
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17208547456980652600
[2022-05-16 06:23:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17208547456980652600
Running compilation step : cd /tmp/ltsmin17208547456980652600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin17208547456980652600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17208547456980652600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))&&X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLFireability-09 finished in 80746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(G((F(p3)||p2))||p1))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:23:45] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:23:45] [INFO ] Implicit Places using invariants in 58 ms returned [3, 15, 60, 61, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 60 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/86 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.
Finished structural reductions, in 2 iterations. Remains : 81/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p3), (AND (NOT p3) p1 (NOT p2)), true]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s20 1)), p2:(OR (LT s1 1) (LT s20 1)), p3:(OR (LT s34 1) (LT s51 1)), p0:(AND (GEQ s38 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 41 steps with 14 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((F(X(p0)) U X(F(p1)))||X(p2))))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:23:45] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:23:45] [INFO ] Implicit Places using invariants in 55 ms returned [1, 3, 15, 60, 61]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/86 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.
Finished structural reductions, in 2 iterations. Remains : 81/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s49 1) (GEQ s51 1)), p1:(OR (AND (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s12 1) (GEQ s78 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2883 reset in 229 ms.
Product exploration explored 100000 steps with 2864 reset in 246 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p2 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 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
[2022-05-16 06:23:47] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:23:47] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:23:47] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:23:47] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:23:47] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:23:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 2853 reset in 229 ms.
Product exploration explored 100000 steps with 2887 reset in 241 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 81 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 12 place count 81 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 81 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-16 06:23:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:23:49] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:23:49] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 48/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Product exploration explored 100000 steps with 3242 reset in 253 ms.
Product exploration explored 100000 steps with 3220 reset in 265 ms.
Built C files in :
/tmp/ltsmin5730110954840613987
[2022-05-16 06:23:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5730110954840613987
Running compilation step : cd /tmp/ltsmin5730110954840613987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin5730110954840613987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5730110954840613987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1637461655318466443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 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
[2022-05-16 06:24:05] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:24:05] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:24:05] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:24:05] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:24:05] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:24:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin5157980904467907846
[2022-05-16 06:24:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5157980904467907846
Running compilation step : cd /tmp/ltsmin5157980904467907846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin5157980904467907846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5157980904467907846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1402622768094651026.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:24:20] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:24:20] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:24:20] [INFO ] Time to serialize gal into /tmp/LTL12409572791011166056.gal : 2 ms
[2022-05-16 06:24:20] [INFO ] Time to serialize properties into /tmp/LTL9499675466830418798.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12409572791011166056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9499675466830418798.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1240957...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(((F(X("((Section_16>=1)&&(F17>=1))")))U(X(F("(((Section_41>=1)&&(F42>=1))||((Section_16>=1)&&(F17>=1)))"))))||(X("((Section_4...178
Formula 0 simplified : !XGX((FX"((Section_16>=1)&&(F17>=1))" U XF"(((Section_41>=1)&&(F42>=1))||((Section_16>=1)&&(F17>=1)))") | X"((Section_48>=1)&&(F1>=1...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
983 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,9.84164,306728,1,0,409,1.85573e+06,29,14,1825,1.5399e+06,994
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLFireability-11 finished in 46259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||p1))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:24:32] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:24:32] [INFO ] Implicit Places using invariants in 66 ms returned [1, 3, 15, 60, 61, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 66 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 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.
Finished structural reductions, in 2 iterations. Remains : 80/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (LT s13 1) (LT s73 1)), p1:(AND (GEQ s6 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2919 reset in 226 ms.
Product exploration explored 100000 steps with 2938 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 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
[2022-05-16 06:24:33] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:24:33] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:24:33] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:24:33] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:24:33] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 06:24:33] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2908 reset in 224 ms.
Product exploration explored 100000 steps with 2955 reset in 241 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 80 transition count 48
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 12 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 4 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 5 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-16 06:24:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:24:34] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:24:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 48/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Product exploration explored 100000 steps with 5327 reset in 269 ms.
Product exploration explored 100000 steps with 5359 reset in 285 ms.
Built C files in :
/tmp/ltsmin13715951810891540452
[2022-05-16 06:24:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13715951810891540452
Running compilation step : cd /tmp/ltsmin13715951810891540452;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin13715951810891540452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13715951810891540452;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11742544020235139313.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 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
[2022-05-16 06:24:50] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:24:50] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:24:50] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:24:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 80 cols
[2022-05-16 06:24:50] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:24:50] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin3959938033893926068
[2022-05-16 06:24:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3959938033893926068
Running compilation step : cd /tmp/ltsmin3959938033893926068;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin3959938033893926068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3959938033893926068;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3730113603267815208.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:25:05] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:25:05] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:25:05] [INFO ] Time to serialize gal into /tmp/LTL15319842590352772556.gal : 1 ms
[2022-05-16 06:25:05] [INFO ] Time to serialize properties into /tmp/LTL12199413487003903405.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15319842590352772556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12199413487003903405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1531984...268
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((F21<1)||(Section_20<1))"))||("((Section_32>=1)&&(F33>=1))")))))
Formula 0 simplified : !XF("((Section_32>=1)&&(F33>=1))" | G"((F21<1)||(Section_20<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1361 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.6343,425812,1,0,1632,2.48666e+06,30,437,1704,3.2669e+06,3271
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 48731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((G((X(X(X(p2)))&&p1))&&p0)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:25:20] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 06:25:20] [INFO ] Implicit Places using invariants in 55 ms returned [1, 3, 15, 83]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 82/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 663 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 9}, { cond=(AND p0 p1), acceptance={} source=5 dest: 10}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 11}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 12}, { cond=(AND p0 p1), acceptance={} source=6 dest: 13}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 8}, { cond=p1, acceptance={0} source=7 dest: 9}, { cond=p1, acceptance={} source=7 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=8 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=9 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=11 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=11 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=11 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=12 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0} source=13 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s57 1) (GEQ s80 1)), p1:(AND (GEQ s58 1) (GEQ s72 1)), p2:(AND (GEQ s57 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 702 reset in 227 ms.
Product exploration explored 100000 steps with 641 reset in 246 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 14 states, 38 edges and 3 AP to 14 states, 38 edges and 3 AP.
Stuttering acceptance computed with spot in 656 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:23] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-16 06:25:23] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 373 ms. Reduced automaton from 14 states, 38 edges and 3 AP to 14 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 622 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 676 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:24] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-16 06:25:24] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2022-05-16 06:25:24] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 06:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:25:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 06:25:24] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 06:25:24] [INFO ] Added : 29 causal constraints over 6 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:24] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-16 06:25:24] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2022-05-16 06:25:24] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 06:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:25:24] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-16 06:25:24] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:25:25] [INFO ] Added : 29 causal constraints over 6 iterations in 60 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:25] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-16 06:25:25] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2022-05-16 06:25:25] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-16 06:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:25:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 06:25:25] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:25:25] [INFO ] Added : 29 causal constraints over 6 iterations in 44 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 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
[2022-05-16 06:25:25] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-16 06:25:25] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:25] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-16 06:25:25] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:25] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-16 06:25:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 14 states, 30 edges and 3 AP to 14 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 637 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 9 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 407 ms. Reduced automaton from 14 states, 30 edges and 3 AP to 14 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 671 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 686 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:28] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 06:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 06:25:28] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:25:28] [INFO ] Added : 29 causal constraints over 6 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:28] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 06:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-16 06:25:28] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 06:25:28] [INFO ] Added : 29 causal constraints over 6 iterations in 50 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 48 rows 82 cols
[2022-05-16 06:25:28] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 06:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:25:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 06:25:28] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 06:25:28] [INFO ] Added : 29 causal constraints over 6 iterations in 42 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 648 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 694 reset in 226 ms.
Product exploration explored 100000 steps with 664 reset in 241 ms.
Built C files in :
/tmp/ltsmin14175638501568911700
[2022-05-16 06:25:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14175638501568911700
Running compilation step : cd /tmp/ltsmin14175638501568911700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin14175638501568911700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14175638501568911700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10851692229518057492.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA CircularTrains-PT-048-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-14 finished in 9281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G((!(F(p1) U p0)&&p2))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 86 cols
[2022-05-16 06:25:30] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-16 06:25:30] [INFO ] Implicit Places using invariants in 57 ms returned [1, 3, 15, 61, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 58 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/86 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.
Finished structural reductions, in 2 iterations. Remains : 81/86 places, 48/48 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p2) p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p2:(OR (LT s57 1) (LT s79 1)), p0:(AND (GEQ s48 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2971 reset in 244 ms.
Product exploration explored 100000 steps with 2918 reset in 244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (OR (NOT p2) p0)), (X (NOT (OR (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 241 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p2 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (OR (NOT p2) p0)), (X (NOT (OR (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (NOT p2) p0)), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 317 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 81/81 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
[2022-05-16 06:25:31] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:25:31] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:25:31] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:25:32] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:25:32] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:25:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (X (NOT p0)))]
False Knowledge obtained : [(X (OR (NOT p2) p0)), (X (NOT (OR (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 36 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) p2), (X (X (NOT p0)))]
False Knowledge obtained : [(X (OR (NOT p2) p0)), (X (NOT (OR (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (NOT p2) p0)), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 362 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2940 reset in 227 ms.
Product exploration explored 100000 steps with 2931 reset in 243 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 81 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 12 place count 81 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 81 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-16 06:25:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:25:34] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:25:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 48/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Product exploration explored 100000 steps with 5096 reset in 276 ms.
Product exploration explored 100000 steps with 5121 reset in 296 ms.
Built C files in :
/tmp/ltsmin16230767730274150308
[2022-05-16 06:25:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16230767730274150308
Running compilation step : cd /tmp/ltsmin16230767730274150308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 122 ms.
Running link step : cd /tmp/ltsmin16230767730274150308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16230767730274150308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14570840301220245713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:25:49] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:25:49] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:25:49] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:25:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:25:49] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:25:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin17542264829536408794
[2022-05-16 06:25:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17542264829536408794
Running compilation step : cd /tmp/ltsmin17542264829536408794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin17542264829536408794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17542264829536408794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8159465388685582542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:26:05] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:26:05] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:26:05] [INFO ] Time to serialize gal into /tmp/LTL16028310593002126022.gal : 1 ms
[2022-05-16 06:26:05] [INFO ] Time to serialize properties into /tmp/LTL6457433994846051565.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16028310593002126022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6457433994846051565.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1602831...267
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((F6>=1)&&(Section_5>=1))"))))||(G((!((F("((Section_39>=1)&&(F40>=1))"))U("((F6>=1)&&(Section_5>=1))")))&&("((F47<1)||(Sect...171
Formula 0 simplified : !(XXF"((F6>=1)&&(Section_5>=1))" | G("((F47<1)||(Section_46<1))" & !(F"((Section_39>=1)&&(F40>=1))" U "((F6>=1)&&(Section_5>=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:26:20] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:26:20] [INFO ] Applying decomposition
[2022-05-16 06:26:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6251910120945815903.txt' '-o' '/tmp/graph6251910120945815903.bin' '-w' '/tmp/graph6251910120945815903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6251910120945815903.bin' '-l' '-1' '-v' '-w' '/tmp/graph6251910120945815903.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:26:20] [INFO ] Decomposing Gal with order
[2022-05-16 06:26:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:26:20] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:26:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 06:26:20] [INFO ] Time to serialize gal into /tmp/LTL9436619051392925470.gal : 1 ms
[2022-05-16 06:26:20] [INFO ] Time to serialize properties into /tmp/LTL11576574855285989423.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9436619051392925470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11576574855285989423.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9436619...246
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i6.u11.F6>=1)&&(u0.Section_5>=1))"))))||(G((!((F("((i0.u9.Section_39>=1)&&(i0.u9.F40>=1))"))U("((i6.u11.F6>=1)&&(u0.Secti...217
Formula 0 simplified : !(XXF"((i6.u11.F6>=1)&&(u0.Section_5>=1))" | G("((i9.u15.F47<1)||(i9.u15.Section_46<1))" & !(F"((i0.u9.Section_39>=1)&&(i0.u9.F40>=1...201
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
289 unique states visited
0 strongly connected components in search stack
288 transitions explored
146 items max in DFS search stack
1192 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.9357,368736,1,0,922892,232,396,589770,157,562,810938
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLFireability-15 finished in 63340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)||p1)))&&X(p2))))'
Found a CL insensitive property : CircularTrains-PT-048-LTLFireability-09
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 86/86 places, 48/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 42
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 80 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 80 transition count 39
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 18 place count 77 transition count 39
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 26 place count 73 transition count 35
Applied a total of 26 rules in 10 ms. Remains 73 /86 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 73 cols
[2022-05-16 06:26:33] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 06:26:33] [INFO ] Implicit Places using invariants in 51 ms returned [0, 2, 53, 54, 70]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 52 ms to find 5 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 68/86 places, 35/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 68 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 66 transition count 33
Applied a total of 4 rules in 7 ms. Remains 66 /68 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:33] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:26:33] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:33] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:26:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 66/86 places, 33/48 transitions.
Finished structural reductions, in 2 iterations. Remains : 66/86 places, 33/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s35 1) (GEQ s55 1)), p0:(OR (LT s43 1) (LT s45 1) (LT s10 1) (LT s63 1)), p1:(AND (OR (LT s35 1) (LT s55 1)) (OR (LT s10 1) (LT s63 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1694 reset in 209 ms.
Product exploration explored 100000 steps with 1626 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 347 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 410 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:35] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:26:35] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:35] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:26:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:35] [INFO ] Computed 34 place invariants in 6 ms
[2022-05-16 06:26:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 33/33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 149 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 341 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1613 reset in 218 ms.
Product exploration explored 100000 steps with 1668 reset in 231 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2022-05-16 06:26:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:38] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:26:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 33/33 transitions.
Product exploration explored 100000 steps with 1629 reset in 221 ms.
Product exploration explored 100000 steps with 1699 reset in 246 ms.
Built C files in :
/tmp/ltsmin5847615106818356977
[2022-05-16 06:26:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5847615106818356977
Running compilation step : cd /tmp/ltsmin5847615106818356977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 115 ms.
Running link step : cd /tmp/ltsmin5847615106818356977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5847615106818356977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased479432967695711719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:53] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:26:53] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:53] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:26:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:26:53] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 06:26:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin8459254248639149432
[2022-05-16 06:26:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8459254248639149432
Running compilation step : cd /tmp/ltsmin8459254248639149432;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 114 ms.
Running link step : cd /tmp/ltsmin8459254248639149432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8459254248639149432;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12313159560417340811.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:27:09] [INFO ] Flatten gal took : 2 ms
[2022-05-16 06:27:09] [INFO ] Flatten gal took : 2 ms
[2022-05-16 06:27:09] [INFO ] Time to serialize gal into /tmp/LTL9955670934468775549.gal : 0 ms
[2022-05-16 06:27:09] [INFO ] Time to serialize properties into /tmp/LTL8914686701460152551.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9955670934468775549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8914686701460152551.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9955670...266
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((Section_48<1)||(F1<1))||((F14<1)||(Section_13<1)))"))||("(((Section_12<1)||(F13<1))&&((F14<1)||(Section_13<1)))"))))&...193
Formula 0 simplified : !F(GF("(((Section_12<1)||(F13<1))&&((F14<1)||(Section_13<1)))" | G"(((Section_48<1)||(F1<1))||((F14<1)||(Section_13<1)))") & X"((Sec...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:27:24] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:27:24] [INFO ] Applying decomposition
[2022-05-16 06:27:24] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16155751930765435946.txt' '-o' '/tmp/graph16155751930765435946.bin' '-w' '/tmp/graph16155751930765435946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16155751930765435946.bin' '-l' '-1' '-v' '-w' '/tmp/graph16155751930765435946.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:27:24] [INFO ] Decomposing Gal with order
[2022-05-16 06:27:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:27:24] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:27:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 06:27:24] [INFO ] Time to serialize gal into /tmp/LTL16054179025158617568.gal : 1 ms
[2022-05-16 06:27:24] [INFO ] Time to serialize properties into /tmp/LTL13878878235208999059.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16054179025158617568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13878878235208999059.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1605417...247
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((i2.u8.Section_48<1)||(i7.i0.u2.F1<1))||((i8.u29.F14<1)||(i8.u29.Section_13<1)))"))||("(((i8.u29.Section_12<1)||(i8.u2...264
Formula 0 simplified : !F(GF("(((i8.u29.Section_12<1)||(i8.u29.F13<1))&&((i8.u29.F14<1)||(i8.u29.Section_13<1)))" | G"(((i2.u8.Section_48<1)||(i7.i0.u2.F1<...250
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
253 unique states visited
0 strongly connected components in search stack
390 transitions explored
139 items max in DFS search stack
989 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,9.903,354644,1,0,819714,175,472,722001,144,320,761983
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property CircularTrains-PT-048-LTLFireability-09 finished in 62534 ms.
FORMULA CircularTrains-PT-048-LTLFireability-09 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 06:27:36] [INFO ] Flatten gal took : 3 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 475337 ms.

BK_STOP 1652682456220

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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 r024-tall-165251918900732"
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 ;