Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593500708.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BART-COL-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593500708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 05:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 04:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678524954818

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-010
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-11 08:55:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 08:55:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:55:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 08:55:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 08:55:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 661 ms
[2023-03-11 08:55:58] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-11 08:55:58] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 12833 PT places and 1.407229512E10 transition bindings in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 08:55:59] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 8 ms.
[2023-03-11 08:55:59] [INFO ] Skeletonized 2 HLPN properties in 1 ms. Removed 14 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 10
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2023-03-11 08:55:59] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 205 ms.
[2023-03-11 08:55:59] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:55:59] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 08:55:59] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-11 08:55:59] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-11 08:55:59] [INFO ] Invariant cache hit.
[2023-03-11 08:55:59] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-11 08:55:59] [INFO ] Invariant cache hit.
[2023-03-11 08:56:00] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-11 08:56:00] [INFO ] Flatten gal took : 39 ms
[2023-03-11 08:56:00] [INFO ] Flatten gal took : 19 ms
[2023-03-11 08:56:00] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 1664 steps, including 0 resets, run visited all 12 properties in 53 ms. (steps per millisecond=31 )
FORMULA BART-COL-010-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 49 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2023-03-11 08:56:01] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:56:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 08:56:01] [INFO ] Invariant cache hit.
[2023-03-11 08:56:01] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-11 08:56:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 08:56:01] [INFO ] Invariant cache hit.
[2023-03-11 08:56:01] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s15 1) (GEQ s19 1) (GEQ s7 1) (GEQ s62 1) (GEQ s11 1) (GEQ s54 1) (GEQ s3 1) (GEQ s58 1) (GEQ s46 1) (GEQ s50 1) (GEQ s37 1) (GEQ s86 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA BART-COL-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-01 finished in 832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 71 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2023-03-11 08:56:02] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:56:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 08:56:02] [INFO ] Invariant cache hit.
[2023-03-11 08:56:02] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-11 08:56:02] [INFO ] Invariant cache hit.
[2023-03-11 08:56:02] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1), p1:(GEQ s0 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA BART-COL-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-02 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (X(p1) U p0)))'
Support contains 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 08:56:02] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:56:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 08:56:02] [INFO ] Invariant cache hit.
[2023-03-11 08:56:02] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-11 08:56:02] [INFO ] Invariant cache hit.
[2023-03-11 08:56:02] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (GEQ s105 1) (GE...], 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]]
Entered a terminal (fully accepting) state of product in 91 steps with 2 reset in 2 ms.
FORMULA BART-COL-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-03 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U p2)||G(F(p3))||p0)))'
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 08:56:03] [INFO ] Invariant cache hit.
[2023-03-11 08:56:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 08:56:03] [INFO ] Invariant cache hit.
[2023-03-11 08:56:03] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-11 08:56:03] [INFO ] Invariant cache hit.
[2023-03-11 08:56:03] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BART-COL-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s108 1) (GEQ s111 1) (GEQ s109 1) (GEQ s110 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p2:(AND (OR (GEQ s78 1) (GEQ s77 ...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 495 reset in 452 ms.
Product exploration explored 100000 steps with 523 reset in 384 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 p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 736 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Finished random walk after 22 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p0) (NOT p2) p3)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 1446 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 452 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2023-03-11 08:56:08] [INFO ] Invariant cache hit.
[2023-03-11 08:56:08] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2023-03-11 08:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:56:09] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2023-03-11 08:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:56:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 08:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:56:09] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-11 08:56:09] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-11 08:56:09] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 08:56:09] [INFO ] Invariant cache hit.
[2023-03-11 08:56:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 08:56:09] [INFO ] Invariant cache hit.
[2023-03-11 08:56:10] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-11 08:56:10] [INFO ] Invariant cache hit.
[2023-03-11 08:56:10] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 132/132 places, 202/202 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) (NOT p0) (NOT p2) (NOT p3)), true]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2) p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 549 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 489 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Finished random walk after 22 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), true]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2) p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p3), (F (AND (NOT p0) p1 (NOT p2) p3))]
Knowledge based reduction with 2 factoid took 966 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 552 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2023-03-11 08:56:13] [INFO ] Invariant cache hit.
[2023-03-11 08:56:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 08:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:56:14] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-11 08:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:56:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 08:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:56:14] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-11 08:56:14] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-11 08:56:14] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 479 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 482 reset in 350 ms.
Product exploration explored 100000 steps with 471 reset in 339 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 487 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 08:56:16] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 08:56:16] [INFO ] Invariant cache hit.
[2023-03-11 08:56:16] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 132/132 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin3790928051173427781
[2023-03-11 08:56:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3790928051173427781
Running compilation step : cd /tmp/ltsmin3790928051173427781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin3790928051173427781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3790928051173427781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7961995528075696021.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 08:56:32] [INFO ] Invariant cache hit.
[2023-03-11 08:56:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 08:56:32] [INFO ] Invariant cache hit.
[2023-03-11 08:56:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-11 08:56:32] [INFO ] Invariant cache hit.
[2023-03-11 08:56:32] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 132/132 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin11227846353168234883
[2023-03-11 08:56:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11227846353168234883
Running compilation step : cd /tmp/ltsmin11227846353168234883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin11227846353168234883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11227846353168234883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1384754506965870338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 08:56:47] [INFO ] Flatten gal took : 24 ms
[2023-03-11 08:56:47] [INFO ] Flatten gal took : 8 ms
[2023-03-11 08:56:47] [INFO ] Time to serialize gal into /tmp/LTL4826589806594124307.gal : 17 ms
[2023-03-11 08:56:47] [INFO ] Time to serialize properties into /tmp/LTL4208966423975115704.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4826589806594124307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13290916187007200476.hoa' '-atoms' '/tmp/LTL4208966423975115704.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4208966423975115704.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13290916187007200476.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-11 08:57:02] [INFO ] Flatten gal took : 12 ms
[2023-03-11 08:57:02] [INFO ] Flatten gal took : 19 ms
[2023-03-11 08:57:02] [INFO ] Time to serialize gal into /tmp/LTL7281031333658960167.gal : 3 ms
[2023-03-11 08:57:02] [INFO ] Time to serialize properties into /tmp/LTL5254078860681062475.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7281031333658960167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5254078860681062475.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainState_1...3982
Formula 0 simplified : X(!"((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainState_17...3971
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-11 08:57:18] [INFO ] Flatten gal took : 20 ms
[2023-03-11 08:57:18] [INFO ] Applying decomposition
[2023-03-11 08:57:18] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5403716526026538341.txt' '-o' '/tmp/graph5403716526026538341.bin' '-w' '/tmp/graph5403716526026538341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5403716526026538341.bin' '-l' '-1' '-v' '-w' '/tmp/graph5403716526026538341.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:57:18] [INFO ] Decomposing Gal with order
[2023-03-11 08:57:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:57:18] [INFO ] Removed a total of 44 redundant transitions.
[2023-03-11 08:57:18] [INFO ] Flatten gal took : 32 ms
[2023-03-11 08:57:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2023-03-11 08:57:18] [INFO ] Time to serialize gal into /tmp/LTL1901853531042860446.gal : 3 ms
[2023-03-11 08:57:18] [INFO ] Time to serialize properties into /tmp/LTL657106226570101666.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1901853531042860446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL657106226570101666.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(("((((i7.u29.TrainState_131>=1)||(i9.u45.TrainState_130>=1))||((i9.u45.TrainState_175>=1)||(i3.u18.TrainState_178>=1)))||(((i2.u3...5279
Formula 0 simplified : X(!"((((i7.u29.TrainState_131>=1)||(i9.u45.TrainState_130>=1))||((i9.u45.TrainState_175>=1)||(i3.u18.TrainState_178>=1)))||(((i2.u31...5268
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8906674988706767123
[2023-03-11 08:57:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8906674988706767123
Running compilation step : cd /tmp/ltsmin8906674988706767123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 349 ms.
Running link step : cd /tmp/ltsmin8906674988706767123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8906674988706767123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp1==true) U (LTLAPp2==true))||[](<>((LTLAPp3==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-010-LTLFireability-04 finished in 105275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p1)&&p0)))'
Support contains 122 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 08:57:48] [INFO ] Invariant cache hit.
[2023-03-11 08:57:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 08:57:48] [INFO ] Invariant cache hit.
[2023-03-11 08:57:48] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-11 08:57:48] [INFO ] Invariant cache hit.
[2023-03-11 08:57:49] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (GEQ s105 1) (GE...], 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 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-05 finished in 949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 13 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2023-03-11 08:57:49] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:57:49] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-11 08:57:49] [INFO ] Invariant cache hit.
[2023-03-11 08:57:49] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-11 08:57:49] [INFO ] Invariant cache hit.
[2023-03-11 08:57:49] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s68 1) (GEQ s16 1) (GEQ s60 1) (GEQ s8 1) (GEQ s64 1) (GEQ s52 1) (GEQ s56 1) (GEQ s43 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 401 ms.
Stack based approach found an accepted trace after 716 steps with 0 reset with depth 717 and stack size 717 in 3 ms.
FORMULA BART-COL-010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-06 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 4 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-11 08:57:50] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:57:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 08:57:50] [INFO ] Invariant cache hit.
[2023-03-11 08:57:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-11 08:57:50] [INFO ] Invariant cache hit.
[2023-03-11 08:57:50] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s113 1) (GEQ s14 1) (GEQ s111 ...], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 250 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-07 finished in 1155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p0)) U X(!p1)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 19 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2023-03-11 08:57:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 08:57:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 08:57:51] [INFO ] Invariant cache hit.
[2023-03-11 08:57:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-11 08:57:51] [INFO ] Invariant cache hit.
[2023-03-11 08:57:52] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 244 ms :[p1, true, p1, p1]
Running random walk in product with property : BART-COL-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s0 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-09 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(F((G(F(!p2))||(X(F(!p2))&&p3)))&&p1)))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 131 transition count 201
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 127 transition count 197
Applied a total of 10 rules in 14 ms. Remains 127 /132 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 127 cols
[2023-03-11 08:57:52] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:57:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 08:57:52] [INFO ] Invariant cache hit.
[2023-03-11 08:57:52] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-11 08:57:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 08:57:52] [INFO ] Invariant cache hit.
[2023-03-11 08:57:52] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/132 places, 197/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 127/132 places, 197/202 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p1)), (AND p0 p2)]
Running random walk in product with property : BART-COL-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s119 1) (GEQ s22 1) (GEQ s117 1) (GEQ s24 1) (GEQ s123 1) (GEQ s26 1) (GEQ s121 1) (GEQ s12 1) (GEQ s111 1) (GEQ s14 1) (GEQ s109 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 284 reset in 324 ms.
Stack based approach found an accepted trace after 311 steps with 2 reset with depth 115 and stack size 115 in 1 ms.
FORMULA BART-COL-010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-10 finished in 962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
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 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 9 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2023-03-11 08:57:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 08:57:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 08:57:53] [INFO ] Invariant cache hit.
[2023-03-11 08:57:53] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-11 08:57:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 08:57:53] [INFO ] Invariant cache hit.
[2023-03-11 08:57:53] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : BART-COL-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s19 1) (GEQ s89 1) (GEQ s21 1) (GEQ s87 1) (GEQ s23 1) (GEQ s93 1) (GEQ s25 1) (GEQ s91 1) (GEQ s11 1) (GEQ s81 1) (GEQ s13 1) (GEQ s79 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3 reset in 226 ms.
Stack based approach found an accepted trace after 310 steps with 1 reset with depth 78 and stack size 78 in 1 ms.
FORMULA BART-COL-010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-11 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||G(p1)))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 5 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-11 08:57:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 08:57:53] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-11 08:57:53] [INFO ] Invariant cache hit.
[2023-03-11 08:57:54] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 08:57:54] [INFO ] Invariant cache hit.
[2023-03-11 08:57:54] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p0:(GEQ s1 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 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 183 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) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-12 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X((G(F(p1)) U !p1)))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 4 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
[2023-03-11 08:57:54] [INFO ] Invariant cache hit.
[2023-03-11 08:57:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 08:57:54] [INFO ] Invariant cache hit.
[2023-03-11 08:57:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-11 08:57:55] [INFO ] Invariant cache hit.
[2023-03-11 08:57:55] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND p0 p1), (AND p0 p1), p1, (NOT p1), (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 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 32863 reset in 177 ms.
Product exploration explored 100000 steps with 32982 reset in 154 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 p0)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 267 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 372 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Support contains 9 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 15 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-11 08:57:57] [INFO ] Invariant cache hit.
[2023-03-11 08:57:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 08:57:57] [INFO ] Invariant cache hit.
[2023-03-11 08:57:57] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-11 08:57:57] [INFO ] Invariant cache hit.
[2023-03-11 08:57:57] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 90/90 places, 160/160 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 p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 292 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 315 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 32898 reset in 188 ms.
Product exploration explored 100000 steps with 32742 reset in 170 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 283 ms :[p1, p1, p1, (NOT p1), (NOT p1)]
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Graph (trivial) has 141 edges and 90 vertex of which 41 / 90 are part of one of the 1 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 50 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 50 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 50 transition count 76
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 50 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 49 transition count 75
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 49 transition count 75
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 43 place count 49 transition count 75
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 59 place count 49 transition count 59
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 76 place count 32 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 93 place count 32 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 32 transition count 41
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 94 rules in 18 ms. Remains 32 /90 variables (removed 58) and now considering 41/160 (removed 119) transitions.
[2023-03-11 08:58:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 32 cols
[2023-03-11 08:58:00] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:58:00] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/90 places, 41/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 32/90 places, 41/160 transitions.
Built C files in :
/tmp/ltsmin16417021443647152180
[2023-03-11 08:58:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16417021443647152180
Running compilation step : cd /tmp/ltsmin16417021443647152180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin16417021443647152180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16417021443647152180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5882872239640061923.hoa' '--buchi-type=spotba'
LTSmin run took 254 ms.
FORMULA BART-COL-010-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-010-LTLFireability-13 finished in 6295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G((p0||G(p1)))) U p2)))'
Support contains 99 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 08:58:01] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:58:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 08:58:01] [INFO ] Invariant cache hit.
[2023-03-11 08:58:01] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-11 08:58:01] [INFO ] Invariant cache hit.
[2023-03-11 08:58:01] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (GEQ s105 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 414 steps with 200 reset in 2 ms.
FORMULA BART-COL-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-14 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 4 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-11 08:58:02] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 08:58:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 08:58:02] [INFO ] Invariant cache hit.
[2023-03-11 08:58:02] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-11 08:58:02] [INFO ] Invariant cache hit.
[2023-03-11 08:58:02] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 201 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 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-15 finished in 1131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U p2)||G(F(p3))||p0)))'
[2023-03-11 08:58:03] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1328707998919075076
[2023-03-11 08:58:03] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2023-03-11 08:58:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:58:03] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2023-03-11 08:58:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:58:03] [INFO ] Applying decomposition
[2023-03-11 08:58:03] [INFO ] Flatten gal took : 16 ms
[2023-03-11 08:58:03] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2023-03-11 08:58:03] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:58:03] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1328707998919075076
Running compilation step : cd /tmp/ltsmin1328707998919075076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6404032824946863254.txt' '-o' '/tmp/graph6404032824946863254.bin' '-w' '/tmp/graph6404032824946863254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6404032824946863254.bin' '-l' '-1' '-v' '-w' '/tmp/graph6404032824946863254.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:58:03] [INFO ] Decomposing Gal with order
[2023-03-11 08:58:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:58:03] [INFO ] Removed a total of 55 redundant transitions.
[2023-03-11 08:58:03] [INFO ] Flatten gal took : 13 ms
[2023-03-11 08:58:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2023-03-11 08:58:03] [INFO ] Time to serialize gal into /tmp/LTLFireability18023019800334186739.gal : 2 ms
[2023-03-11 08:58:03] [INFO ] Time to serialize properties into /tmp/LTLFireability9927139901554001035.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18023019800334186739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9927139901554001035.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("((((i5.u10.TrainState_131>=1)||(i7.u45.TrainState_130>=1))||((i7.u45.TrainState_175>=1)||(i8.u48.TrainState_178>=1)))||(((i5.u1...5288
Formula 0 simplified : X(!"((((i5.u10.TrainState_131>=1)||(i7.u45.TrainState_130>=1))||((i7.u45.TrainState_175>=1)||(i8.u48.TrainState_178>=1)))||(((i5.u12...5277
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin1328707998919075076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1328707998919075076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp1==true) U (LTLAPp2==true))||[](<>((LTLAPp3==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.028: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: LTL layer: formula: X((((LTLAPp1==true) U (LTLAPp2==true))||[](<>((LTLAPp3==true)))||(LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.033: "X((((LTLAPp1==true) U (LTLAPp2==true))||[](<>((LTLAPp3==true)))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.033: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.067: buchi has 6 states
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.127: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.127: State length is 133, there are 216 groups
pins2lts-mc-linux64( 0/ 8), 0.127: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.127: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.127: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.127: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.351: [Blue] ~119 levels ~960 states ~9960 transitions
pins2lts-mc-linux64( 4/ 8), 0.430: [Blue] ~237 levels ~1920 states ~16368 transitions
pins2lts-mc-linux64( 0/ 8), 0.498: [Blue] ~155 levels ~3840 states ~15912 transitions
pins2lts-mc-linux64( 0/ 8), 0.549: [Blue] ~159 levels ~7680 states ~21608 transitions
pins2lts-mc-linux64( 0/ 8), 0.648: [Blue] ~175 levels ~15360 states ~32720 transitions
pins2lts-mc-linux64( 0/ 8), 0.940: [Blue] ~1126 levels ~30720 states ~92792 transitions
pins2lts-mc-linux64( 0/ 8), 1.363: [Blue] ~2073 levels ~61440 states ~187328 transitions
pins2lts-mc-linux64( 0/ 8), 1.948: [Blue] ~3078 levels ~122880 states ~319736 transitions
pins2lts-mc-linux64( 0/ 8), 2.710: [Blue] ~7131 levels ~245760 states ~692784 transitions
pins2lts-mc-linux64( 0/ 8), 3.714: [Blue] ~11114 levels ~491520 states ~1203256 transitions
pins2lts-mc-linux64( 0/ 8), 5.490: [Blue] ~22594 levels ~983040 states ~2469320 transitions
pins2lts-mc-linux64( 0/ 8), 9.075: [Blue] ~43081 levels ~1966080 states ~4875952 transitions
pins2lts-mc-linux64( 0/ 8), 16.001: [Blue] ~75968 levels ~3932160 states ~9217232 transitions
pins2lts-mc-linux64( 0/ 8), 30.311: [Blue] ~149269 levels ~7864320 states ~18620944 transitions
pins2lts-mc-linux64( 0/ 8), 59.230: [Blue] ~312396 levels ~15728640 states ~38837088 transitions
pins2lts-mc-linux64( 0/ 8), 118.463: [Blue] ~637587 levels ~31457280 states ~80149552 transitions
pins2lts-mc-linux64( 6/ 8), 203.239: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 203.522:
pins2lts-mc-linux64( 0/ 8), 203.522: Explored 32405565 states 252285682 transitions, fanout: 7.785
pins2lts-mc-linux64( 0/ 8), 203.522: Total exploration time 203.340 sec (203.100 sec minimum, 203.219 sec on average)
pins2lts-mc-linux64( 0/ 8), 203.522: States per second: 159366, Transitions per second: 1240709
pins2lts-mc-linux64( 0/ 8), 203.522:
pins2lts-mc-linux64( 0/ 8), 203.522: State space has 134217337 states, 10713407 are accepting
pins2lts-mc-linux64( 0/ 8), 203.522: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 203.522: blue states: 32405565 (24.14%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 203.522: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 203.522: all-red states: 10714410 (7.98%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 203.522:
pins2lts-mc-linux64( 0/ 8), 203.522: Total memory used for local state coloring: 327.5MB
pins2lts-mc-linux64( 0/ 8), 203.522:
pins2lts-mc-linux64( 0/ 8), 203.522: Queue width: 8B, total height: 21463970, memory: 163.76MB
pins2lts-mc-linux64( 0/ 8), 203.522: Tree memory: 1184.6MB, 9.3 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 203.522: Tree fill ratio (roots/leafs): 99.0%/62.0%
pins2lts-mc-linux64( 0/ 8), 203.522: Stored 203 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 203.522: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 203.522: Est. total memory use: 1348.4MB (~1187.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1328707998919075076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp1==true) U (LTLAPp2==true))||[](<>((LTLAPp3==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1328707998919075076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp1==true) U (LTLAPp2==true))||[](<>((LTLAPp3==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
80 unique states visited
0 strongly connected components in search stack
84 transitions explored
42 items max in DFS search stack
84965 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,849.678,2889476,1,0,3.17325e+06,555773,1596,1.89454e+07,347,2.68701e+06,1786150
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1113641 ms.

BK_STOP 1678526072053

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-COL-010"
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-5348"
echo " Executing tool itstools"
echo " Input is BART-COL-010, 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 r005-oct2-167813593500708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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