Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 36K Apr 29 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 29 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 29 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 172K Apr 29 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 57K May 10 09:34 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-0050-LTLCardinality-00
FORMULA_NAME Referendum-PT-0050-LTLCardinality-01
FORMULA_NAME Referendum-PT-0050-LTLCardinality-02
FORMULA_NAME Referendum-PT-0050-LTLCardinality-03
FORMULA_NAME Referendum-PT-0050-LTLCardinality-04
FORMULA_NAME Referendum-PT-0050-LTLCardinality-05
FORMULA_NAME Referendum-PT-0050-LTLCardinality-06
FORMULA_NAME Referendum-PT-0050-LTLCardinality-07
FORMULA_NAME Referendum-PT-0050-LTLCardinality-08
FORMULA_NAME Referendum-PT-0050-LTLCardinality-09
FORMULA_NAME Referendum-PT-0050-LTLCardinality-10
FORMULA_NAME Referendum-PT-0050-LTLCardinality-11
FORMULA_NAME Referendum-PT-0050-LTLCardinality-12
FORMULA_NAME Referendum-PT-0050-LTLCardinality-13
FORMULA_NAME Referendum-PT-0050-LTLCardinality-14
FORMULA_NAME Referendum-PT-0050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083587958

Running Version 202205111006
[2022-05-20 21:53:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:53:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:53:09] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-20 21:53:09] [INFO ] Transformed 151 places.
[2022-05-20 21:53:09] [INFO ] Transformed 101 transitions.
[2022-05-20 21:53:09] [INFO ] Found NUPN structural information;
[2022-05-20 21:53:09] [INFO ] Parsed PT model containing 151 places and 101 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 151 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 16 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:09] [INFO ] Computed 50 place invariants in 12 ms
[2022-05-20 21:53:09] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:09] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-20 21:53:09] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:09] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-20 21:53:10] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
Support contains 151 out of 151 places after structural reductions.
[2022-05-20 21:53:10] [INFO ] Flatten gal took : 27 ms
[2022-05-20 21:53:10] [INFO ] Flatten gal took : 12 ms
[2022-05-20 21:53:10] [INFO ] Input system was already deterministic with 101 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:10] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-20 21:53:10] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2022-05-20 21:53:10] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Referendum-PT-0050-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA Referendum-PT-0050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 151 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 151 transition count 101
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 101 transition count 101
Applied a total of 50 rules in 2 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:10] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/151 places, 101/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2814 reset in 689 ms.
Product exploration explored 100000 steps with 2813 reset in 791 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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 (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-01 finished in 1983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!((!G(p0) U p1) U X(p0)))&&G(!p1))))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 101 transition count 101
Applied a total of 50 rules in 2 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:12] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:12] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:53:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:13] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/151 places, 101/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR p1 p0), (OR p0 p1), true, (OR p0 p1), p1]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 3 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-02 finished in 443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X(p1))))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 101 transition count 101
Applied a total of 50 rules in 1 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:13] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:13] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:13] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/151 places, 101/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33354 reset in 660 ms.
Product exploration explored 100000 steps with 33415 reset in 623 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 354 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), true, (NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 10 factoid took 157 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-03 finished in 2331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))||G(p1))))'
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Applied a total of 150 rules in 1 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:15] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/151 places, 51/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-04 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(p0))))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 101 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:15] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:53:15] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:15] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-20 21:53:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:16] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/151 places, 101/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s3...], 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 51 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-05 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (!(F(X(G(p1)))&&(p2 U p0))&&p3)))'
Support contains 101 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:16] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-20 21:53:16] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:16] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-20 21:53:16] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2022-05-20 21:53:16] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-20 21:53:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), true, (NOT p0), (NOT p1), (AND (NOT p1) p3 p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 p0) (AND p3 p2)), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s0 1), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 ...], 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 155 steps with 2 reset in 8 ms.
FORMULA Referendum-PT-0050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-06 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((p0 U X(p0))))))'
Support contains 50 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 101 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 6 ms. Remains 100 /151 variables (removed 51) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-20 21:53:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:16] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-20 21:53:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-20 21:53:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-20 21:53:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/151 places, 100/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/151 places, 100/101 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-07 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:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10080 reset in 489 ms.
Product exploration explored 100000 steps with 9983 reset in 474 ms.
Computed a total of 100 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 100 transition count 100
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 (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 100 rows 100 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-07 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 52 transition count 52
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 195 place count 5 transition count 5
Iterating global reduction 1 with 47 rules applied. Total rules applied 242 place count 5 transition count 5
Applied a total of 242 rules in 2 ms. Remains 5 /151 variables (removed 146) and now considering 5/101 (removed 96) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/151 places, 5/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/151 places, 5/101 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s3 0) (EQ s1 1)), p1:(AND (EQ s1 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-09 finished in 368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 2 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 98 output transitions
Drop transitions removed 98 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 4 ms. Remains 2 /151 variables (removed 149) and now considering 2/101 (removed 99) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2022-05-20 21:53:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/151 places, 2/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/151 places, 2/101 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 37 ms.
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 (NOT 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 47 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-11 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 53 transition count 53
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 193 place count 6 transition count 6
Iterating global reduction 1 with 47 rules applied. Total rules applied 240 place count 6 transition count 6
Applied a total of 240 rules in 2 ms. Remains 6 /151 variables (removed 145) and now considering 6/101 (removed 95) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/151 places, 6/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/151 places, 6/101 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s1 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]]
Product exploration explored 100000 steps with 50000 reset in 44 ms.
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-12 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((F(X(X(X(p0)))) U p1))||F(G(F(p2)))))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 9 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 92 output transitions
Drop transitions removed 92 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 9
Applied a total of 2 rules in 8 ms. Remains 9 /151 variables (removed 142) and now considering 9/101 (removed 92) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-20 21:53:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/151 places, 9/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/151 places, 9/101 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s0 0) (EQ s1 1)), p2:(OR (EQ s2 0) (EQ s3 1)), p0:(OR (EQ s0 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 21047 reset in 142 ms.
Product exploration explored 100000 steps with 21016 reset in 174 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 9
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) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 213 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-13 finished in 822 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 53 transition count 53
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 193 place count 6 transition count 6
Iterating global reduction 1 with 47 rules applied. Total rules applied 240 place count 6 transition count 6
Applied a total of 240 rules in 1 ms. Remains 6 /151 variables (removed 145) and now considering 6/101 (removed 95) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/151 places, 6/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/151 places, 6/101 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s0 0) (EQ s1 1) (OR (EQ s2 0) (EQ s2 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-0050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-15 finished in 112 ms.
All properties solved by simple procedures.
Total runtime 10766 ms.

BK_STOP 1653083600390

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572200419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0050.tgz
mv Referendum-PT-0050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;