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-165281572200428.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-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 54K Apr 29 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 274K Apr 29 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 29 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 225K Apr 29 14:39 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 45K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 107K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 113K 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-0100-LTLFireability-00
FORMULA_NAME Referendum-PT-0100-LTLFireability-01
FORMULA_NAME Referendum-PT-0100-LTLFireability-02
FORMULA_NAME Referendum-PT-0100-LTLFireability-03
FORMULA_NAME Referendum-PT-0100-LTLFireability-04
FORMULA_NAME Referendum-PT-0100-LTLFireability-05
FORMULA_NAME Referendum-PT-0100-LTLFireability-06
FORMULA_NAME Referendum-PT-0100-LTLFireability-07
FORMULA_NAME Referendum-PT-0100-LTLFireability-08
FORMULA_NAME Referendum-PT-0100-LTLFireability-09
FORMULA_NAME Referendum-PT-0100-LTLFireability-10
FORMULA_NAME Referendum-PT-0100-LTLFireability-11
FORMULA_NAME Referendum-PT-0100-LTLFireability-12
FORMULA_NAME Referendum-PT-0100-LTLFireability-13
FORMULA_NAME Referendum-PT-0100-LTLFireability-14
FORMULA_NAME Referendum-PT-0100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083637534

Running Version 202205111006
[2022-05-20 21:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:53:58] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-20 21:53:58] [INFO ] Transformed 301 places.
[2022-05-20 21:53:58] [INFO ] Transformed 201 transitions.
[2022-05-20 21:53:58] [INFO ] Found NUPN structural information;
[2022-05-20 21:53:58] [INFO ] Parsed PT model containing 301 places and 201 transitions in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0100-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 101 transition count 101
Applied a total of 300 rules in 9 ms. Remains 101 /301 variables (removed 200) and now considering 101/201 (removed 100) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:59] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-20 21:53:59] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:59] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:53:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:59] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:53:59] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/301 places, 101/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/301 places, 101/201 transitions.
Support contains 101 out of 101 places after structural reductions.
[2022-05-20 21:53:59] [INFO ] Flatten gal took : 33 ms
[2022-05-20 21:53:59] [INFO ] Flatten gal took : 19 ms
[2022-05-20 21:53:59] [INFO ] Input system was already deterministic with 101 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 11 properties in 14 ms. (steps per millisecond=0 )
FORMULA Referendum-PT-0100-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(p0))&&F(p1)))))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:53:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:54:00] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), true]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-00 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:00] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:00] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-05-20 21:54:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:00] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], 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 716 ms.
Product exploration explored 100000 steps with 50000 reset in 637 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 : [(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 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-01 finished in 1812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0)&&p1))&&p2)))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:02] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-20 21:54:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:02] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s66 0) (EQ s5 0) (EQ s70 0) (EQ s9 0) (EQ s74 0) (EQ s13 0) (EQ s78 0) (EQ s17 0) (EQ s82 0) (EQ s21 0) (EQ s86 0) (EQ s25 0) (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-02 finished in 299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(X(p1)&&X((G(p0)||p2)))))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 0 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:02] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:02] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:54:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s1 0) (EQ s66 0) (EQ s5 0) (EQ s70 0) (EQ s9 0) (EQ s74 0) (EQ s13 0) (EQ s78 0) (EQ s17 0) (EQ s82 0) (EQ s21 0) (EQ s86 0) (EQ s25 0) (EQ s9...], 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 33333 reset in 682 ms.
Product exploration explored 100000 steps with 33333 reset in 603 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 p1 p2 (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (X p0)), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 4 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-03 finished in 1831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(X(X(G(!(p1 U p1)))))))||p0)))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:04] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:04] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, p1, (AND p1 (NOT p0)), p1, p1, p1]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-04 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:04] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-20 21:54:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:05] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], 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 107 steps with 3 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-05 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 2 transition count 2
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2 transition count 2
Applied a total of 198 rules in 6 ms. Remains 2 /101 variables (removed 99) and now considering 2/101 (removed 99) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/101 places, 2/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/101 places, 2/101 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-08 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:(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]]
Product exploration explored 100000 steps with 980 reset in 105 ms.
Product exploration explored 100000 steps with 980 reset in 134 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), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:54:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-20 21:54:06] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:54:06] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:06] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:06] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:06] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
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), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:54:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 21:54:07] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 21:54:07] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 980 reset in 61 ms.
Product exploration explored 100000 steps with 980 reset in 46 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
[2022-05-20 21:54:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/2 places, 1/2 transitions.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Built C files in :
/tmp/ltsmin7094872495435889270
[2022-05-20 21:54:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7094872495435889270
Running compilation step : cd /tmp/ltsmin7094872495435889270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin7094872495435889270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7094872495435889270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7226071468497319942.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA Referendum-PT-0100-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0100-LTLFireability-08 finished in 3111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 2 transition count 2
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2 transition count 2
Applied a total of 198 rules in 2 ms. Remains 2 /101 variables (removed 99) and now considering 2/101 (removed 99) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [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.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/101 places, 2/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/101 places, 2/101 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-09 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:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-09 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((G(p0) U p0)&&X(p1)))||G(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 4 transition count 4
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 4 transition count 4
Applied a total of 194 rules in 1 ms. Remains 4 /101 variables (removed 97) and now considering 4/101 (removed 97) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/101 places, 4/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/101 places, 4/101 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s3 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 2 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-11 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(F(G(G(p0))))))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Graph (complete) has 100 edges and 101 vertex of which 2 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.0 ms
Discarding 99 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /101 variables (removed 99) and now considering 2/101 (removed 99) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-20 21:54:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/101 places, 2/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/101 places, 2/101 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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 33333 reset in 46 ms.
Product exploration explored 100000 steps with 33333 reset in 62 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 : [p0, (X (NOT p0)), (X (X 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 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-12 finished in 326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(F(X(X((G(p0)&&p1))))))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Graph (complete) has 100 edges and 101 vertex of which 3 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.1 ms
Discarding 98 places :
Also discarding 98 output transitions
Drop transitions removed 98 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /101 variables (removed 98) and now considering 3/101 (removed 98) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:09] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-20 21:54:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:54:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:09] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/101 places, 3/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/101 places, 3/101 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1 0), p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25000 reset in 64 ms.
Product exploration explored 100000 steps with 25000 reset in 71 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 p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:54:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:10] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:54:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:10] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-20 21:54:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:54:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 3/3 transitions.
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 p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 65 ms.
Built C files in :
/tmp/ltsmin16668685283415377444
[2022-05-20 21:54:11] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-20 21:54:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:54:11] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-20 21:54:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:54:11] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-20 21:54:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:54:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16668685283415377444
Running compilation step : cd /tmp/ltsmin16668685283415377444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 60 ms.
Running link step : cd /tmp/ltsmin16668685283415377444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16668685283415377444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4924465319768254681.hoa' '--buchi-type=spotba'
LTSmin run took 41 ms.
FORMULA Referendum-PT-0100-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0100-LTLFireability-13 finished in 2732 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!X(F(p0)) U p0)&&F(p1)&&p0)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 2 transition count 2
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2 transition count 2
Applied a total of 198 rules in 2 ms. Remains 2 /101 variables (removed 99) and now considering 2/101 (removed 99) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:11] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/101 places, 2/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/101 places, 2/101 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s0 0), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, 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-0100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-15 finished in 191 ms.
All properties solved by simple procedures.
Total runtime 13213 ms.

BK_STOP 1653083652307

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-0100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0100, 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 r186-tajo-165281572200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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