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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 422K Apr 29 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 29 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 29 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 29 15:58 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.1M May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 253K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 106K 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 571K 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-0500-LTLCardinality-00
FORMULA_NAME Referendum-PT-0500-LTLCardinality-01
FORMULA_NAME Referendum-PT-0500-LTLCardinality-02
FORMULA_NAME Referendum-PT-0500-LTLCardinality-03
FORMULA_NAME Referendum-PT-0500-LTLCardinality-04
FORMULA_NAME Referendum-PT-0500-LTLCardinality-05
FORMULA_NAME Referendum-PT-0500-LTLCardinality-06
FORMULA_NAME Referendum-PT-0500-LTLCardinality-07
FORMULA_NAME Referendum-PT-0500-LTLCardinality-08
FORMULA_NAME Referendum-PT-0500-LTLCardinality-09
FORMULA_NAME Referendum-PT-0500-LTLCardinality-10
FORMULA_NAME Referendum-PT-0500-LTLCardinality-11
FORMULA_NAME Referendum-PT-0500-LTLCardinality-12
FORMULA_NAME Referendum-PT-0500-LTLCardinality-13
FORMULA_NAME Referendum-PT-0500-LTLCardinality-14
FORMULA_NAME Referendum-PT-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083935429

Running Version 202205111006
[2022-05-20 21:58:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:58:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:58:57] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2022-05-20 21:58:57] [INFO ] Transformed 1501 places.
[2022-05-20 21:58:57] [INFO ] Transformed 1001 transitions.
[2022-05-20 21:58:57] [INFO ] Found NUPN structural information;
[2022-05-20 21:58:57] [INFO ] Parsed PT model containing 1501 places and 1001 transitions in 393 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 194 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 47 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:58:58] [INFO ] Computed 500 place invariants in 77 ms
[2022-05-20 21:58:59] [INFO ] Implicit Places using invariants in 716 ms returned []
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:58:59] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-20 21:59:00] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:00] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-20 21:59:01] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1501/1501 places, 1001/1001 transitions.
Support contains 1501 out of 1501 places after structural reductions.
[2022-05-20 21:59:01] [INFO ] Flatten gal took : 280 ms
[2022-05-20 21:59:01] [INFO ] Flatten gal took : 159 ms
[2022-05-20 21:59:02] [INFO ] Input system was already deterministic with 1001 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 832 ms. (steps per millisecond=12 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:03] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-20 21:59:04] [INFO ] After 475ms 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-0500-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1501 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1501 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((F(!(p0 U p1))&&!p1))||G(p2)))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 63 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:04] [INFO ] Computed 500 place invariants in 3 ms
[2022-05-20 21:59:05] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:05] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-20 21:59:06] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2022-05-20 21:59:06] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:06] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-20 21:59:07] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 458 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA Referendum-PT-0500-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-01 finished in 3073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(X(p0)))))'
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 1001 transition count 1001
Applied a total of 500 rules in 115 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 21:59:07] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:59:08] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 21:59:08] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:59:08] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 21:59:08] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-20 21:59:09] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6252 ms.
Product exploration explored 100000 steps with 33333 reset in 5318 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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-02 finished in 14369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((G(p0)||p1)))&&F(!p0))))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 1001 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.7 ms
Discarding 500 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 21:59:22] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:59:22] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 21:59:22] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:59:22] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2022-05-20 21:59:22] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 21:59:22] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:59:23] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s5...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 133 ms.
FORMULA Referendum-PT-0500-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-03 finished in 1712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((F(X((p0 U F(p1))))||p1)))))'
Support contains 500 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 1001 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.5 ms
Discarding 500 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 116 ms. Remains 1000 /1501 variables (removed 501) and now considering 1000/1001 (removed 1) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-20 21:59:23] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:59:24] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-20 21:59:24] [INFO ] Computed 0 place invariants in 14 ms
[2022-05-20 21:59:24] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2022-05-20 21:59:24] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-20 21:59:24] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:59:25] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1501 places, 1000/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1501 places, 1000/1001 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 596 reset in 5350 ms.
Product exploration explored 100000 steps with 606 reset in 5142 ms.
Computed a total of 1000 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1000 transition count 1000
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 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 337 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 323 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-20 21:59:46] [INFO ] Computed 0 place invariants in 2 ms
Proved EG (NOT p1)
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-04 finished in 24495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(p0)))&&G(X(p1))))'
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Applied a total of 1500 rules in 62 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:48] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:48] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:49] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/1501 places, 501/1001 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s0 1), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-05 finished in 1017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&p1))||F(X(p2))))'
Support contains 1000 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 25 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:49] [INFO ] Computed 500 place invariants in 4 ms
[2022-05-20 21:59:49] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:49] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-20 21:59:55] [INFO ] Implicit Places using invariants and state equation in 5369 ms returned []
Implicit Place search using SMT with State Equation took 5816 ms to find 0 implicit places.
// Phase 1: matrix 1001 rows 1501 cols
[2022-05-20 21:59:55] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-20 21:59:56] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4780 ms.
Product exploration explored 100000 steps with 50000 reset in 4794 ms.
Computed a total of 1501 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1501 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 10 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-06 finished in 17481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F((p0&&(F(X(X(p2)))||p1)))))))'
Support contains 6 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 9 are kept as prefixes of interest. Removing 1492 places using SCC suffix rule.2 ms
Discarding 1492 places :
Also discarding 990 output transitions
Drop transitions removed 990 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 9 transition count 9
Applied a total of 4 rules in 23 ms. Remains 9 /1501 variables (removed 1492) and now considering 9/1001 (removed 992) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:00:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:06] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:00:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-20 22:00:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:00:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:06] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/1501 places, 9/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/1501 places, 9/1001 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s3 1)), p1:(OR (EQ s7 0) (EQ s1 1)), p2:(OR (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 18181 reset in 145 ms.
Product exploration explored 100000 steps with 18182 reset in 94 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 767 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-08 finished in 1503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(G(p0))))))'
Support contains 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 3 are kept as prefixes of interest. Removing 1498 places using SCC suffix rule.2 ms
Discarding 1498 places :
Also discarding 998 output transitions
Drop transitions removed 998 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 6 ms. Remains 3 /1501 variables (removed 1498) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:00:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:00:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:00:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-20 22:00:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 22:00:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1501 places, 3/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1501 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-09 finished in 168 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(X(X(G(p0))))))))'
Support contains 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 2 are kept as prefixes of interest. Removing 1499 places using SCC suffix rule.2 ms
Discarding 1499 places :
Also discarding 998 output transitions
Drop transitions removed 998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 5 ms. Remains 2 /1501 variables (removed 1499) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:00:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:08] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:00:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-20 22:00:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:00:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1501 places, 2/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1501 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s0 1))], 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 67 ms.
Product exploration explored 100000 steps with 33333 reset in 203 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 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-13 finished in 652 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X(p0)) U p1))))'
Support contains 5 out of 1501 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 997 places and 0 transitions.
Ensure Unique test removed 497 transitions
Reduce isomorphic transitions removed 497 transitions.
Iterating post reduction 0 with 1494 rules applied. Total rules applied 1494 place count 504 transition count 504
Discarding 493 places :
Symmetric choice reduction at 1 with 493 rule applications. Total rules 1987 place count 11 transition count 11
Iterating global reduction 1 with 493 rules applied. Total rules applied 2480 place count 11 transition count 11
Applied a total of 2480 rules in 69 ms. Remains 11 /1501 variables (removed 1490) and now considering 11/1001 (removed 990) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:00:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:09] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:00:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:09] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:00:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/1501 places, 11/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/1501 places, 11/1001 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s6 1) (OR (EQ s0 0) (EQ s5 1)) (OR (EQ s2 0) (EQ s10 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 158 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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 p1), (X p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-14 finished in 782 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 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Discarding 499 places :
Symmetric choice reduction at 1 with 499 rule applications. Total rules 1999 place count 2 transition count 2
Iterating global reduction 1 with 499 rules applied. Total rules applied 2498 place count 2 transition count 2
Applied a total of 2498 rules in 13 ms. Remains 2 /1501 variables (removed 1499) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:00:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:00:09] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:00:09] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:00:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 22:00:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:00:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/1501 places, 2/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1501 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-15 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 s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0500-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-15 finished in 275 ms.
All properties solved by simple procedures.
Total runtime 72696 ms.

BK_STOP 1653084010559

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0500.tgz
mv Referendum-PT-0500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;