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.r329-tall-167889202100468.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 Referendum-PT-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202100468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K Feb 26 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Feb 26 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K Mar 5 18:23 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 Referendum-PT-0010-LTLFireability-00
FORMULA_NAME Referendum-PT-0010-LTLFireability-01
FORMULA_NAME Referendum-PT-0010-LTLFireability-02
FORMULA_NAME Referendum-PT-0010-LTLFireability-03
FORMULA_NAME Referendum-PT-0010-LTLFireability-04
FORMULA_NAME Referendum-PT-0010-LTLFireability-05
FORMULA_NAME Referendum-PT-0010-LTLFireability-06
FORMULA_NAME Referendum-PT-0010-LTLFireability-07
FORMULA_NAME Referendum-PT-0010-LTLFireability-08
FORMULA_NAME Referendum-PT-0010-LTLFireability-09
FORMULA_NAME Referendum-PT-0010-LTLFireability-10
FORMULA_NAME Referendum-PT-0010-LTLFireability-11
FORMULA_NAME Referendum-PT-0010-LTLFireability-12
FORMULA_NAME Referendum-PT-0010-LTLFireability-13
FORMULA_NAME Referendum-PT-0010-LTLFireability-14
FORMULA_NAME Referendum-PT-0010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679135496813

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=Referendum-PT-0010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 10:31:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 10:31:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:31:38] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-18 10:31:38] [INFO ] Transformed 31 places.
[2023-03-18 10:31:38] [INFO ] Transformed 21 transitions.
[2023-03-18 10:31:38] [INFO ] Found NUPN structural information;
[2023-03-18 10:31:38] [INFO ] Parsed PT model containing 31 places and 21 transitions and 51 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 9 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-18 10:31:38] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 10:31:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 10:31:38] [INFO ] Invariant cache hit.
[2023-03-18 10:31:38] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-18 10:31:38] [INFO ] Invariant cache hit.
[2023-03-18 10:31:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/31 places, 11/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 11/31 places, 11/21 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-18 10:31:39] [INFO ] Flatten gal took : 13 ms
[2023-03-18 10:31:39] [INFO ] Flatten gal took : 4 ms
[2023-03-18 10:31:39] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10000 steps, including 833 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:31:39] [INFO ] Invariant cache hit.
[2023-03-18 10:31:39] [INFO ] After 30ms 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.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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' '!(F(p0))'
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:39] [INFO ] Invariant cache hit.
[2023-03-18 10:31:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 10:31:39] [INFO ] Invariant cache hit.
[2023-03-18 10:31:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-18 10:31:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:39] [INFO ] Invariant cache hit.
[2023-03-18 10:31:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 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]]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-00 finished in 691 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(((F(p1) U !p0) U (p0&&(F(p1) U !p0)))))))'
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:40] [INFO ] Invariant cache hit.
[2023-03-18 10:31:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 10:31:40] [INFO ] Invariant cache hit.
[2023-03-18 10:31:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 10:31:40] [INFO ] Invariant cache hit.
[2023-03-18 10:31:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0), true, (NOT p1), p0]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s0 1), p1:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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)), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-01 finished in 803 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 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:40] [INFO ] Invariant cache hit.
[2023-03-18 10:31:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 10:31:40] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 10:31:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 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]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-02 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 10:31:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-03 finished in 133 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 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-04 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 (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 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 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-04 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(!(F((p0 U p0))&&F(p1))))) U p0))'
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 131 ms :[p1, (NOT p0), true, (OR (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-05 finished in 215 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 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 10:31:41] [INFO ] Invariant cache hit.
[2023-03-18 10:31:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 10:31:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-06 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 s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8333 reset in 117 ms.
Product exploration explored 100000 steps with 8333 reset in 134 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-06 finished in 475 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 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-18 10:31:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 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 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-07 finished in 102 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 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 4 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 10:31:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:31:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-08 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:(EQ s2 0)], 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 14 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-08 finished in 219 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&&G(p2)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5 transition count 5
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5 transition count 5
Applied a total of 12 rules in 1 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-18 10:31:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:31:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-18 10:31:42] [INFO ] Invariant cache hit.
[2023-03-18 10:31:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/11 places, 5/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 5/11 places, 5/11 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s1 0), p2:(EQ s4 1), p1:(EQ s3 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-10 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 1 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 10:31:43] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:31:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 10:31:43] [INFO ] Invariant cache hit.
[2023-03-18 10:31:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-18 10:31:43] [INFO ] Invariant cache hit.
[2023-03-18 10:31:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-11 finished in 176 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)||G(F(!p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 10 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 10:31:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:31:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:31:43] [INFO ] Invariant cache hit.
[2023-03-18 10:31:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 10:31:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:43] [INFO ] Invariant cache hit.
[2023-03-18 10:31:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s2 1)], 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 25000 reset in 180 ms.
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-12 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5 transition count 5
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5 transition count 5
Applied a total of 12 rules in 0 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-18 10:31:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:31:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 10:31:44] [INFO ] Invariant cache hit.
[2023-03-18 10:31:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 10:31:44] [INFO ] Invariant cache hit.
[2023-03-18 10:31:44] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/11 places, 5/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 5/11 places, 5/11 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s3 0) (EQ s4 1)), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-13 finished in 190 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(F((G(p0)||(p0&&G(F(p1)))))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 0 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 10:31:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:31:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:31:44] [INFO ] Invariant cache hit.
[2023-03-18 10:31:44] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-18 10:31:44] [INFO ] Invariant cache hit.
[2023-03-18 10:31:44] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(NEQ s2 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLFireability-14 finished in 309 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)||(G(!p2)&&p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 10 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 10:31:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:31:44] [INFO ] Implicit Places using invariants in 11 ms returned []
[2023-03-18 10:31:44] [INFO ] Invariant cache hit.
[2023-03-18 10:31:44] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-18 10:31:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:31:44] [INFO ] Invariant cache hit.
[2023-03-18 10:31:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : Referendum-PT-0010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 0), p1:(AND (EQ s1 1) (EQ s2 1)), p2:(NEQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 16 factoid took 557 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLFireability-15 finished in 931 ms.
All properties solved by simple procedures.
Total runtime 7267 ms.
ITS solved all properties within timeout

BK_STOP 1679135506643

--------------------
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="Referendum-PT-0010"
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 Referendum-PT-0010, 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 r329-tall-167889202100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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