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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 884K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 350K Apr 29 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 29 15:18 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 347K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 233K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 99K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 244K 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 1.2M 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-1000-LTLFireability-00
FORMULA_NAME Referendum-PT-1000-LTLFireability-01
FORMULA_NAME Referendum-PT-1000-LTLFireability-02
FORMULA_NAME Referendum-PT-1000-LTLFireability-03
FORMULA_NAME Referendum-PT-1000-LTLFireability-04
FORMULA_NAME Referendum-PT-1000-LTLFireability-05
FORMULA_NAME Referendum-PT-1000-LTLFireability-06
FORMULA_NAME Referendum-PT-1000-LTLFireability-07
FORMULA_NAME Referendum-PT-1000-LTLFireability-08
FORMULA_NAME Referendum-PT-1000-LTLFireability-09
FORMULA_NAME Referendum-PT-1000-LTLFireability-10
FORMULA_NAME Referendum-PT-1000-LTLFireability-11
FORMULA_NAME Referendum-PT-1000-LTLFireability-12
FORMULA_NAME Referendum-PT-1000-LTLFireability-13
FORMULA_NAME Referendum-PT-1000-LTLFireability-14
FORMULA_NAME Referendum-PT-1000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084113079

Running Version 202205111006
[2022-05-20 22:01:54] [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 22:01:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:01:54] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-05-20 22:01:54] [INFO ] Transformed 3001 places.
[2022-05-20 22:01:54] [INFO ] Transformed 2001 transitions.
[2022-05-20 22:01:54] [INFO ] Found NUPN structural information;
[2022-05-20 22:01:54] [INFO ] Parsed PT model containing 3001 places and 2001 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 128 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-PT-1000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 3000 place count 1001 transition count 1001
Applied a total of 3000 rules in 142 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:01:55] [INFO ] Computed 0 place invariants in 48 ms
[2022-05-20 22:01:55] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:01:55] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 22:01:56] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:01:56] [INFO ] Computed 0 place invariants in 15 ms
[2022-05-20 22:01:57] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/3001 places, 1001/2001 transitions.
Support contains 1001 out of 1001 places after structural reductions.
[2022-05-20 22:01:57] [INFO ] Flatten gal took : 444 ms
[2022-05-20 22:01:58] [INFO ] Flatten gal took : 195 ms
[2022-05-20 22:01:59] [INFO ] Input system was already deterministic with 1001 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:00] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:02:00] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Referendum-PT-1000-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(p0)))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 20 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:01] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:02:01] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:01] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:02:02] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2022-05-20 22:02:02] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:02] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:02:02] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-01 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 s276 0) (EQ s406 0) (EQ s796 0) (EQ s926 0) (EQ s536 0) (EQ s666 0) (EQ s65 0) (EQ s227 0) (EQ s487 0) (EQ s747 0) (EQ s357 0) (EQ s877 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 99 reset in 4509 ms.
Product exploration explored 100000 steps with 99 reset in 3881 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-01 finished in 10166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:11] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:02:11] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:11] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:02:12] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:12] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-20 22:02:12] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], 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 5025 ms.
Product exploration explored 100000 steps with 50000 reset in 5206 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
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 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-03 finished in 12376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(p0)))&&(X(p0) U F(p0)))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 22 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:23] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:02:24] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:24] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:02:24] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2022-05-20 22:02:24] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:24] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:02:25] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], 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 1003 steps with 1 reset in 43 ms.
FORMULA Referendum-PT-1000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-04 finished in 1472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||(F(p1)&&p1)))))'
Support contains 1001 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:25] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:02:25] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:25] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:02:26] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:26] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:02:26] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1001 steps with 0 reset in 40 ms.
FORMULA Referendum-PT-1000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-06 finished in 1289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((!(p0 U p1)||p2)))&&X(p0))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 3 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:26] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:02:26] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:26] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:02:27] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:02:27] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 22:02:27] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 99 reset in 3934 ms.
Product exploration explored 100000 steps with 99 reset in 4024 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
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) p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 12 factoid took 369 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-07 finished in 10607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(F(p0)))))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 2 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.2 ms
Discarding 999 places :
Also discarding 999 output transitions
Drop transitions removed 999 transitions
Applied a total of 1 rules in 8 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:02:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:37] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:02:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 22:02:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:02:37] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:02:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1001 places, 2/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1001 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-08 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 s1 0) (EQ s0 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 49 ms.
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (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 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-08 finished in 485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||F((G(p2)&&p3))))'
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 5 are kept as prefixes of interest. Removing 996 places using SCC suffix rule.4 ms
Discarding 996 places :
Also discarding 996 output transitions
Drop transitions removed 996 transitions
Applied a total of 1 rules in 9 ms. Remains 5 /1001 variables (removed 996) and now considering 5/1001 (removed 996) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:37] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:02:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-20 22:02:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1001 places, 5/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/1001 places, 5/1001 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1 1), p0:(EQ s0 1), p3:(OR (EQ s4 1) (EQ s2 1)), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 118 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 p1) p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p0 p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (AND p3 p2)), (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0) p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2))))]
Knowledge based reduction with 22 factoid took 1037 ms. Reduced automaton from 4 states, 12 edges and 4 AP to 4 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1666 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:39] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p0 p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (AND p3 p2)), (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (G (NOT (AND (NOT p1) p2 p3 p0))), (G (NOT (AND (NOT p1) p2 p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0) p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (AND p2 p3)), (F (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0)))), (F (AND (NOT p1) p2 p3 (NOT p0))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0)))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 24 factoid took 1411 ms. Reduced automaton from 4 states, 12 edges and 4 AP to 3 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (NOT p2)), (NOT p2)]
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 22:02:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-20 22:02:41] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 22:02:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:41] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 22:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:41] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 22:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-20 22:02:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 5/5 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X (AND p2 p3)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (OR (NOT p2) (NOT p3)))))]
Knowledge based reduction with 13 factoid took 755 ms. Reduced automaton from 3 states, 7 edges and 4 AP to 3 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (NOT p2)), (NOT p2)]
Finished random walk after 14 steps, including 2 resets, run visited all 6 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X (AND p2 p3)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (OR (NOT p2) (NOT p3))))), (F (AND p3 p2)), (F (NOT (OR (NOT p3) (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p1)))), (F (AND p3 (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 810 ms. Reduced automaton from 3 states, 7 edges and 4 AP to 3 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (NOT p2)), (NOT p2)]
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:43] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:02:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:43] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:02:43] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:02:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:43] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 22:02:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Built C files in :
/tmp/ltsmin17081280137275190989
[2022-05-20 22:02:44] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-20 22:02:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:02:44] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-20 22:02:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:02:44] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-20 22:02:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:02:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17081280137275190989
Running compilation step : cd /tmp/ltsmin17081280137275190989;'/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 211 ms.
Running link step : cd /tmp/ltsmin17081280137275190989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17081280137275190989;'/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/stateBased10686888900335872318.hoa' '--buchi-type=spotba'
LTSmin run took 1287 ms.
FORMULA Referendum-PT-1000-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-1000-LTLFireability-09 finished in 8019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U X(p0))||G(p1)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 999 places :
Symmetric choice reduction at 0 with 999 rule applications. Total rules 999 place count 2 transition count 2
Iterating global reduction 0 with 999 rules applied. Total rules applied 1998 place count 2 transition count 2
Applied a total of 1998 rules in 69 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:02:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:45] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:02:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:02:45] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:02:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/1001 places, 2/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1001 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s0 1), p1:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-10 finished in 304 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 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 14 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-20 22:02:46] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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 35 ms.
Product exploration explored 100000 steps with 50000 reset in 39 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 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-12 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1 U p2))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 3 are kept as prefixes of interest. Removing 998 places using SCC suffix rule.2 ms
Discarding 998 places :
Also discarding 998 output transitions
Drop transitions removed 998 transitions
Applied a total of 1 rules in 5 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 22:02:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s1 1), p0:(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, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-13 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F((((X(p0) U X(p0))||F(p1)) U X(p0))) U p1))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 15 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:02:46] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s0 1), p1:(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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 99 reset in 35 ms.
Product exploration explored 100000 steps with 99 reset in 45 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 247 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 272 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0, p0]
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-20 22:02:47] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:02:47] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in 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 22:02:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:47] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:47] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:47] [INFO ] Dead Transitions using invariants and state equation in 17 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 : [p0, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 86 ms :[true, p0, p0, p0]
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:02:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:48] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:02:48] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:02:48] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 93 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 99 reset in 31 ms.
Product exploration explored 100000 steps with 99 reset in 37 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 102 ms :[true, p0, p0, p0]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 2 edges and 3 vertex of which 1 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 0 ms. Remains 1 /3 variables (removed 2) and now considering 1/3 (removed 2) transitions.
[2022-05-20 22:02:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 22:02:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:02:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/3 places, 1/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/3 places, 1/3 transitions.
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Product exploration explored 100000 steps with 33333 reset in 83 ms.
Built C files in :
/tmp/ltsmin13461002979555771130
[2022-05-20 22:02:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13461002979555771130
Running compilation step : cd /tmp/ltsmin13461002979555771130;'/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 65 ms.
Running link step : cd /tmp/ltsmin13461002979555771130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13461002979555771130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2309598555930598382.hoa' '--buchi-type=spotba'
LTSmin run took 3377 ms.
FORMULA Referendum-PT-1000-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-1000-LTLFireability-15 finished in 5790 ms.
All properties solved by simple procedures.
Total runtime 58072 ms.

BK_STOP 1653084172814

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

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