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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 36K Apr 29 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 29 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 29 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 172K Apr 29 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 57K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0050-LTLFireability-00
FORMULA_NAME Referendum-PT-0050-LTLFireability-01
FORMULA_NAME Referendum-PT-0050-LTLFireability-02
FORMULA_NAME Referendum-PT-0050-LTLFireability-03
FORMULA_NAME Referendum-PT-0050-LTLFireability-04
FORMULA_NAME Referendum-PT-0050-LTLFireability-05
FORMULA_NAME Referendum-PT-0050-LTLFireability-06
FORMULA_NAME Referendum-PT-0050-LTLFireability-07
FORMULA_NAME Referendum-PT-0050-LTLFireability-08
FORMULA_NAME Referendum-PT-0050-LTLFireability-09
FORMULA_NAME Referendum-PT-0050-LTLFireability-10
FORMULA_NAME Referendum-PT-0050-LTLFireability-11
FORMULA_NAME Referendum-PT-0050-LTLFireability-12
FORMULA_NAME Referendum-PT-0050-LTLFireability-13
FORMULA_NAME Referendum-PT-0050-LTLFireability-14
FORMULA_NAME Referendum-PT-0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083595376

Running Version 202205111006
[2022-05-20 21:53:16] [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:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:53:16] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-20 21:53:16] [INFO ] Transformed 151 places.
[2022-05-20 21:53:16] [INFO ] Transformed 101 transitions.
[2022-05-20 21:53:16] [INFO ] Found NUPN structural information;
[2022-05-20 21:53:16] [INFO ] Parsed PT model containing 151 places and 101 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Referendum-PT-0050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Applied a total of 150 rules in 21 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:17] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 21:53:17] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:17] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:53:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:17] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/151 places, 51/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
Support contains 51 out of 51 places after structural reductions.
[2022-05-20 21:53:17] [INFO ] Flatten gal took : 26 ms
[2022-05-20 21:53:17] [INFO ] Flatten gal took : 9 ms
[2022-05-20 21:53:17] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:17] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:53:17] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0050-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
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' '!(F(p0))'
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-05-20 21:53:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4...], 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 573 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-00 finished in 1510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G(!G(X((F(p0)||X((p0 U p0))))))) U p0))'
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-20 21:53:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-02 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-06 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:(OR (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4...], 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 51 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-06 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U G(((G(X(p1))||F(p1)) U X(p2)))))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 4 transition count 4
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 4 transition count 4
Applied a total of 94 rules in 4 ms. Remains 4 /51 variables (removed 47) and now considering 4/51 (removed 47) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:19] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/51 places, 4/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/51 places, 4/51 transitions.
Stuttering acceptance computed with spot in 557 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 3}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s3 1), p2:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 92 steps with 9 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-08 finished in 647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(p1)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 3 transition count 3
Applied a total of 96 rules in 2 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:20] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/51 places, 3/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 85 ms :[p1, p1, true]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s0 1) (EQ s2 1)), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-0050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-09 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F((G(p0) U p0)))&&F(!(p0 U p0))))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 1 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /51 variables (removed 50) and now considering 1/51 (removed 50) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:53:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:20] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:53:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-20 21:53:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:53:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/51 places, 1/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/51 places, 1/51 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, p0, (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 177 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 : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-11 finished in 561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 3 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:21] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:21] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:53:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-20 21:53:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/51 places, 3/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-12 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:(AND (EQ s2 1) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-12 finished in 144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F((X(G(F(p0)))&&p1))))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 3 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-20 21:53:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:21] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/51 places, 3/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2 0), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 27276 reset in 146 ms.
Product exploration explored 100000 steps with 27261 reset in 172 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), (X (NOT p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-13 finished in 751 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 2 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.0 ms
Discarding 49 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /51 variables (removed 49) and now considering 2/51 (removed 49) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:53:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:22] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:53:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-05-20 21:53:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:53:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 2/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-14 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 119 ms.
Product exploration explored 100000 steps with 33333 reset in 57 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 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-14 finished in 529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p0)&&p1))) U (G(p0)||F(p2))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 3 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:22] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-20 21:53:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:22] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/51 places, 3/51 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 1), p2:(EQ s2 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 531 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 6 steps, including 1 resets, run visited all 5 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 917 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:53:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:53:25] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 21:53:25] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 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 1 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:53:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:25] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-20 21:53:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:53:25] [INFO ] Dead Transitions using invariants and state equation in 21 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 (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 520 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 637 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:53:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:53:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:53:26] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:53:26] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Built C files in :
/tmp/ltsmin2701890973149621209
[2022-05-20 21:53:27] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-20 21:53:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:53:27] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-20 21:53:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:53:27] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-20 21:53:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:53:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2701890973149621209
Running compilation step : cd /tmp/ltsmin2701890973149621209;'/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 220 ms.
Running link step : cd /tmp/ltsmin2701890973149621209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin2701890973149621209;'/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/stateBased9092270649843113833.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA Referendum-PT-0050-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0050-LTLFireability-15 finished in 4885 ms.
All properties solved by simple procedures.
Total runtime 10989 ms.

BK_STOP 1653083608028

--------------------
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-0050"
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-0050, 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-165281572200420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0050.tgz
mv Referendum-PT-0050 execution
cd execution
if [ "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 ;