Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689500572.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-COL-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.8K Apr 29 21:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 21:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 20:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 20:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 207K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652666949549

Running Version 202205111006
[2022-05-16 02:09:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:09:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:09:10] [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.
[2022-05-16 02:09:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:09:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 698 ms
[2022-05-16 02:09:11] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 02:09:11] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 20213 PT places and 5.628918048E10 transition bindings in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:09:11] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 11 ms.
[2022-05-16 02:09:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
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 40
Arc [3:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2022-05-16 02:09:12] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 463 ms.
[2022-05-16 02:09:12] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:09:12] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-040-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-040-LTLFireability-06 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
[2022-05-16 02:09:12] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-16 02:09:12] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:12] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-16 02:09:12] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:12] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 02:09:12] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2022-05-16 02:09:13] [INFO ] Flatten gal took : 44 ms
[2022-05-16 02:09:13] [INFO ] Flatten gal took : 32 ms
[2022-05-16 02:09:13] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 370 steps, including 0 resets, run visited all 6 properties in 41 ms. (steps per millisecond=9 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 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 31 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:09:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:09:13] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:09:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:13] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(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 56 steps with 0 reset in 2 ms.
FORMULA BART-COL-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-00 finished in 447 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X(p0)))'
Support contains 1 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 21 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:09:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:14] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:09:14] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:09:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:09:14] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BART-COL-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-01 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&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 8 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:09:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:14] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:09:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:09:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:14] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p1:(LT s0 1), p0:(OR (GEQ s42 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1267 reset in 440 ms.
Product exploration explored 100000 steps with 1266 reset in 354 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 p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:09:16] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (NOT p1)
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:09:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:09:16] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-16 02:09:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:09:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:09:16] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 02:09:16] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 02:09:16] [INFO ] Added : 92 causal constraints over 19 iterations in 237 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 1266 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-COL-040-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-040-LTLFireability-02 finished in 4005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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 1 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 32 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:09:18] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:18] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:09:18] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:18] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-05-16 02:09:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:09:18] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:18] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s44 1) (GEQ s42 1) (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s79 1) (GEQ s11 1) (GEQ s77 1) (GEQ s13 1) (GEQ s83 1) (GEQ s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Product exploration explored 100000 steps with 50000 reset in 290 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 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-040-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-040-LTLFireability-03 finished in 1056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(G((X(p0) U p1)))||(!G(p2) U p2))))))'
Support contains 78 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
[2022-05-16 02:09:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:19] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:19] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:19] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:09:19] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BART-COL-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], 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 3 reset in 176 ms.
Product exploration explored 100000 steps with 7 reset in 338 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 p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Finished random walk after 205 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 339 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:21] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:09:22] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-16 02:09:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:09:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:09:22] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-16 02:09:22] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-16 02:09:22] [INFO ] Added : 82 causal constraints over 17 iterations in 322 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 78 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
[2022-05-16 02:09:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:22] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:22] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:09:23] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 650 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:24] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:24] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:09:24] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-16 02:09:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:09:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:09:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:09:25] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-16 02:09:25] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-16 02:09:25] [INFO ] Added : 82 causal constraints over 17 iterations in 224 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 6 reset in 269 ms.
Product exploration explored 100000 steps with 1 reset in 291 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 202
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 23 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-05-16 02:09:26] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:26] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 202/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Product exploration explored 100000 steps with 6 reset in 222 ms.
Product exploration explored 100000 steps with 4 reset in 293 ms.
Built C files in :
/tmp/ltsmin2668810348820925292
[2022-05-16 02:09:27] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2668810348820925292
Running compilation step : cd /tmp/ltsmin2668810348820925292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 456 ms.
Running link step : cd /tmp/ltsmin2668810348820925292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2668810348820925292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15220277249391611968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 78 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.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:42] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:42] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:42] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:42] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin11505129977623593481
[2022-05-16 02:09:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11505129977623593481
Running compilation step : cd /tmp/ltsmin11505129977623593481;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin11505129977623593481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11505129977623593481;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1761810776535721372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:09:57] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:09:57] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:09:57] [INFO ] Time to serialize gal into /tmp/LTL4945065569041314064.gal : 4 ms
[2022-05-16 02:09:57] [INFO ] Time to serialize properties into /tmp/LTL13549367331819380854.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4945065569041314064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13549367331819380854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4945065...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("(TrainState_0>=1)"))U("(((((TrainState_87>=1)||(TrainState_178>=1))||((TrainState_177>=1)||(TrainState_176>=1)))||((...3326
Formula 0 simplified : !XGX(XG(X"(TrainState_0>=1)" U "(((((TrainState_87>=1)||(TrainState_178>=1))||((TrainState_177>=1)||(TrainState_176>=1)))||(((TrainS...3307
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:10:12] [INFO ] Flatten gal took : 20 ms
[2022-05-16 02:10:12] [INFO ] Applying decomposition
[2022-05-16 02:10:12] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4511192425088295125.txt' '-o' '/tmp/graph4511192425088295125.bin' '-w' '/tmp/graph4511192425088295125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4511192425088295125.bin' '-l' '-1' '-v' '-w' '/tmp/graph4511192425088295125.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:10:13] [INFO ] Decomposing Gal with order
[2022-05-16 02:10:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:10:13] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-16 02:10:13] [INFO ] Flatten gal took : 47 ms
[2022-05-16 02:10:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 8 ms.
[2022-05-16 02:10:13] [INFO ] Time to serialize gal into /tmp/LTL15957144714024486908.gal : 4 ms
[2022-05-16 02:10:13] [INFO ] Time to serialize properties into /tmp/LTL3032889205899370981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15957144714024486908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3032889205899370981.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1595714...246
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("(u2.TrainState_0>=1)"))U("(((((i0.u1.TrainState_87>=1)||(i4.i2.u45.TrainState_178>=1))||((i7.u16.TrainState_177>=1)|...4419
Formula 0 simplified : !XGX(XG(X"(u2.TrainState_0>=1)" U "(((((i0.u1.TrainState_87>=1)||(i4.i2.u45.TrainState_178>=1))||((i7.u16.TrainState_177>=1)||(i6.u4...4400
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14656321254768432712
[2022-05-16 02:10:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14656321254768432712
Running compilation step : cd /tmp/ltsmin14656321254768432712;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 256 ms.
Running link step : cd /tmp/ltsmin14656321254768432712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14656321254768432712;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-040-LTLFireability-07 finished in 84071 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(G(X(p0)))))))'
Support contains 1 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 128 place count 68 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 57 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 57 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 57 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 53 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 53 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 50 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 50 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 47 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 47 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 45 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 45 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 43 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 43 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 42 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 42 transition count 111
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 195 place count 35 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 199 place count 35 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 33 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 207 place count 33 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 31 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 31 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 219 place count 29 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 223 place count 29 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 227 place count 27 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 231 place count 27 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 235 place count 25 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 239 place count 25 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 243 place count 23 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 247 place count 23 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 251 place count 21 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 255 place count 21 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 259 place count 19 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 263 place count 19 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 267 place count 17 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 271 place count 17 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 275 place count 15 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 279 place count 15 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 283 place count 13 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 287 place count 13 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 291 place count 11 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 295 place count 11 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 299 place count 9 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 303 place count 9 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 307 place count 7 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 311 place count 7 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 315 place count 5 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 319 place count 5 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 323 place count 3 transition count 8
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 328 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 43 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:10:43] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:10:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-16 02:10:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:10:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Stack based approach found an accepted trace after 490 steps with 0 reset with depth 491 and stack size 41 in 1 ms.
FORMULA BART-COL-040-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-08 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U p1)))&&F(G(X(p2)))))'
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 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:43] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:43] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BART-COL-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Stack based approach found an accepted trace after 35257 steps with 0 reset with depth 35258 and stack size 35258 in 119 ms.
FORMULA BART-COL-040-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-09 finished in 843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 9 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 3 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:10:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:44] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:10:44] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:44] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:10:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:44] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s42 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 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 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-10 finished in 282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(X(p0)) U p1)))))'
Support contains 89 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 121 transition count 186
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 116 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 38 place count 110 transition count 180
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 110 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 110 transition count 179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 48 place count 107 transition count 176
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 107 transition count 176
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 104 transition count 173
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 104 transition count 173
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 101 transition count 170
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 101 transition count 170
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 99 transition count 168
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 99 transition count 168
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 97 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 97 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 96 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 96 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 85 place count 90 transition count 159
Applied a total of 85 rules in 24 ms. Remains 90 /132 variables (removed 42) and now considering 159/202 (removed 43) transitions.
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:10:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:10:44] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:10:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 02:10:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:10:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:44] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/132 places, 159/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 159/202 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s80 1) (GEQ s39 1) (GEQ s84 1) (GEQ s43 1) (GEQ s88 1) (GEQ s47 1) (GEQ s51 1) (GEQ s55 1) (GEQ s59 1) (GEQ s4 1) (GEQ s63 1) (...], 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 965 reset in 286 ms.
Product exploration explored 100000 steps with 971 reset in 268 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 p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 246 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 89 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 159/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:10:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:46] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:10:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:46] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-16 02:10:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:10:46] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:46] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 159/159 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 p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 164 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 977 reset in 256 ms.
Product exploration explored 100000 steps with 960 reset in 280 ms.
Built C files in :
/tmp/ltsmin9613673399166509290
[2022-05-16 02:10:47] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2022-05-16 02:10:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:10:47] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2022-05-16 02:10:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:10:47] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2022-05-16 02:10:47] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:10:47] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9613673399166509290
Running compilation step : cd /tmp/ltsmin9613673399166509290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 665 ms.
Running link step : cd /tmp/ltsmin9613673399166509290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9613673399166509290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased237511160743995773.hoa' '--buchi-type=spotba'
LTSmin run took 425 ms.
FORMULA BART-COL-040-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-11 finished in 4348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 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 178 edges and 132 vertex of which 41 / 132 are part of one of the 1 SCC in 4 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 92 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 36 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 32 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 157 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 162 place count 19 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 19 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 19 transition count 28
Applied a total of 173 rules in 17 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:49] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-16 02:10:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:10:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/132 places, 28/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s2 1) (GEQ s17 1) (GEQ s16 1) (GEQ s15 1) (GEQ s14 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-12 finished in 151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 88 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 5 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 02:10:49] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:10:49] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s86 1) (GEQ s44 1) (GEQ s90 1) (GEQ s48 1) (GEQ s94 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s8 1) (GEQ s68 1) (GEQ s12 1) (GEQ...], 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 272 steps with 0 reset in 1 ms.
FORMULA BART-COL-040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-13 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(X(p0)))||G(p1)))))'
Support contains 69 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 1 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:49] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:10:49] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:49] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 546 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (GEQ s115 1) (GEQ...], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19994 reset in 230 ms.
Product exploration explored 100000 steps with 19992 reset in 202 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) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 0 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:10:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:51] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:10:51] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:10:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:51] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 199/199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19995 reset in 229 ms.
Product exploration explored 100000 steps with 19993 reset in 202 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 129 transition count 199
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 129 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 122 transition count 192
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 122 transition count 192
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 45 rules in 8 ms. Remains 122 /129 variables (removed 7) and now considering 192/199 (removed 7) transitions.
[2022-05-16 02:10:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 192 rows 122 cols
[2022-05-16 02:10:53] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:53] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/129 places, 192/199 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/129 places, 192/199 transitions.
Product exploration explored 100000 steps with 19993 reset in 500 ms.
Product exploration explored 100000 steps with 19993 reset in 454 ms.
Built C files in :
/tmp/ltsmin14346360856877333814
[2022-05-16 02:10:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14346360856877333814
Running compilation step : cd /tmp/ltsmin14346360856877333814;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin14346360856877333814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14346360856877333814;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3175031051429357202.hoa' '--buchi-type=spotba'
LTSmin run took 1954 ms.
FORMULA BART-COL-040-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-14 finished in 7374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(((X(p0) U p0)&&(G(p1)||!p0))))))'
Support contains 77 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
[2022-05-16 02:10:56] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:56] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:56] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:56] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:56] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 02:10:57] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 277 ms.
Stack based approach found an accepted trace after 74161 steps with 6 reset with depth 5109 and stack size 5109 in 236 ms.
FORMULA BART-COL-040-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-15 finished in 1004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(G((X(p0) U p1)))||(!G(p2) U p2))))))'
Found a SL insensitive property : BART-COL-040-LTLFireability-07
Stuttering acceptance computed with spot in 528 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 6 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:10:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:58] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:10:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:58] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:10:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:58] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/132 places, 179/202 transitions.
Running random walk in product with property : BART-COL-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s91 1) (GEQ s12 1) (GEQ s89 1) (GEQ s14 1) (GEQ s95 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 194 ms.
Product exploration explored 100000 steps with 7 reset in 234 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 p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Finished random walk after 205 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:11:00] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-16 02:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:11:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:11:00] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-16 02:11:00] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 02:11:00] [INFO ] Added : 59 causal constraints over 12 iterations in 110 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 0 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:11:00] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:00] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:11:00] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:00] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 179/179 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 p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:01] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:11:02] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-16 02:11:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:11:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:11:02] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-16 02:11:02] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-16 02:11:02] [INFO ] Added : 59 causal constraints over 12 iterations in 195 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 4 reset in 184 ms.
Product exploration explored 100000 steps with 5 reset in 233 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2022-05-16 02:11:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:03] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 179/179 transitions.
Product exploration explored 100000 steps with 4 reset in 187 ms.
Product exploration explored 100000 steps with 7 reset in 212 ms.
Built C files in :
/tmp/ltsmin6813601826134161531
[2022-05-16 02:11:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6813601826134161531
Running compilation step : cd /tmp/ltsmin6813601826134161531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 334 ms.
Running link step : cd /tmp/ltsmin6813601826134161531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6813601826134161531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4828021230935083492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:19] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:11:19] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:11:19] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 179/179 transitions.
Built C files in :
/tmp/ltsmin17925377917121602982
[2022-05-16 02:11:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17925377917121602982
Running compilation step : cd /tmp/ltsmin17925377917121602982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin17925377917121602982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17925377917121602982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2459127466385205991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:11:34] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:11:34] [INFO ] Flatten gal took : 12 ms
[2022-05-16 02:11:34] [INFO ] Time to serialize gal into /tmp/LTL3793962062189652316.gal : 2 ms
[2022-05-16 02:11:34] [INFO ] Time to serialize properties into /tmp/LTL11017052379422123817.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3793962062189652316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11017052379422123817.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3793962...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("(TrainState_0>=1)"))U("(((((TrainState_87>=1)||(TrainState_178>=1))||((TrainState_177>=1)||(TrainState_176>=1)))||((...3326
Formula 0 simplified : !XGX(XG(X"(TrainState_0>=1)" U "(((((TrainState_87>=1)||(TrainState_178>=1))||((TrainState_177>=1)||(TrainState_176>=1)))||(((TrainS...3307
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:11:49] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:11:49] [INFO ] Applying decomposition
[2022-05-16 02:11:49] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10970573047257874071.txt' '-o' '/tmp/graph10970573047257874071.bin' '-w' '/tmp/graph10970573047257874071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10970573047257874071.bin' '-l' '-1' '-v' '-w' '/tmp/graph10970573047257874071.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:11:49] [INFO ] Decomposing Gal with order
[2022-05-16 02:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:11:49] [INFO ] Removed a total of 52 redundant transitions.
[2022-05-16 02:11:49] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2022-05-16 02:11:49] [INFO ] Time to serialize gal into /tmp/LTL4866592722423126549.gal : 2 ms
[2022-05-16 02:11:49] [INFO ] Time to serialize properties into /tmp/LTL14876665950490808203.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4866592722423126549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14876665950490808203.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4866592...246
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("(i0.u3.TrainState_0>=1)"))U("(((((i0.u1.TrainState_87>=1)||(i3.i1.u32.TrainState_178>=1))||((i4.i3.u31.TrainState_17...4627
Formula 0 simplified : !XGX(XG(X"(i0.u3.TrainState_0>=1)" U "(((((i0.u1.TrainState_87>=1)||(i3.i1.u32.TrainState_178>=1))||((i4.i3.u31.TrainState_177>=1)||...4608
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12185594906407035936
[2022-05-16 02:12:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12185594906407035936
Running compilation step : cd /tmp/ltsmin12185594906407035936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin12185594906407035936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12185594906407035936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-040-LTLFireability-07 finished in 82000 ms.
[2022-05-16 02:12:19] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2022-05-16 02:12:19] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin14124686859357943997
[2022-05-16 02:12:19] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2022-05-16 02:12:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:19] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2022-05-16 02:12:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:19] [INFO ] Flatten gal took : 14 ms
[2022-05-16 02:12:19] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2022-05-16 02:12:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:19] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14124686859357943997
Running compilation step : cd /tmp/ltsmin14124686859357943997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16758903307940669297.txt' '-o' '/tmp/graph16758903307940669297.bin' '-w' '/tmp/graph16758903307940669297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16758903307940669297.bin' '-l' '-1' '-v' '-w' '/tmp/graph16758903307940669297.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:12:19] [INFO ] Decomposing Gal with order
[2022-05-16 02:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:12:19] [INFO ] Removed a total of 51 redundant transitions.
[2022-05-16 02:12:19] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 1 ms.
[2022-05-16 02:12:19] [INFO ] Time to serialize gal into /tmp/LTLFireability17690799763582191290.gal : 2 ms
[2022-05-16 02:12:19] [INFO ] Time to serialize properties into /tmp/LTLFireability8285574744320113198.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17690799763582191290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8285574744320113198.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("(i0.u2.TrainState_0>=1)"))U("(((((i0.u11.TrainState_87>=1)||(i4.u37.TrainState_178>=1))||((i5.i1.i1.u36.TrainState_1...4373
Formula 0 simplified : !XGX(XG(X"(i0.u2.TrainState_0>=1)" U "(((((i0.u11.TrainState_87>=1)||(i4.u37.TrainState_178>=1))||((i5.i1.i1.u36.TrainState_177>=1)|...4354
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin14124686859357943997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14124686859357943997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.194: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.194: LTL layer: formula: X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.194: "X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.194: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.201: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.199: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.199: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.209: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.277: DFS-FIFO for weak LTL, using special progress label 206
pins2lts-mc-linux64( 0/ 8), 0.277: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.277: State length is 133, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.277: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.277: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.277: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.277: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.453: ~2 levels ~960 states ~15544 transitions
pins2lts-mc-linux64( 6/ 8), 0.545: ~1 levels ~1920 states ~78280 transitions
pins2lts-mc-linux64( 6/ 8), 0.644: ~2 levels ~3840 states ~132744 transitions
pins2lts-mc-linux64( 6/ 8), 0.909: ~2 levels ~7680 states ~240712 transitions
pins2lts-mc-linux64( 6/ 8), 1.292: ~2 levels ~15360 states ~485760 transitions
pins2lts-mc-linux64( 6/ 8), 1.901: ~2 levels ~30720 states ~1061264 transitions
pins2lts-mc-linux64( 6/ 8), 3.020: ~2 levels ~61440 states ~2267088 transitions
pins2lts-mc-linux64( 4/ 8), 4.386: ~3 levels ~122880 states ~4165088 transitions
pins2lts-mc-linux64( 6/ 8), 7.417: ~3 levels ~245760 states ~9672152 transitions
pins2lts-mc-linux64( 6/ 8), 11.612: ~3 levels ~491520 states ~17341128 transitions
pins2lts-mc-linux64( 6/ 8), 23.170: ~3 levels ~983040 states ~37319912 transitions
pins2lts-mc-linux64( 6/ 8), 47.988: ~3 levels ~1966080 states ~79708800 transitions
pins2lts-mc-linux64( 4/ 8), 97.992: ~4 levels ~3932160 states ~156599992 transitions
pins2lts-mc-linux64( 5/ 8), 123.004: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 123.297:
pins2lts-mc-linux64( 0/ 8), 123.297: mean standard work distribution: 3.9% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 123.297:
pins2lts-mc-linux64( 0/ 8), 123.297: Explored 4325178 states 187320775 transitions, fanout: 43.309
pins2lts-mc-linux64( 0/ 8), 123.297: Total exploration time 122.990 sec (122.720 sec minimum, 122.866 sec on average)
pins2lts-mc-linux64( 0/ 8), 123.297: States per second: 35167, Transitions per second: 1523057
pins2lts-mc-linux64( 0/ 8), 123.297:
pins2lts-mc-linux64( 0/ 8), 123.297: Progress states detected: 44061744
pins2lts-mc-linux64( 0/ 8), 123.297: Redundant explorations: -90.2030
pins2lts-mc-linux64( 0/ 8), 123.297:
pins2lts-mc-linux64( 0/ 8), 123.297: Queue width: 8B, total height: 52214321, memory: 398.36MB
pins2lts-mc-linux64( 0/ 8), 123.297: Tree memory: 592.8MB, 14.1 B/state, compr.: 2.6%
pins2lts-mc-linux64( 0/ 8), 123.297: Tree fill ratio (roots/leafs): 32.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 123.297: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 123.297: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 123.297: Est. total memory use: 991.2MB (~1422.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14124686859357943997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14124686859357943997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X([]((X((LTLAPp0==true)) U (LTLAPp1==true))))||() U (LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 02:33:23] [INFO ] Applying decomposition
[2022-05-16 02:33:23] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:33:23] [INFO ] Decomposing Gal with order
[2022-05-16 02:33:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:33:23] [INFO ] Removed a total of 140 redundant transitions.
[2022-05-16 02:33:23] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:33:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 02:33:23] [INFO ] Time to serialize gal into /tmp/LTLFireability18100320932195086337.gal : 2 ms
[2022-05-16 02:33:23] [INFO ] Time to serialize properties into /tmp/LTLFireability13941926570427109550.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18100320932195086337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13941926570427109550.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("(trainidspeeddistance0.TrainState_0>=1)"))U("(((((trainidspeeddistance87.TrainState_87>=1)||(trainidspeeddistance178...6740
Formula 0 simplified : !XGX(XG(X"(trainidspeeddistance0.TrainState_0>=1)" U "(((((trainidspeeddistance87.TrainState_87>=1)||(trainidspeeddistance178.TrainS...6721
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
45 unique states visited
0 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
31872 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,318.775,2467244,1,0,4.54683e+06,47571,1517,2.46846e+06,54,107923,3384944
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-040-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1778136 ms.

BK_STOP 1652668729007

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-COL-040, 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 r006-tajo-165245689500572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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