Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.2K Feb 26 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 219K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678525980343

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-060
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-11 09:13:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 09:13:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:13:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 09:13:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 09:13:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 857 ms
[2023-03-11 09:13:05] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-11 09:13:05] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 25133 PT places and 8.443377072E10 transition bindings in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 09:13:05] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 8 ms.
[2023-03-11 09:13:05] [INFO ] Skeletonized 2 HLPN properties in 1 ms. Removed 14 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
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 60
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [3:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2023-03-11 09:13:06] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 240 ms.
[2023-03-11 09:13:06] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
[2023-03-11 09:13:06] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 09:13:06] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 09:13:06] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 09:13:06] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 09:13:06] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 09:13:06] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-060-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 09:13:06] [INFO ] Computed 1 place invariants in 28 ms
[2023-03-11 09:13:06] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-11 09:13:06] [INFO ] Invariant cache hit.
[2023-03-11 09:13:07] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-11 09:13:07] [INFO ] Invariant cache hit.
[2023-03-11 09:13:07] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1095 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-11 09:13:07] [INFO ] Flatten gal took : 94 ms
[2023-03-11 09:13:07] [INFO ] Flatten gal took : 20 ms
[2023-03-11 09:13:07] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 245 steps, including 0 resets, run visited all 13 properties in 22 ms. (steps per millisecond=11 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1&&F(p2))||p0))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 09:13:08] [INFO ] Invariant cache hit.
[2023-03-11 09:13:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 09:13:08] [INFO ] Invariant cache hit.
[2023-03-11 09:13:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-11 09:13:08] [INFO ] Invariant cache hit.
[2023-03-11 09:13:08] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 434 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-COL-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (LT s98 1) (LT s49 1) (LT s102 1) (LT s53 1) (LT s106 1) (LT s57 1) (LT s61 1) (LT s65 1) (LT s69 1) (LT s8 1) (LT s73 1) (LT s12 1) (LT s16 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-060-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-02 finished in 2246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1&&(p2 U G(!p2))))||p0))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 09:13:10] [INFO ] Invariant cache hit.
[2023-03-11 09:13:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 09:13:10] [INFO ] Invariant cache hit.
[2023-03-11 09:13:10] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-11 09:13:10] [INFO ] Invariant cache hit.
[2023-03-11 09:13:11] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : BART-COL-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p2:(AND (LT s98 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1612 reset in 667 ms.
Product exploration explored 100000 steps with 1608 reset in 533 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) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Knowledge based reduction with 5 factoid took 954 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 244 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1210 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
[2023-03-11 09:13:15] [INFO ] Invariant cache hit.
[2023-03-11 09:13:16] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 09:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:16] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-11 09:13:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:13:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 09:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:16] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-11 09:13:16] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-11 09:13:17] [INFO ] Added : 97 causal constraints over 20 iterations in 359 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Support contains 98 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 13 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 09:13:17] [INFO ] Invariant cache hit.
[2023-03-11 09:13:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 09:13:17] [INFO ] Invariant cache hit.
[2023-03-11 09:13:17] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-11 09:13:17] [INFO ] Invariant cache hit.
[2023-03-11 09:13:17] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 5 factoid took 1109 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 183 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1376 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
[2023-03-11 09:13:21] [INFO ] Invariant cache hit.
[2023-03-11 09:13:21] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-11 09:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:22] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-11 09:13:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 09:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:22] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-11 09:13:22] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-11 09:13:23] [INFO ] Added : 97 causal constraints over 20 iterations in 607 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 1624 reset in 429 ms.
Product exploration explored 100000 steps with 1624 reset in 459 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 132 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 132 transition count 202
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 132 transition count 202
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 24 place count 132 transition count 202
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 38 place count 118 transition count 188
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 118 transition count 188
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 52 rules in 26 ms. Remains 118 /132 variables (removed 14) and now considering 188/202 (removed 14) transitions.
[2023-03-11 09:13:25] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 188 rows 118 cols
[2023-03-11 09:13:25] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-11 09:13:25] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/132 places, 188/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 118/132 places, 188/202 transitions.
Built C files in :
/tmp/ltsmin2497784730590691376
[2023-03-11 09:13:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2497784730590691376
Running compilation step : cd /tmp/ltsmin2497784730590691376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 394 ms.
Running link step : cd /tmp/ltsmin2497784730590691376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin2497784730590691376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15347071596740022773.hoa' '--buchi-type=spotba'
LTSmin run took 1276 ms.
FORMULA BART-COL-060-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-060-LTLFireability-03 finished in 16680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 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 0 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 29 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 09:13:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 09:13:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 09:13:27] [INFO ] Invariant cache hit.
[2023-03-11 09:13:27] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-11 09:13:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:13:27] [INFO ] Invariant cache hit.
[2023-03-11 09:13:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0]
Running random walk in product with property : BART-COL-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32 reset in 58 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BART-COL-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-04 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 126 transition count 196
Applied a total of 12 rules in 5 ms. Remains 126 /132 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 126 cols
[2023-03-11 09:13:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 09:13:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 09:13:27] [INFO ] Invariant cache hit.
[2023-03-11 09:13:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-11 09:13:27] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 09:13:27] [INFO ] Invariant cache hit.
[2023-03-11 09:13:27] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 196/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 126/132 places, 196/202 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], 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 s108 1) (GEQ s11 1) (GEQ s106 1) (GEQ s13 1) (GEQ s112 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Product exploration explored 100000 steps with 0 reset in 292 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))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 283 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
[2023-03-11 09:13:29] [INFO ] Invariant cache hit.
[2023-03-11 09:13:29] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 09:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:29] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-11 09:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:13:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 09:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:30] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-11 09:13:30] [INFO ] Computed and/alt/rep : 160/264/160 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-11 09:13:31] [INFO ] Added : 160 causal constraints over 33 iterations in 620 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-11 09:13:31] [INFO ] Invariant cache hit.
[2023-03-11 09:13:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 09:13:31] [INFO ] Invariant cache hit.
[2023-03-11 09:13:31] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-11 09:13:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:13:31] [INFO ] Invariant cache hit.
[2023-03-11 09:13:32] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 999 ms. Remains : 126/126 places, 196/196 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
[2023-03-11 09:13:33] [INFO ] Invariant cache hit.
[2023-03-11 09:13:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 09:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:33] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-11 09:13:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:13:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 09:13:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:13:33] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-11 09:13:33] [INFO ] Computed and/alt/rep : 160/264/160 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-11 09:13:34] [INFO ] Added : 160 causal constraints over 33 iterations in 818 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 208 ms.
Built C files in :
/tmp/ltsmin14776763376850437482
[2023-03-11 09:13:35] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2023-03-11 09:13:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:13:35] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2023-03-11 09:13:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:13:35] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2023-03-11 09:13:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:13:35] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14776763376850437482
Running compilation step : cd /tmp/ltsmin14776763376850437482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 382 ms.
Running link step : cd /tmp/ltsmin14776763376850437482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin14776763376850437482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15270630066519414209.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-11 09:13:50] [INFO ] Invariant cache hit.
[2023-03-11 09:13:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 09:13:50] [INFO ] Invariant cache hit.
[2023-03-11 09:13:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-11 09:13:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 09:13:50] [INFO ] Invariant cache hit.
[2023-03-11 09:13:50] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 126/126 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin61355095700697113
[2023-03-11 09:13:50] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2023-03-11 09:13:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:13:50] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2023-03-11 09:13:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:13:50] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2023-03-11 09:13:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:13:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin61355095700697113
Running compilation step : cd /tmp/ltsmin61355095700697113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin61355095700697113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin61355095700697113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14120972022231319505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 09:14:05] [INFO ] Flatten gal took : 10 ms
[2023-03-11 09:14:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:14:06] [INFO ] Time to serialize gal into /tmp/LTL1624032268673299128.gal : 3 ms
[2023-03-11 09:14:06] [INFO ] Time to serialize properties into /tmp/LTL4480812960088892141.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1624032268673299128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4458001856611507867.hoa' '-atoms' '/tmp/LTL4480812960088892141.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4480812960088892141.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4458001856611507867.hoa
Detected timeout of ITS tools.
[2023-03-11 09:14:21] [INFO ] Flatten gal took : 32 ms
[2023-03-11 09:14:21] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:14:21] [INFO ] Time to serialize gal into /tmp/LTL1367158519630348605.gal : 2 ms
[2023-03-11 09:14:21] [INFO ] Time to serialize properties into /tmp/LTL8122581718909513048.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1367158519630348605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8122581718909513048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_4...2762
Formula 0 simplified : FG!"((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_49>...2756
Detected timeout of ITS tools.
[2023-03-11 09:14:36] [INFO ] Flatten gal took : 6 ms
[2023-03-11 09:14:36] [INFO ] Applying decomposition
[2023-03-11 09:14:36] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6882543656762160823.txt' '-o' '/tmp/graph6882543656762160823.bin' '-w' '/tmp/graph6882543656762160823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6882543656762160823.bin' '-l' '-1' '-v' '-w' '/tmp/graph6882543656762160823.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:14:36] [INFO ] Decomposing Gal with order
[2023-03-11 09:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:14:36] [INFO ] Removed a total of 58 redundant transitions.
[2023-03-11 09:14:36] [INFO ] Flatten gal took : 51 ms
[2023-03-11 09:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 6 ms.
[2023-03-11 09:14:36] [INFO ] Time to serialize gal into /tmp/LTL12469362386953395886.gal : 21 ms
[2023-03-11 09:14:36] [INFO ] Time to serialize properties into /tmp/LTL3608401721059469020.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12469362386953395886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3608401721059469020.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i0.u9.TrainState_90>=1)||(i0.u9.TrainState_88>=1))||((i1.u0.TrainState_43>=1)||(i1.u0.TrainState_45>=1)))||(((i1.u1.Tr...3678
Formula 0 simplified : FG!"((((((((i0.u9.TrainState_90>=1)||(i0.u9.TrainState_88>=1))||((i1.u0.TrainState_43>=1)||(i1.u0.TrainState_45>=1)))||(((i1.u1.Trai...3672
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1860533473221139767
[2023-03-11 09:14:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1860533473221139767
Running compilation step : cd /tmp/ltsmin1860533473221139767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin1860533473221139767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1860533473221139767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-060-LTLFireability-05 finished in 99192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 9 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-11 09:15:06] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-11 09:15:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:07] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 216 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 148 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-060-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-06 finished in 1171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (!p1 U G(!p2))) U (F(!p2)&&X(p3)))))'
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
[2023-03-11 09:15:07] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 09:15:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 09:15:07] [INFO ] Invariant cache hit.
[2023-03-11 09:15:08] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-11 09:15:08] [INFO ] Invariant cache hit.
[2023-03-11 09:15:08] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 945 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 983 ms :[(OR (NOT p3) p2), p2, (NOT p3), (AND p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, p2, p2]
Running random walk in product with property : BART-COL-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 7}, { cond=(NOT p2), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p1), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 10}, { cond=(AND p2 p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p2:(LT s1 1), p1:(AND (LT s98 1) (LT s49 1) (LT s102 1) (LT s53 1) (LT s106 1) (LT s57 1) (LT s61 1) (LT s65 1) (LT s69 1) (LT s8 1) (LT s73 1) (LT s12 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 94338 steps with 979 reset in 400 ms.
FORMULA BART-COL-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-08 finished in 2382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (!p1||F((p1&&G(!p2))))))'
Support contains 79 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-11 09:15:10] [INFO ] Invariant cache hit.
[2023-03-11 09:15:10] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 09:15:10] [INFO ] Invariant cache hit.
[2023-03-11 09:15:10] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-11 09:15:10] [INFO ] Invariant cache hit.
[2023-03-11 09:15:10] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND p1 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (NOT p1) p2), p2]
Running random walk in product with property : BART-COL-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s1 1), p2:(AND (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...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 391 reset in 176 ms.
Stack based approach found an accepted trace after 49123 steps with 126 reset with depth 48763 and stack size 48763 in 92 ms.
FORMULA BART-COL-060-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-09 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(!p1)&&p0))&&X(G(!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.
[2023-03-11 09:15:11] [INFO ] Invariant cache hit.
[2023-03-11 09:15:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 09:15:11] [INFO ] Invariant cache hit.
[2023-03-11 09:15:11] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-11 09:15:11] [INFO ] Invariant cache hit.
[2023-03-11 09:15:11] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 299 ms :[p2, (OR p2 p1), true, (OR (NOT p0) p2 p1), (OR (NOT p0) p2 p1)]
Running random walk in product with property : BART-COL-060-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=p2, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GEQ s0 1), p1:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p0:(AND (LT s45 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-11 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!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 16 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2023-03-11 09:15:12] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 09:15:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 09:15:12] [INFO ] Invariant cache hit.
[2023-03-11 09:15:12] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-11 09:15:12] [INFO ] Invariant cache hit.
[2023-03-11 09:15:12] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0]
Running random walk in product with property : BART-COL-060-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT 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 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-12 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U p1)) U 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 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 09:15:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 09:15:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 09:15:12] [INFO ] Invariant cache hit.
[2023-03-11 09:15:12] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-11 09:15:12] [INFO ] Invariant cache hit.
[2023-03-11 09:15:13] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BART-COL-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (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)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 188 ms.
Product exploration explored 100000 steps with 3 reset in 215 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) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 803 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:15:14] [INFO ] Invariant cache hit.
[2023-03-11 09:15:14] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F p0), (F p2), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 10 factoid took 952 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true]
[2023-03-11 09:15:16] [INFO ] Invariant cache hit.
[2023-03-11 09:15:17] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 09:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:17] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-11 09:15:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-11 09:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:18] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-11 09:15:18] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-11 09:15:19] [INFO ] Added : 145 causal constraints over 29 iterations in 814 ms. Result :sat
Could not prove EG (NOT 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.
[2023-03-11 09:15:19] [INFO ] Invariant cache hit.
[2023-03-11 09:15:19] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 09:15:19] [INFO ] Invariant cache hit.
[2023-03-11 09:15:19] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-11 09:15:19] [INFO ] Invariant cache hit.
[2023-03-11 09:15:19] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 613 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Finished random walk after 183 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F p2), (F p0), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 799 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true]
[2023-03-11 09:15:21] [INFO ] Invariant cache hit.
[2023-03-11 09:15:23] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 09:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:23] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-11 09:15:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 09:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:24] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-11 09:15:24] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-11 09:15:25] [INFO ] Added : 145 causal constraints over 29 iterations in 779 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Entered a terminal (fully accepting) state of product in 97594 steps with 2 reset in 170 ms.
FORMULA BART-COL-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-13 finished in 13311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 7 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2023-03-11 09:15:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 09:15:25] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 09:15:25] [INFO ] Invariant cache hit.
[2023-03-11 09:15:25] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-11 09:15:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:15:25] [INFO ] Invariant cache hit.
[2023-03-11 09:15:26] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : BART-COL-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 232 ms.
Stack based approach found an accepted trace after 2216 steps with 0 reset with depth 2217 and stack size 2217 in 6 ms.
FORMULA BART-COL-060-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-14 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 5 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-11 09:15:26] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 09:15:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 09:15:26] [INFO ] Invariant cache hit.
[2023-03-11 09:15:26] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 09:15:26] [INFO ] Invariant cache hit.
[2023-03-11 09:15:26] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-15 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 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, 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 44683 steps with 0 reset in 111 ms.
FORMULA BART-COL-060-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-15 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-11 09:15:27] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16063841744922775244
[2023-03-11 09:15:27] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2023-03-11 09:15:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:15:27] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2023-03-11 09:15:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:15:27] [INFO ] Applying decomposition
[2023-03-11 09:15:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 09:15:27] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2023-03-11 09:15:27] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:15:27] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16063841744922775244
Running compilation step : cd /tmp/ltsmin16063841744922775244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1863457508367640425.txt' '-o' '/tmp/graph1863457508367640425.bin' '-w' '/tmp/graph1863457508367640425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1863457508367640425.bin' '-l' '-1' '-v' '-w' '/tmp/graph1863457508367640425.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:15:27] [INFO ] Decomposing Gal with order
[2023-03-11 09:15:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:15:27] [INFO ] Removed a total of 46 redundant transitions.
[2023-03-11 09:15:27] [INFO ] Flatten gal took : 16 ms
[2023-03-11 09:15:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2023-03-11 09:15:27] [INFO ] Time to serialize gal into /tmp/LTLFireability4020276062906433360.gal : 3 ms
[2023-03-11 09:15:27] [INFO ] Time to serialize properties into /tmp/LTLFireability16460992151425104129.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4020276062906433360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16460992151425104129.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i7.u3.TrainState_90>=1)||(i7.u3.TrainState_88>=1))||((i4.u0.TrainState_43>=1)||(i1.u1.TrainState_45>=1)))||(((i0.u2.Tr...3929
Formula 0 simplified : FG!"((((((((i7.u3.TrainState_90>=1)||(i7.u3.TrainState_88>=1))||((i4.u0.TrainState_43>=1)||(i1.u1.TrainState_45>=1)))||(((i0.u2.Trai...3923
Compilation finished in 456 ms.
Running link step : cd /tmp/ltsmin16063841744922775244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16063841744922775244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==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.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Initializing POR dependencies: labels 203, guards 202
pins2lts-mc-linux64( 2/ 8), 0.021: completed 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.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.199: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 0.199: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.200: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.257: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.261: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.278: There are 205 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.278: State length is 133, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.278: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.278: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.278: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.278: Visible groups: 0 / 205, labels: 1 / 205
pins2lts-mc-linux64( 0/ 8), 0.278: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.278: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.688: [Blue] ~119 levels ~960 states ~38960 transitions
pins2lts-mc-linux64( 2/ 8), 0.729: [Blue] ~240 levels ~1920 states ~43312 transitions
pins2lts-mc-linux64( 2/ 8), 0.802: [Blue] ~480 levels ~3840 states ~54472 transitions
pins2lts-mc-linux64( 2/ 8), 0.921: [Blue] ~960 levels ~7680 states ~78136 transitions
pins2lts-mc-linux64( 2/ 8), 1.180: [Blue] ~1920 levels ~15360 states ~125128 transitions
pins2lts-mc-linux64( 2/ 8), 1.563: [Blue] ~3840 levels ~30720 states ~219832 transitions
pins2lts-mc-linux64( 2/ 8), 2.288: [Blue] ~7680 levels ~61440 states ~397560 transitions
pins2lts-mc-linux64( 3/ 8), 3.381: [Blue] ~15359 levels ~122880 states ~805376 transitions
pins2lts-mc-linux64( 3/ 8), 5.046: [Blue] ~30719 levels ~245760 states ~1557744 transitions
pins2lts-mc-linux64( 3/ 8), 7.892: [Blue] ~61439 levels ~491520 states ~3145328 transitions
pins2lts-mc-linux64( 3/ 8), 13.755: [Blue] ~122879 levels ~983040 states ~6324144 transitions
pins2lts-mc-linux64( 3/ 8), 26.610: [Blue] ~245759 levels ~1966080 states ~13560848 transitions
pins2lts-mc-linux64( 3/ 8), 52.476: [Blue] ~491519 levels ~3932160 states ~28213256 transitions
pins2lts-mc-linux64( 3/ 8), 105.140: [Blue] ~983039 levels ~7864320 states ~56625048 transitions
pins2lts-mc-linux64( 0/ 8), 150.815: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 151.369:
pins2lts-mc-linux64( 0/ 8), 151.369: Explored 8659459 states 75773234 transitions, fanout: 8.750
pins2lts-mc-linux64( 0/ 8), 151.369: Total exploration time 151.070 sec (150.530 sec minimum, 150.656 sec on average)
pins2lts-mc-linux64( 0/ 8), 151.369: States per second: 57321, Transitions per second: 501577
pins2lts-mc-linux64( 0/ 8), 151.369:
pins2lts-mc-linux64( 0/ 8), 151.369: State space has 57502804 states, 7 are accepting
pins2lts-mc-linux64( 0/ 8), 151.369: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 151.369: blue states: 8659459 (15.06%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 151.369: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 151.369: all-red states: 7 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 151.369:
pins2lts-mc-linux64( 0/ 8), 151.370: Total memory used for local state coloring: 132.1MB
pins2lts-mc-linux64( 0/ 8), 151.370:
pins2lts-mc-linux64( 0/ 8), 151.370: Queue width: 8B, total height: 8657470, memory: 66.05MB
pins2lts-mc-linux64( 0/ 8), 151.370: Tree memory: 694.7MB, 12.7 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 151.370: Tree fill ratio (roots/leafs): 42.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 151.370: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 151.370: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 151.370: Est. total memory use: 760.8MB (~1090.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16063841744922775244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16063841744922775244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-11 09:36:14] [INFO ] Applying decomposition
[2023-03-11 09:36:14] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:36:14] [INFO ] Decomposing Gal with order
[2023-03-11 09:36:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:36:14] [INFO ] Removed a total of 140 redundant transitions.
[2023-03-11 09:36:14] [INFO ] Flatten gal took : 16 ms
[2023-03-11 09:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 09:36:14] [INFO ] Time to serialize gal into /tmp/LTLFireability1105191160186428334.gal : 3 ms
[2023-03-11 09:36:14] [INFO ] Time to serialize properties into /tmp/LTLFireability4949734349593907858.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1105191160186428334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4949734349593907858.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainState_88>=1))||((trainidspeeddistance43.TrainSt...5615
Formula 0 simplified : FG!"((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainState_88>=1))||((trainidspeeddistance43.TrainStat...5609
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
18502 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,185.047,2203528,1,0,3.78576e+06,110421,1606,2.14626e+06,73,241869,3121508
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-060-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1578835 ms.

BK_STOP 1678527563669

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BART-COL-060, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593600748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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