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.r165-tall-167838849900084.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 itstools
Input is Echo-PT-d03r03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838849900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:03 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.3K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:04 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 114K 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-d03r03-LTLFireability-00
FORMULA_NAME Echo-PT-d03r03-LTLFireability-01
FORMULA_NAME Echo-PT-d03r03-LTLFireability-02
FORMULA_NAME Echo-PT-d03r03-LTLFireability-03
FORMULA_NAME Echo-PT-d03r03-LTLFireability-04
FORMULA_NAME Echo-PT-d03r03-LTLFireability-05
FORMULA_NAME Echo-PT-d03r03-LTLFireability-06
FORMULA_NAME Echo-PT-d03r03-LTLFireability-07
FORMULA_NAME Echo-PT-d03r03-LTLFireability-08
FORMULA_NAME Echo-PT-d03r03-LTLFireability-09
FORMULA_NAME Echo-PT-d03r03-LTLFireability-10
FORMULA_NAME Echo-PT-d03r03-LTLFireability-11
FORMULA_NAME Echo-PT-d03r03-LTLFireability-12
FORMULA_NAME Echo-PT-d03r03-LTLFireability-13
FORMULA_NAME Echo-PT-d03r03-LTLFireability-14
FORMULA_NAME Echo-PT-d03r03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679428425847

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=Echo-PT-d03r03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-21 19:53:47] [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-21 19:53:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:53:47] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-21 19:53:47] [INFO ] Transformed 265 places.
[2023-03-21 19:53:47] [INFO ] Transformed 206 transitions.
[2023-03-21 19:53:47] [INFO ] Found NUPN structural information;
[2023-03-21 19:53:47] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d03r03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 206/206 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 238 transition count 206
Applied a total of 27 rules in 22 ms. Remains 238 /265 variables (removed 27) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-21 19:53:47] [INFO ] Computed 108 place invariants in 47 ms
[2023-03-21 19:53:48] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-21 19:53:48] [INFO ] Invariant cache hit.
[2023-03-21 19:53:48] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-21 19:53:48] [INFO ] Invariant cache hit.
[2023-03-21 19:53:48] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/265 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1517 ms. Remains : 238/265 places, 206/206 transitions.
Support contains 68 out of 238 places after structural reductions.
[2023-03-21 19:53:49] [INFO ] Flatten gal took : 48 ms
[2023-03-21 19:53:49] [INFO ] Flatten gal took : 22 ms
[2023-03-21 19:53:49] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 67 out of 238 places (down from 68) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:53:49] [INFO ] Invariant cache hit.
[2023-03-21 19:53:49] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 94 ms returned sat
[2023-03-21 19:53:49] [INFO ] After 257ms 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.
FORMULA Echo-PT-d03r03-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Echo-PT-d03r03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
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(F((p0&&G((X(p1)&&F(p2)))))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 19:53:50] [INFO ] Invariant cache hit.
[2023-03-21 19:53:50] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-21 19:53:50] [INFO ] Invariant cache hit.
[2023-03-21 19:53:51] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-03-21 19:53:51] [INFO ] Invariant cache hit.
[2023-03-21 19:53:51] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2)))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s138 0) (EQ s165 0)), p2:(AND (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s107 1)), p1:(AND (EQ s24 1) (EQ s160 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]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d03r03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-00 finished in 1639 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(((X(p2)&&p1)||p0))))'
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 19:53:51] [INFO ] Invariant cache hit.
[2023-03-21 19:53:52] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-21 19:53:52] [INFO ] Invariant cache hit.
[2023-03-21 19:53:52] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2023-03-21 19:53:52] [INFO ] Invariant cache hit.
[2023-03-21 19:53:52] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1220 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 108 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-d03r03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s43 1) (EQ s172 1) (EQ s174 1) (OR (EQ s143 0) (EQ s187 0))), p0:(OR (EQ s43 0) (EQ s172 0) (EQ s174 0)), p2:(OR (EQ s71 0) (EQ s198 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2120 reset in 571 ms.
Product exploration explored 100000 steps with 2082 reset in 500 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
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 (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 12 factoid took 371 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-01 finished in 2884 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(p0))||F(p1))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 13 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 19:53:54] [INFO ] Invariant cache hit.
[2023-03-21 19:53:55] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-21 19:53:55] [INFO ] Invariant cache hit.
[2023-03-21 19:53:55] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2023-03-21 19:53:55] [INFO ] Invariant cache hit.
[2023-03-21 19:53:55] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1264 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s33 1) (EQ s34 1) (EQ s134 1)), p0:(OR (EQ s16 0) (EQ s17 0) (EQ s19 0) (EQ s20 0) (EQ s120 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1283 steps with 29 reset in 10 ms.
FORMULA Echo-PT-d03r03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-02 finished in 1428 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 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 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 21 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-21 19:53:56] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-21 19:53:56] [INFO ] Implicit Places using invariants in 396 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 400 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 14 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s156 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 87 steps with 5 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-03 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X(!p2)))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-21 19:53:56] [INFO ] Computed 108 place invariants in 18 ms
[2023-03-21 19:53:57] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-21 19:53:57] [INFO ] Invariant cache hit.
[2023-03-21 19:53:57] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-21 19:53:57] [INFO ] Invariant cache hit.
[2023-03-21 19:53:57] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1328 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 200 ms :[p2, p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s162 1)), p1:(AND (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s107 1)), p2:(AND (EQ s22 1) (EQ s160 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 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 18 factoid took 252 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-05 finished in 2352 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)&&(X(F(p0))||p1))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 19:53:58] [INFO ] Invariant cache hit.
[2023-03-21 19:53:59] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-21 19:53:59] [INFO ] Invariant cache hit.
[2023-03-21 19:53:59] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-21 19:53:59] [INFO ] Invariant cache hit.
[2023-03-21 19:54:00] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1220 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s151 1) (EQ s222 1)), p1:(OR (EQ s151 0) (EQ s222 0))], 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]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-06 finished in 1426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 10 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 19:54:00] [INFO ] Invariant cache hit.
[2023-03-21 19:54:00] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-21 19:54:00] [INFO ] Invariant cache hit.
[2023-03-21 19:54:01] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2023-03-21 19:54:01] [INFO ] Invariant cache hit.
[2023-03-21 19:54:01] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1214 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s38 1) (EQ s169 1) (EQ s170 1) (EQ s171 1)), p1:(OR (AND (EQ s147 1) (EQ s199 1)) (AND (EQ s91 1) (EQ s228 1) (EQ s229 1) (EQ s230 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 Echo-PT-d03r03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-07 finished in 1317 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(((F(!p1)||G(!p2))&&p0))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 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 19 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-21 19:54:01] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-21 19:54:02] [INFO ] Implicit Places using invariants in 453 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 455 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 13 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 487 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NOT (AND (EQ s151 1) (EQ s220 1))) (OR (NEQ s13 1) (NEQ s156 1))), p1:(AND (EQ s70 1) (EQ s194 1) (EQ s195 1) (EQ s196 1)), p2:(AND (EQ s151 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1938 reset in 450 ms.
Product exploration explored 100000 steps with 1933 reset in 457 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
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 p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X p0), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 15 factoid took 600 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-08 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(X(G(p0))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-21 19:54:03] [INFO ] Computed 108 place invariants in 19 ms
[2023-03-21 19:54:04] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-21 19:54:04] [INFO ] Invariant cache hit.
[2023-03-21 19:54:05] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-21 19:54:05] [INFO ] Invariant cache hit.
[2023-03-21 19:54:05] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1387 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s26 1) (NEQ s27 1) (NEQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 256 steps with 4 reset in 4 ms.
FORMULA Echo-PT-d03r03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-09 finished in 1518 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 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 19:54:05] [INFO ] Invariant cache hit.
[2023-03-21 19:54:05] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-21 19:54:05] [INFO ] Invariant cache hit.
[2023-03-21 19:54:06] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2023-03-21 19:54:06] [INFO ] Invariant cache hit.
[2023-03-21 19:54:06] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s137 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][false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-10 finished in 1354 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((X(F(p2))||p1))))))'
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 14 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-21 19:54:06] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-21 19:54:07] [INFO ] Implicit Places using invariants in 433 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 435 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s106 1)), p1:(OR (EQ s143 0) (EQ s188 0)), p2:(AND (EQ s143 1) (EQ s188 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 52 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-11 finished in 587 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 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 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 12 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
[2023-03-21 19:54:07] [INFO ] Invariant cache hit.
[2023-03-21 19:54:07] [INFO ] Implicit Places using invariants in 401 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 403 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 425 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s58 1) (EQ s184 1) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-12 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 7 ms. Remains 231 /238 variables (removed 7) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 231 cols
[2023-03-21 19:54:07] [INFO ] Computed 102 place invariants in 18 ms
[2023-03-21 19:54:08] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-21 19:54:08] [INFO ] Invariant cache hit.
[2023-03-21 19:54:08] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2023-03-21 19:54:08] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-21 19:54:08] [INFO ] Invariant cache hit.
[2023-03-21 19:54:09] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/238 places, 205/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1187 ms. Remains : 231/238 places, 205/206 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s18 1) (EQ s19 1) (EQ s20 1) (EQ s119 1)), p0:(OR (EQ s140 0) (EQ s172 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2957 reset in 411 ms.
Product exploration explored 100000 steps with 2914 reset in 438 ms.
Computed a total of 231 stabilizing places and 205 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 205
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 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-14 finished in 2384 ms.
All properties solved by simple procedures.
Total runtime 23056 ms.

BK_STOP 1679428451530

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.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="Echo-PT-d03r03"
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 Echo-PT-d03r03, 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 r165-tall-167838849900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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