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.r169-tall-167838855300068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Echo-PT-d02r15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 917K 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 Echo-PT-d02r15-LTLFireability-00
FORMULA_NAME Echo-PT-d02r15-LTLFireability-01
FORMULA_NAME Echo-PT-d02r15-LTLFireability-02
FORMULA_NAME Echo-PT-d02r15-LTLFireability-03
FORMULA_NAME Echo-PT-d02r15-LTLFireability-04
FORMULA_NAME Echo-PT-d02r15-LTLFireability-05
FORMULA_NAME Echo-PT-d02r15-LTLFireability-06
FORMULA_NAME Echo-PT-d02r15-LTLFireability-07
FORMULA_NAME Echo-PT-d02r15-LTLFireability-08
FORMULA_NAME Echo-PT-d02r15-LTLFireability-09
FORMULA_NAME Echo-PT-d02r15-LTLFireability-10
FORMULA_NAME Echo-PT-d02r15-LTLFireability-11
FORMULA_NAME Echo-PT-d02r15-LTLFireability-12
FORMULA_NAME Echo-PT-d02r15-LTLFireability-13
FORMULA_NAME Echo-PT-d02r15-LTLFireability-14
FORMULA_NAME Echo-PT-d02r15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678471205998

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 18:00:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 18:00:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:00:07] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-10 18:00:07] [INFO ] Transformed 2127 places.
[2023-03-10 18:00:07] [INFO ] Transformed 1674 transitions.
[2023-03-10 18:00:07] [INFO ] Found NUPN structural information;
[2023-03-10 18:00:07] [INFO ] Parsed PT model containing 2127 places and 1674 transitions and 9700 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Echo-PT-d02r15-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 2127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2127/2127 places, 1674/1674 transitions.
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 1902 transition count 1674
Applied a total of 225 rules in 256 ms. Remains 1902 /2127 variables (removed 225) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1902 cols
[2023-03-10 18:00:10] [INFO ] Computed 840 place invariants in 2303 ms
[2023-03-10 18:00:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:00:12] [INFO ] Implicit Places using invariants in 3815 ms returned []
[2023-03-10 18:00:12] [INFO ] Invariant cache hit.
[2023-03-10 18:00:14] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 5752 ms to find 0 implicit places.
[2023-03-10 18:00:14] [INFO ] Invariant cache hit.
[2023-03-10 18:00:15] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1902/2127 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7087 ms. Remains : 1902/2127 places, 1674/1674 transitions.
Support contains 96 out of 1902 places after structural reductions.
[2023-03-10 18:00:15] [INFO ] Flatten gal took : 205 ms
[2023-03-10 18:00:15] [INFO ] Flatten gal took : 131 ms
[2023-03-10 18:00:15] [INFO ] Input system was already deterministic with 1674 transitions.
Support contains 88 out of 1902 places (down from 96) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 34) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 18:00:17] [INFO ] Invariant cache hit.
[2023-03-10 18:00:20] [INFO ] [Real]Absence check using 0 positive and 840 generalized place invariants in 3002 ms returned sat
[2023-03-10 18:00:22] [INFO ] After 1619ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3
[2023-03-10 18:00:23] [INFO ] After 2385ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-10 18:00:23] [INFO ] After 6509ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-10 18:00:27] [INFO ] [Nat]Absence check using 0 positive and 840 generalized place invariants in 3087 ms returned sat
[2023-03-10 18:00:29] [INFO ] After 1591ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-10 18:00:30] [INFO ] After 2287ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 583 ms.
[2023-03-10 18:00:30] [INFO ] After 7019ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Graph (complete) has 5685 edges and 1902 vertex of which 1893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1893 transition count 1669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 1892 transition count 1668
Applied a total of 6 rules in 202 ms. Remains 1892 /1902 variables (removed 10) and now considering 1668/1674 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 1892/1902 places, 1668/1674 transitions.
Finished random walk after 7361 steps, including 16 resets, run visited all 3 properties in 120 ms. (steps per millisecond=61 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((G(p1)||G(p2)||p0))))'
Support contains 8 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 267 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:00:31] [INFO ] Invariant cache hit.
[2023-03-10 18:00:33] [INFO ] Implicit Places using invariants in 1438 ms returned []
[2023-03-10 18:00:33] [INFO ] Invariant cache hit.
[2023-03-10 18:00:34] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 3211 ms to find 0 implicit places.
[2023-03-10 18:00:34] [INFO ] Invariant cache hit.
[2023-03-10 18:00:35] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4544 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s186 0) (EQ s1244 0) (EQ s1245 0) (EQ s1246 0)), p2:(OR (EQ s35 0) (EQ s36 0) (EQ s37 0) (EQ s874 0)), p0:(OR (EQ s186 0) (EQ s1244 0) (EQ s124...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70252 steps with 155 reset in 1120 ms.
FORMULA Echo-PT-d02r15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-00 finished in 6063 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&&F(G(p1)))))'
Support contains 6 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 146 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:00:37] [INFO ] Invariant cache hit.
[2023-03-10 18:00:38] [INFO ] Implicit Places using invariants in 1289 ms returned []
[2023-03-10 18:00:38] [INFO ] Invariant cache hit.
[2023-03-10 18:00:40] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
[2023-03-10 18:00:40] [INFO ] Invariant cache hit.
[2023-03-10 18:00:41] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4241 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s982 0) (EQ s1429 0)), p1:(OR (EQ s746 0) (EQ s1806 0) (EQ s1808 0) (EQ s1809 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 221 reset in 1438 ms.
Product exploration explored 100000 steps with 221 reset in 1633 ms.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 351 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r15-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r15-LTLFireability-01 finished in 8564 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(((X(p2)&&p1)||p0))))'
Support contains 8 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 54 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:00:46] [INFO ] Invariant cache hit.
[2023-03-10 18:00:47] [INFO ] Implicit Places using invariants in 1364 ms returned []
[2023-03-10 18:00:47] [INFO ] Invariant cache hit.
[2023-03-10 18:00:54] [INFO ] Implicit Places using invariants and state equation in 6900 ms returned []
Implicit Place search using SMT with State Equation took 8275 ms to find 0 implicit places.
[2023-03-10 18:00:54] [INFO ] Invariant cache hit.
[2023-03-10 18:00:55] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9326 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 135 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 : Echo-PT-d02r15-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), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s727 0) (EQ s1786 0) (EQ s1787 0) (EQ s1789 0)), p1:(AND (EQ s534 1) (EQ s1592 1) (EQ s1593 1) (EQ s1594 1)), p2:(AND (EQ s534 1) (EQ s1592 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1705 ms.
Product exploration explored 100000 steps with 50000 reset in 1724 ms.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 266 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r15-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r15-LTLFireability-02 finished in 13901 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((X((X(X(X(p2)))&&F(p3)&&p1))&&p0)))'
Support contains 8 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 52 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:00:59] [INFO ] Invariant cache hit.
[2023-03-10 18:01:01] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2023-03-10 18:01:01] [INFO ] Invariant cache hit.
[2023-03-10 18:01:07] [INFO ] Implicit Places using invariants and state equation in 6461 ms returned []
Implicit Place search using SMT with State Equation took 7708 ms to find 0 implicit places.
[2023-03-10 18:01:07] [INFO ] Invariant cache hit.
[2023-03-10 18:01:12] [INFO ] Dead Transitions using invariants and state equation in 4598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12358 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (OR (NOT p1) (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}]], initial=0, aps=[p0:(AND (EQ s519 1) (EQ s1578 1) (EQ s1579 1) (EQ s1581 1)), p1:(AND (EQ s519 1) (EQ s1578 1) (EQ s1579 1) (EQ s1581 1)), p3:(OR (EQ s938 0) (EQ s1262 0))...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-03 finished in 12692 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((X(F((p1&&G(p2))))||p0))))'
Support contains 9 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 53 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:01:12] [INFO ] Invariant cache hit.
[2023-03-10 18:01:18] [INFO ] Implicit Places using invariants in 6215 ms returned []
[2023-03-10 18:01:18] [INFO ] Invariant cache hit.
[2023-03-10 18:01:20] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 7872 ms to find 0 implicit places.
[2023-03-10 18:01:20] [INFO ] Invariant cache hit.
[2023-03-10 18:01:21] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8972 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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 : Echo-PT-d02r15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s22 0) (EQ s23 0) (EQ s860 0)), p1:(OR (EQ s1073 0) (EQ s1754 0)), p2:(AND (EQ s692 1) (EQ s1752 1) (EQ s1754 1) (EQ s1755 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1665 ms.
Product exploration explored 100000 steps with 50000 reset in 1753 ms.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G p0)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r15-LTLFireability-05 finished in 13480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((X(!p1)&&F(!p2))||X(G(!p1))))))'
Support contains 8 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 48 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:01:26] [INFO ] Invariant cache hit.
[2023-03-10 18:01:31] [INFO ] Implicit Places using invariants in 5811 ms returned []
[2023-03-10 18:01:31] [INFO ] Invariant cache hit.
[2023-03-10 18:01:38] [INFO ] Implicit Places using invariants and state equation in 6376 ms returned []
Implicit Place search using SMT with State Equation took 12202 ms to find 0 implicit places.
[2023-03-10 18:01:38] [INFO ] Invariant cache hit.
[2023-03-10 18:01:42] [INFO ] Dead Transitions using invariants and state equation in 4564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16819 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p2 p1), p2]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s1010 0) (EQ s1510 0)), p2:(AND (EQ s280 1) (EQ s1340 1) (EQ s1342 1) (EQ s1343 1)), p1:(AND (NOT (AND (EQ s1010 1) (EQ s1510 1))) (EQ s1017 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1315 ms.
Product exploration explored 100000 steps with 33333 reset in 1419 ms.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND p0 p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 10 factoid took 210 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r15-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r15-LTLFireability-07 finished in 20618 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)&&F(G(p1)))))'
Support contains 4 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Graph (complete) has 5685 edges and 1902 vertex of which 1897 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.16 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 197 ms. Remains 1896 /1902 variables (removed 6) and now considering 1672/1674 (removed 2) transitions.
// Phase 1: matrix 1672 rows 1896 cols
[2023-03-10 18:01:48] [INFO ] Computed 836 place invariants in 1755 ms
[2023-03-10 18:01:53] [INFO ] Implicit Places using invariants in 6592 ms returned [2, 55, 1841, 1894]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 6616 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1902 places, 1672/1674 transitions.
Applied a total of 0 rules in 92 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6917 ms. Remains : 1892/1902 places, 1672/1674 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1094 1) (EQ s1857 1)), p1:(AND (EQ s1065 1) (EQ s1745 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 448 steps with 0 reset in 6 ms.
FORMULA Echo-PT-d02r15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-08 finished in 7123 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))'
Support contains 4 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 54 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1902 cols
[2023-03-10 18:01:55] [INFO ] Computed 840 place invariants in 2006 ms
[2023-03-10 18:01:57] [INFO ] Implicit Places using invariants in 3301 ms returned []
[2023-03-10 18:01:57] [INFO ] Invariant cache hit.
[2023-03-10 18:02:03] [INFO ] Implicit Places using invariants and state equation in 6522 ms returned []
Implicit Place search using SMT with State Equation took 9854 ms to find 0 implicit places.
[2023-03-10 18:02:03] [INFO ] Invariant cache hit.
[2023-03-10 18:02:08] [INFO ] Dead Transitions using invariants and state equation in 4622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14543 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s656 1) (EQ s1716 1) (EQ s1718 1) (EQ s1719 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-09 finished in 14643 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((F(G(p0)) U p1))))'
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 49 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:02:08] [INFO ] Invariant cache hit.
[2023-03-10 18:02:14] [INFO ] Implicit Places using invariants in 6333 ms returned []
[2023-03-10 18:02:14] [INFO ] Invariant cache hit.
[2023-03-10 18:02:21] [INFO ] Implicit Places using invariants and state equation in 6554 ms returned []
Implicit Place search using SMT with State Equation took 12914 ms to find 0 implicit places.
[2023-03-10 18:02:21] [INFO ] Invariant cache hit.
[2023-03-10 18:02:22] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13965 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1109 1) (EQ s1893 1)), p0:(AND (EQ s150 1) (EQ s1209 1) (EQ s1210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 450 steps with 0 reset in 9 ms.
FORMULA Echo-PT-d02r15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-10 finished in 14148 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(X(G(((G(p0) U p1)||G((X(X(p3))&&p2)))))))'
Support contains 6 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 44 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:02:22] [INFO ] Invariant cache hit.
[2023-03-10 18:02:29] [INFO ] Implicit Places using invariants in 6408 ms returned []
[2023-03-10 18:02:29] [INFO ] Invariant cache hit.
[2023-03-10 18:02:35] [INFO ] Implicit Places using invariants and state equation in 6328 ms returned []
Implicit Place search using SMT with State Equation took 12743 ms to find 0 implicit places.
[2023-03-10 18:02:35] [INFO ] Invariant cache hit.
[2023-03-10 18:02:40] [INFO ] Dead Transitions using invariants and state equation in 4652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17444 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 612 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (AND p0 (NOT p1) p2 (NOT p3))]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=p2, acceptance={} source=6 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=7 dest: 7}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=7 dest: 9}, { cond=(OR (AND (NOT p1) p0) (AND p0 p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 11}], [{ cond=(NOT p3), acceptance={} source=9 dest: 3}], [{ cond=(OR (AND p1 (NOT p0) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={} source=10 dest: 3}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=11 dest: 5}]], initial=0, aps=[p1:(AND (EQ s709 1) (EQ s1771 1) (EQ s1772 1) (EQ s1773 1)), p0:(AND (EQ s1009 1) (EQ s1504 1)), p2:(AND (EQ s709 1) (EQ s1771 1) (EQ s1772 1) (EQ s1773 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-11 finished in 18092 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 U !p1))) U p2))'
Support contains 9 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 52 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:02:40] [INFO ] Invariant cache hit.
[2023-03-10 18:02:47] [INFO ] Implicit Places using invariants in 6491 ms returned []
[2023-03-10 18:02:47] [INFO ] Invariant cache hit.
[2023-03-10 18:02:53] [INFO ] Implicit Places using invariants and state equation in 6485 ms returned []
Implicit Place search using SMT with State Equation took 13016 ms to find 0 implicit places.
[2023-03-10 18:02:53] [INFO ] Invariant cache hit.
[2023-03-10 18:02:58] [INFO ] Dead Transitions using invariants and state equation in 4703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17788 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (OR (NOT p2) p1), true, p1, p1]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s400 1) (EQ s1462 1) (EQ s1463 1)), p1:(AND (EQ s1029 1) (EQ s1582 1)), p0:(AND (EQ s17 1) (EQ s18 1) (EQ s19 1) (EQ s856 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 450 steps with 0 reset in 7 ms.
FORMULA Echo-PT-d02r15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-12 finished in 17995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 4 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 46 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 18:02:58] [INFO ] Invariant cache hit.
[2023-03-10 18:03:04] [INFO ] Implicit Places using invariants in 6167 ms returned []
[2023-03-10 18:03:04] [INFO ] Invariant cache hit.
[2023-03-10 18:03:11] [INFO ] Implicit Places using invariants and state equation in 6433 ms returned []
Implicit Place search using SMT with State Equation took 12626 ms to find 0 implicit places.
[2023-03-10 18:03:11] [INFO ] Invariant cache hit.
[2023-03-10 18:03:15] [INFO ] Dead Transitions using invariants and state equation in 4625 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17298 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1110 1) (EQ s1894 1)), p1:(AND (EQ s1084 1) (EQ s1795 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 450 steps with 0 reset in 7 ms.
FORMULA Echo-PT-d02r15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-13 finished in 17433 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(p0))'
Support contains 2 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Graph (complete) has 5685 edges and 1902 vertex of which 1897 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 71 ms. Remains 1896 /1902 variables (removed 6) and now considering 1672/1674 (removed 2) transitions.
// Phase 1: matrix 1672 rows 1896 cols
[2023-03-10 18:03:17] [INFO ] Computed 836 place invariants in 1737 ms
[2023-03-10 18:03:22] [INFO ] Implicit Places using invariants in 6626 ms returned [2, 55, 1841, 1894]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 6650 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1902 places, 1672/1674 transitions.
Applied a total of 0 rules in 109 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6835 ms. Remains : 1892/1902 places, 1672/1674 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1073 1) (EQ s1774 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 448 steps with 0 reset in 6 ms.
FORMULA Echo-PT-d02r15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLFireability-14 finished in 6944 ms.
All properties solved by simple procedures.
Total runtime 195521 ms.
ITS solved all properties within timeout

BK_STOP 1678471404360

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Echo-PT-d02r15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d02r15, 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 r169-tall-167838855300068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 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 ;