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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.7K 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-COL-0100-LTLCardinality-00
FORMULA_NAME Referendum-COL-0100-LTLCardinality-01
FORMULA_NAME Referendum-COL-0100-LTLCardinality-02
FORMULA_NAME Referendum-COL-0100-LTLCardinality-03
FORMULA_NAME Referendum-COL-0100-LTLCardinality-04
FORMULA_NAME Referendum-COL-0100-LTLCardinality-05
FORMULA_NAME Referendum-COL-0100-LTLCardinality-06
FORMULA_NAME Referendum-COL-0100-LTLCardinality-07
FORMULA_NAME Referendum-COL-0100-LTLCardinality-08
FORMULA_NAME Referendum-COL-0100-LTLCardinality-09
FORMULA_NAME Referendum-COL-0100-LTLCardinality-10
FORMULA_NAME Referendum-COL-0100-LTLCardinality-11
FORMULA_NAME Referendum-COL-0100-LTLCardinality-12
FORMULA_NAME Referendum-COL-0100-LTLCardinality-13
FORMULA_NAME Referendum-COL-0100-LTLCardinality-14
FORMULA_NAME Referendum-COL-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083095425

Running Version 202205111006
[2022-05-20 21:44:56] [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:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:44:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 21:44:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:44:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 536 ms
[2022-05-20 21:44:57] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 301 PT places and 201.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 21:44:57] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 6 ms.
[2022-05-20 21:44:57] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Referendum-COL-0100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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).
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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).
Finished random walk after 205 steps, including 1 resets, run visited all 17 properties in 15 ms. (steps per millisecond=13 )
[2022-05-20 21:44:57] [INFO ] Flatten gal took : 19 ms
[2022-05-20 21:44:57] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]]] introduces in Voters(100) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 100
[2022-05-20 21:44:57] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 9 ms.
[2022-05-20 21:44:57] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 4 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:57] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-20 21:44:57] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:57] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2022-05-20 21:44:57] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:57] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:57] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 205 steps, including 1 resets, run visited all 17 properties in 17 ms. (steps per millisecond=12 )
FORMULA Referendum-COL-0100-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(F(F(p0))))&&X(X(p1)))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:58] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s1 s0), p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 980 reset in 173 ms.
Product exploration explored 100000 steps with 980 reset in 90 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 514 steps, including 4 resets, run visited all 1 properties in 3 ms. (steps per millisecond=171 )
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 194 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 91 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:59] [INFO ] Dead Transitions using invariants and state equation in 67 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 : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 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 94 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 118 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 92 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-00 finished in 2276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(X(p0) U p0))||X(X(X(p1)))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:45:00] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:00] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-20 21:45:00] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:45:00] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={0} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 5}, { cond=p0, acceptance={0} source=8 dest: 8}]], initial=6, aps=[p0:(LEQ 3 s1), p1:(OR (GT 3 s1) (GT s3 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (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 (NOT p0))
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 9 states, 14 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLCardinality-01 finished in 976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U F(!(F(G(F(p0))) U G(p1)))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:45:01] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:45:01] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-05-20 21:45:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:45:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s3 s1), p0:(LEQ 1 s2)], nbAcceptance=1, 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 101 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-02 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(p0 U p1)&&p2))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:45:01] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:45:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:45:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LEQ s3 s0) (GT s0 s1)), p1:(AND (OR (LEQ s2 s1) (LEQ 1 s1)) (LEQ s2 s1)), p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 190 steps with 13 reset in 4 ms.
FORMULA Referendum-COL-0100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-03 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1))&&F(X(F(X(p0))))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:45:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:01] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:45:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:01] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:45:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:45:02] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT 3 s0), p1:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-05 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(p1))||p0))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:45:02] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:45:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-20 21:45:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:45:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:45:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s2 s0), p0:(OR (LEQ 1 s1) (LEQ s0 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2632 reset in 141 ms.
Product exploration explored 100000 steps with 2676 reset in 125 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLCardinality-08 finished in 593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&p1))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:45:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:02] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:45:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:45:02] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:45:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s1 s2), p0:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 308 steps with 3 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-09 finished in 309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:03] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 21:45:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:45:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s1)], 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 990 reset in 198 ms.
Product exploration explored 100000 steps with 990 reset in 205 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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 611 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=305 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:04] [INFO ] Computed 0 place invariants in 0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-COL-0100-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLCardinality-10 finished in 1224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 3 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:04] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:45:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 21:45:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:45:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:45:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s0)], 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 980 reset in 46 ms.
Product exploration explored 100000 steps with 980 reset in 61 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (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 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0100-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLCardinality-12 finished in 380 ms.
All properties solved by simple procedures.
Total runtime 7889 ms.

BK_STOP 1653083105143

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

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