Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415800477.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.9K May 5 16:51 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-0050-00
FORMULA_NAME Referendum-COL-0050-01
FORMULA_NAME Referendum-COL-0050-02
FORMULA_NAME Referendum-COL-0050-03
FORMULA_NAME Referendum-COL-0050-04
FORMULA_NAME Referendum-COL-0050-05
FORMULA_NAME Referendum-COL-0050-06
FORMULA_NAME Referendum-COL-0050-07
FORMULA_NAME Referendum-COL-0050-08
FORMULA_NAME Referendum-COL-0050-09
FORMULA_NAME Referendum-COL-0050-10
FORMULA_NAME Referendum-COL-0050-11
FORMULA_NAME Referendum-COL-0050-12
FORMULA_NAME Referendum-COL-0050-13
FORMULA_NAME Referendum-COL-0050-14
FORMULA_NAME Referendum-COL-0050-15

=== Now, execution of the tool begins

BK_START 1621258969018

Running Version 0
[2021-05-17 13:42:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 13:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:42:51] [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.
[2021-05-17 13:42:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:42:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 459 ms
[2021-05-17 13:42:52] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 151 PT places and 101.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 13:42:52] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:42:52] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3339960356854979783.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-17 13:42:52] [INFO ] Flatten gal took : 39 ms
[2021-05-17 13:42:52] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:42:52] [INFO ] Unfolded HLPN to a Petri net with 151 places and 101 transitions in 2 ms.
[2021-05-17 13:42:52] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_7345131763107684168.dot
[2021-05-17 13:42:52] [INFO ] Initial state test concluded for 1 properties.
FORMULA Referendum-COL-0050-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Applied a total of 150 rules in 7 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:52] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-17 13:42:52] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:52] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:52] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:52] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:42:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
[2021-05-17 13:42:53] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 13:42:53] [INFO ] Flatten gal took : 17 ms
FORMULA Referendum-COL-0050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:42:53] [INFO ] Flatten gal took : 8 ms
[2021-05-17 13:42:53] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 100000 steps, including 1923 resets, run finished after 577 ms. (steps per millisecond=173 ) properties (out of 7) seen :6
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-17 13:42:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:54] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-00 finished in 315 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:54] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:54] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-05-17 13:42:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:54] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, p0]
Running random walk in product with property : Referendum-COL-0050-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-01 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:54] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:54] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-17 13:42:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:54] [INFO ] Computed 0 place invariants in 18 ms
[2021-05-17 13:42:54] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 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-0050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LT s0 1), p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], 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 3775 reset in 418 ms.
Product exploration explored 100000 steps with 3755 reset in 265 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G (NOT p0))), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Referendum-COL-0050-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0050-03 finished in 1092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||(F(p0)&&G(F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:55] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:55] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:55] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 50 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-17 13:42:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:57] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-17 13:42:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Product exploration explored 100000 steps with 50000 reset in 389 ms.
[2021-05-17 13:42:58] [INFO ] Flatten gal took : 5 ms
[2021-05-17 13:42:58] [INFO ] Flatten gal took : 4 ms
[2021-05-17 13:42:58] [INFO ] Time to serialize gal into /tmp/LTL12154573499358802399.gal : 1 ms
[2021-05-17 13:42:58] [INFO ] Time to serialize properties into /tmp/LTL18164435397159050690.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12154573499358802399.gal, -t, CGAL, -LTL, /tmp/LTL18164435397159050690.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12154573499358802399.gal -t CGAL -LTL /tmp/LTL18164435397159050690.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_30>=1)||(voting_28>=1))||(voting_34>=1))||(voting_32>=1))||(voting_38>=1))||(voting_36>=1))||(voting_42>=1))||(voting_40>=1))||(voting_46>=1))||(voting_44>=1))||(voting_48>=1))||(voting_1>=1))||(voting_5>=1))||(voting_3>=1))||(voting_9>=1))||(voting_7>=1))||(voting_13>=1))||(voting_11>=1))||(voting_17>=1))||(voting_15>=1))||(voting_21>=1))||(voting_19>=1))||(voting_25>=1))||(voting_23>=1))||(voting_29>=1))||(voting_27>=1))||(voting_33>=1))||(voting_31>=1))||(voting_37>=1))||(voting_35>=1))||(voting_41>=1))||(voting_39>=1))||(voting_45>=1))||(voting_43>=1))||(voting_49>=1))||(voting_47>=1))||(voting_0>=1))||(voting_2>=1))||(voting_6>=1))||(voting_4>=1))||(voting_10>=1))||(voting_8>=1))||(voting_14>=1))||(voting_12>=1))||(voting_18>=1))||(voting_16>=1))||(voting_22>=1))||(voting_20>=1))||(voting_26>=1))||(voting_24>=1))")))||((F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_30>=1)||(voting_28>=1))||(voting_34>=1))||(voting_32>=1))||(voting_38>=1))||(voting_36>=1))||(voting_42>=1))||(voting_40>=1))||(voting_46>=1))||(voting_44>=1))||(voting_48>=1))||(voting_1>=1))||(voting_5>=1))||(voting_3>=1))||(voting_9>=1))||(voting_7>=1))||(voting_13>=1))||(voting_11>=1))||(voting_17>=1))||(voting_15>=1))||(voting_21>=1))||(voting_19>=1))||(voting_25>=1))||(voting_23>=1))||(voting_29>=1))||(voting_27>=1))||(voting_33>=1))||(voting_31>=1))||(voting_37>=1))||(voting_35>=1))||(voting_41>=1))||(voting_39>=1))||(voting_45>=1))||(voting_43>=1))||(voting_49>=1))||(voting_47>=1))||(voting_0>=1))||(voting_2>=1))||(voting_6>=1))||(voting_4>=1))||(voting_10>=1))||(voting_8>=1))||(voting_14>=1))||(voting_12>=1))||(voting_18>=1))||(voting_16>=1))||(voting_22>=1))||(voting_20>=1))||(voting_26>=1))||(voting_24>=1))"))&&(G(F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_30<1)&&(voting_28<1))&&(voting_34<1))&&(voting_32<1))&&(voting_38<1))&&(voting_36<1))&&(voting_42<1))&&(voting_40<1))&&(voting_46<1))&&(voting_44<1))&&(voting_48<1))&&(voting_1<1))&&(voting_5<1))&&(voting_3<1))&&(voting_9<1))&&(voting_7<1))&&(voting_13<1))&&(voting_11<1))&&(voting_17<1))&&(voting_15<1))&&(voting_21<1))&&(voting_19<1))&&(voting_25<1))&&(voting_23<1))&&(voting_29<1))&&(voting_27<1))&&(voting_33<1))&&(voting_31<1))&&(voting_37<1))&&(voting_35<1))&&(voting_41<1))&&(voting_39<1))&&(voting_45<1))&&(voting_43<1))&&(voting_49<1))&&(voting_47<1))&&(voting_0<1))&&(voting_2<1))&&(voting_6<1))&&(voting_4<1))&&(voting_10<1))&&(voting_8<1))&&(voting_14<1))&&(voting_12<1))&&(voting_18<1))&&(voting_16<1))&&(voting_22<1))&&(voting_20<1))&&(voting_26<1))&&(voting_24<1))")))))))
Formula 0 simplified : !X(GF"((((((((((((((((((((((((((((((((((((((((((((((((((voting_30>=1)||(voting_28>=1))||(voting_34>=1))||(voting_32>=1))||(voting_38>=1))||(voting_36>=1))||(voting_42>=1))||(voting_40>=1))||(voting_46>=1))||(voting_44>=1))||(voting_48>=1))||(voting_1>=1))||(voting_5>=1))||(voting_3>=1))||(voting_9>=1))||(voting_7>=1))||(voting_13>=1))||(voting_11>=1))||(voting_17>=1))||(voting_15>=1))||(voting_21>=1))||(voting_19>=1))||(voting_25>=1))||(voting_23>=1))||(voting_29>=1))||(voting_27>=1))||(voting_33>=1))||(voting_31>=1))||(voting_37>=1))||(voting_35>=1))||(voting_41>=1))||(voting_39>=1))||(voting_45>=1))||(voting_43>=1))||(voting_49>=1))||(voting_47>=1))||(voting_0>=1))||(voting_2>=1))||(voting_6>=1))||(voting_4>=1))||(voting_10>=1))||(voting_8>=1))||(voting_14>=1))||(voting_12>=1))||(voting_18>=1))||(voting_16>=1))||(voting_22>=1))||(voting_20>=1))||(voting_26>=1))||(voting_24>=1))" | (F"((((((((((((((((((((((((((((((((((((((((((((((((((voting_30>=1)||(voting_28>=1))||(voting_34>=1))||(voting_32>=1))||(voting_38>=1))||(voting_36>=1))||(voting_42>=1))||(voting_40>=1))||(voting_46>=1))||(voting_44>=1))||(voting_48>=1))||(voting_1>=1))||(voting_5>=1))||(voting_3>=1))||(voting_9>=1))||(voting_7>=1))||(voting_13>=1))||(voting_11>=1))||(voting_17>=1))||(voting_15>=1))||(voting_21>=1))||(voting_19>=1))||(voting_25>=1))||(voting_23>=1))||(voting_29>=1))||(voting_27>=1))||(voting_33>=1))||(voting_31>=1))||(voting_37>=1))||(voting_35>=1))||(voting_41>=1))||(voting_39>=1))||(voting_45>=1))||(voting_43>=1))||(voting_49>=1))||(voting_47>=1))||(voting_0>=1))||(voting_2>=1))||(voting_6>=1))||(voting_4>=1))||(voting_10>=1))||(voting_8>=1))||(voting_14>=1))||(voting_12>=1))||(voting_18>=1))||(voting_16>=1))||(voting_22>=1))||(voting_20>=1))||(voting_26>=1))||(voting_24>=1))" & GF"((((((((((((((((((((((((((((((((((((((((((((((((((voting_30<1)&&(voting_28<1))&&(voting_34<1))&&(voting_32<1))&&(voting_38<1))&&(voting_36<1))&&(voting_42<1))&&(voting_40<1))&&(voting_46<1))&&(voting_44<1))&&(voting_48<1))&&(voting_1<1))&&(voting_5<1))&&(voting_3<1))&&(voting_9<1))&&(voting_7<1))&&(voting_13<1))&&(voting_11<1))&&(voting_17<1))&&(voting_15<1))&&(voting_21<1))&&(voting_19<1))&&(voting_25<1))&&(voting_23<1))&&(voting_29<1))&&(voting_27<1))&&(voting_33<1))&&(voting_31<1))&&(voting_37<1))&&(voting_35<1))&&(voting_41<1))&&(voting_39<1))&&(voting_45<1))&&(voting_43<1))&&(voting_49<1))&&(voting_47<1))&&(voting_0<1))&&(voting_2<1))&&(voting_6<1))&&(voting_4<1))&&(voting_10<1))&&(voting_8<1))&&(voting_14<1))&&(voting_12<1))&&(voting_18<1))&&(voting_16<1))&&(voting_22<1))&&(voting_20<1))&&(voting_26<1))&&(voting_24<1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/50/51
Computing Next relation with stutter on 1 deadlock states
52 unique states visited
0 strongly connected components in search stack
52 transitions explored
52 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.15004,19660,1,0,212,13739,127,155,1512,15216,516
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0050-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-COL-0050-04 finished in 2961 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:58] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:58] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-17 13:42:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:58] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0050-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 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 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-05 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 2 transition count 2
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 2 transition count 2
Applied a total of 98 rules in 3 ms. Remains 2 /51 variables (removed 49) and now considering 2/51 (removed 49) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:58] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:58] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 13 ms
[2021-05-17 13:42:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, true, p0, true]
Running random walk in product with property : Referendum-COL-0050-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-06 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:58] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 13:42:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : Referendum-COL-0050-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 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 1923 reset in 393 ms.
Product exploration explored 100000 steps with 1923 reset in 340 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Referendum-COL-0050-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0050-08 finished in 995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(G(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:59] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-17 13:42:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:59] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 13:42:59] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-COL-0050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s31 1) (LT s29 1) (LT s35 1) (LT s33 1) (LT s39 1) (LT s37 1) (LT s43 1) (LT s41 1) (LT s47 1) (LT s45 1) (LT s49 1) (LT s2 1) (LT s6 1) (LT s4 1) (LT s10 1) (LT s8 1) (LT s14 1) (LT s12 1) (LT s18 1) (LT s16 1) (LT s22 1) (LT s20 1) (LT s26 1) (LT s24 1) (LT s30 1) (LT s28 1) (LT s34 1) (LT s32 1) (LT s38 1) (LT s36 1) (LT s42 1) (LT s40 1) (LT s46 1) (LT s44 1) (LT s50 1) (LT s48 1) (LT s1 1) (LT s3 1) (LT s7 1) (LT s5 1) (LT s11 1) (LT s9 1) (LT s15 1) (LT s13 1) (LT s19 1) (LT s17 1) (LT s23 1) (LT s21 1) (LT s27 1) (LT s25 1)), p0:(LT s0 1), p2:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3599 reset in 295 ms.
Product exploration explored 100000 steps with 3743 reset in 512 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), (F (G (NOT p2))), p1, (NOT p0), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-COL-0050-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0050-10 finished in 1225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0 U p1) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:43:01] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:43:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2021-05-17 13:43:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:43:01] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p1), true]
Running random walk in product with property : Referendum-COL-0050-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1)), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-11 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(X(G(p1)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:43:01] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:43:01] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:43:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0050-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (LT s31 1) (LT s29 1) (LT s35 1) (LT s33 1) (LT s39 1) (LT s37 1) (LT s43 1) (LT s41 1) (LT s47 1) (LT s45 1) (LT s49 1) (LT s2 1) (LT s6 1) (LT s4 1) (LT s10 1) (LT s8 1) (LT s14 1) (LT s12 1) (LT s18 1) (LT s16 1) (LT s22 1) (LT s20 1) (LT s26 1) (LT s24 1) (LT s30 1) (LT s28 1) (LT s34 1) (LT s32 1) (LT s38 1) (LT s36 1) (LT s42 1) (LT s40 1) (LT s46 1) (LT s44 1) (LT s50 1) (LT s48 1) (LT s1 1) (LT s3 1) (LT s7 1) (LT s5 1) (LT s11 1) (LT s9 1) (LT s15 1) (LT s13 1) (LT s19 1) (LT s17 1) (LT s23 1) (LT s21 1) (LT s27 1) (LT s25 1)), p1:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-12 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p1))||p0) U p1))], workingDir=/home/mcc/execution]
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:43:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:43:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:43:01] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:43:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Referendum-COL-0050-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1)), p0:(OR (GEQ s31 1) (GEQ s29 1) (GEQ s35 1) (GEQ s33 1) (GEQ s39 1) (GEQ s37 1) (GEQ s43 1) (GEQ s41 1) (GEQ s47 1) (GEQ s45 1) (GEQ s49 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s10 1) (GEQ s8 1) (GEQ s14 1) (GEQ s12 1) (GEQ s18 1) (GEQ s16 1) (GEQ s22 1) (GEQ s20 1) (GEQ s26 1) (GEQ s24 1) (GEQ s30 1) (GEQ s28 1) (GEQ s34 1) (GEQ s32 1) (GEQ s38 1) (GEQ s36 1) (GEQ s42 1) (GEQ s40 1) (GEQ s46 1) (GEQ s44 1) (GEQ s50 1) (GEQ s48 1) (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s5 1) (GEQ s11 1) (GEQ s9 1) (GEQ s15 1) (GEQ s13 1) (GEQ s19 1) (GEQ s17 1) (GEQ s23 1) (GEQ s21 1) (GEQ s27 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-13 finished in 139 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621258982268

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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