About the Execution of ITS-Tools for Referendum-PT-0020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 409.647 | 10891.00 | 21757.00 | 69.10 | FTFFTFTTFFTFFTTF | normal |
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-165281572200412.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-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200412
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 32K Apr 29 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 210K Apr 29 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 14:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 29 14:51 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 13K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K 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 23K 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-0020-LTLFireability-00
FORMULA_NAME Referendum-PT-0020-LTLFireability-01
FORMULA_NAME Referendum-PT-0020-LTLFireability-02
FORMULA_NAME Referendum-PT-0020-LTLFireability-03
FORMULA_NAME Referendum-PT-0020-LTLFireability-04
FORMULA_NAME Referendum-PT-0020-LTLFireability-05
FORMULA_NAME Referendum-PT-0020-LTLFireability-06
FORMULA_NAME Referendum-PT-0020-LTLFireability-07
FORMULA_NAME Referendum-PT-0020-LTLFireability-08
FORMULA_NAME Referendum-PT-0020-LTLFireability-09
FORMULA_NAME Referendum-PT-0020-LTLFireability-10
FORMULA_NAME Referendum-PT-0020-LTLFireability-11
FORMULA_NAME Referendum-PT-0020-LTLFireability-12
FORMULA_NAME Referendum-PT-0020-LTLFireability-13
FORMULA_NAME Referendum-PT-0020-LTLFireability-14
FORMULA_NAME Referendum-PT-0020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653083557067
Running Version 202205111006
[2022-05-20 21:52:38] [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:52:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:52:38] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2022-05-20 21:52:38] [INFO ] Transformed 61 places.
[2022-05-20 21:52:38] [INFO ] Transformed 41 transitions.
[2022-05-20 21:52:38] [INFO ] Found NUPN structural information;
[2022-05-20 21:52:38] [INFO ] Parsed PT model containing 61 places and 41 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 21 transition count 21
Applied a total of 60 rules in 11 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:39] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:52:39] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:39] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/61 places, 21/41 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/61 places, 21/41 transitions.
Support contains 21 out of 21 places after structural reductions.
[2022-05-20 21:52:39] [INFO ] Flatten gal took : 14 ms
[2022-05-20 21:52:39] [INFO ] Flatten gal took : 9 ms
[2022-05-20 21:52:39] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 13 properties in 54 ms. (steps per millisecond=0 )
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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(F(p0))&&X(X((F(X(p1))&&p0)))))'
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:39] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:39] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-00 finished in 687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:40] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:40] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLFireability-01 finished in 780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X((p0 U p0))&&p1)))))'
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 9 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:41] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-20 21:52:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:41] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s0 1), p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-02 finished in 185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!X(!p0)) U (p1 U X(p1)))))'
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:41] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:41] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40005 reset in 351 ms.
Product exploration explored 100000 steps with 40063 reset in 256 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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) (NOT p0)), (X p1), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-PT-0020-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLFireability-03 finished in 1662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&F(p1)))))'
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:43] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:43] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-20 21:52:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s3 0) (EQ s2 0) (EQ s5 0) (EQ s4 0) (EQ s7 0) (EQ s6 0) (EQ s9 0) (EQ s8 0) (EQ s11 0) (EQ s10 0) (EQ s13 0) (EQ s12 0) (EQ s15 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4545 reset in 188 ms.
Product exploration explored 100000 steps with 4545 reset in 326 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0020-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLFireability-04 finished in 1089 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:44] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-20 21:52:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:44] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-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:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (E...], 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 21 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-05 finished in 195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(p0)))||G(X(X(p0)))))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 1 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /21 variables (removed 20) and now considering 1/21 (removed 20) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-20 21:52:44] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:44] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 21:52:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/21 places, 1/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/21 places, 1/21 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0020-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLFireability-06 finished in 511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(p0) U X(X(X(p0))))))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3 transition count 3
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3 transition count 3
Applied a total of 36 rules in 3 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 14 ms
[2022-05-20 21:52:44] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/21 places, 3/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/21 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p0, p0, p0, p0, p0]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 3 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-08 finished in 278 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 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3 transition count 3
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3 transition count 3
Applied a total of 36 rules in 1 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:52:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/21 places, 3/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/21 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-09 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:(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 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-09 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((G(p0)||X(p1)))))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3 transition count 3
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3 transition count 3
Applied a total of 36 rules in 5 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/21 places, 3/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/21 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s2 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-11 finished in 294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0)) U X(p1))||X(p2)))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3 transition count 3
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3 transition count 3
Applied a total of 36 rules in 1 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/21 places, 3/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/21 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s2 1), p2:(EQ s2 0), p1:(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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-12 finished in 234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3 transition count 3
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3 transition count 3
Applied a total of 36 rules in 1 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:52:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/21 places, 3/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/21 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 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 64 ms.
Product exploration explored 100000 steps with 50000 reset in 83 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 : [(NOT p0), (X p0), (F (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 150 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLFireability-13 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||p1) U p2))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5 transition count 5
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5 transition count 5
Applied a total of 32 rules in 1 ms. Remains 5 /21 variables (removed 16) and now considering 5/21 (removed 16) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:52:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:46] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:52:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:52:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/21 places, 5/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/21 places, 5/21 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s4 1) (EQ s3 1)), p1:(EQ s0 1), p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 95 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 (NOT p2) p1 p0), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) p1 p0)
Knowledge based reduction with 13 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLFireability-14 finished in 917 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 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2 transition count 2
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2 transition count 2
Applied a total of 38 rules in 2 ms. Remains 2 /21 variables (removed 19) and now considering 2/21 (removed 19) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:52:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:47] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:52:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:47] [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 2 rows 2 cols
[2022-05-20 21:52:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:52:47] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/21 places, 2/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/21 places, 2/21 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLFireability-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:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLFireability-15 finished in 176 ms.
All properties solved by simple procedures.
Total runtime 8881 ms.
BK_STOP 1653083567958
--------------------
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-0020"
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-0020, 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-165281572200412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0020.tgz
mv Referendum-PT-0020 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 '
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 ;