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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 574K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 266K 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 23K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 27 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 27 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K 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-PT-0050-00
FORMULA_NAME Referendum-PT-0050-01
FORMULA_NAME Referendum-PT-0050-02
FORMULA_NAME Referendum-PT-0050-03
FORMULA_NAME Referendum-PT-0050-04
FORMULA_NAME Referendum-PT-0050-05
FORMULA_NAME Referendum-PT-0050-06
FORMULA_NAME Referendum-PT-0050-07
FORMULA_NAME Referendum-PT-0050-08
FORMULA_NAME Referendum-PT-0050-09
FORMULA_NAME Referendum-PT-0050-10
FORMULA_NAME Referendum-PT-0050-11
FORMULA_NAME Referendum-PT-0050-12
FORMULA_NAME Referendum-PT-0050-13
FORMULA_NAME Referendum-PT-0050-14
FORMULA_NAME Referendum-PT-0050-15

=== Now, execution of the tool begins

BK_START 1621260603759

Running Version 0
[2021-05-17 14:10:05] [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 14:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:10:05] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2021-05-17 14:10:05] [INFO ] Transformed 151 places.
[2021-05-17 14:10:05] [INFO ] Transformed 101 transitions.
[2021-05-17 14:10:05] [INFO ] Found NUPN structural information;
[2021-05-17 14:10:05] [INFO ] Parsed PT model containing 151 places and 101 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:10:05] [INFO ] Initial state test concluded for 3 properties.
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 11 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 14:10:05] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 14:10:05] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:05] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:10:05] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:05] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:10:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
[2021-05-17 14:10:06] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-17 14:10:06] [INFO ] Flatten gal took : 26 ms
FORMULA Referendum-PT-0050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:10:06] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:10:06] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 100000 steps, including 1923 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 10) seen :9
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:06] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 14:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:10:06] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2021-05-17 14:10:06] [INFO ] Initial state test concluded for 1 properties.
FORMULA Referendum-PT-0050-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 5 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 14:10:06] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:10:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:06] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 14:10:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 14:10:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:06] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-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 (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4 1) (EQ s10 1) (EQ s8 1) (EQ s14 1) (EQ s12 1) (EQ s18 1) (EQ s16 1) (EQ s22 1) (EQ s20 1) (EQ s26 1) (EQ s24 1) (EQ s30 1) (EQ s28 1) (EQ s34 1) (EQ s32 1) (EQ s38 1) (EQ s36 1) (EQ s42 1) (EQ s40 1) (EQ s46 1) (EQ s44 1) (EQ s50 1) (EQ s48 1) (EQ s1 1) (EQ s3 1) (EQ s7 1) (EQ s5 1) (EQ s11 1) (EQ s9 1) (EQ s15 1) (EQ s13 1) (EQ s19 1) (EQ s17 1) (EQ s23 1) (EQ s21 1) (EQ s27 1) (EQ 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-PT-0050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-00 finished in 353 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 2 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 14:10:06] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:06] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:10:06] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-05-17 14:10:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:06] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:07] [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 34 ms :[true, p0]
Running random walk in product with property : Referendum-PT-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 (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4 1) (EQ s10 1) (EQ s8 1) (EQ s14 1) (EQ s12 1) (EQ s18 1) (EQ s16 1) (EQ s22 1) (EQ s20 1) (EQ s26 1) (EQ s24 1) (EQ s30 1) (EQ s28 1) (EQ s34 1) (EQ s32 1) (EQ s38 1) (EQ s36 1) (EQ s42 1) (EQ s40 1) (EQ s46 1) (EQ s44 1) (EQ s50 1) (EQ s48 1) (EQ s1 1) (EQ s3 1) (EQ s7 1) (EQ s5 1) (EQ s11 1) (EQ s9 1) (EQ s15 1) (EQ s13 1) (EQ s19 1) (EQ s17 1) (EQ s23 1) (EQ s21 1) (EQ s27 1) (EQ 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-PT-0050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-01 finished in 202 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 2 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 14:10:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:07] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:07] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-17 14:10:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:07] [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 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-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:(NEQ s0 1), p0:(OR (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4 1) (EQ s10 1) (EQ s8 1) (EQ s14 1) (EQ s12 1) (EQ s18 1) (EQ s16 1) (EQ s22 1) (EQ s20 1) (EQ s26 1) (EQ s24 1) (EQ s30 1) (EQ s28 1) (EQ s34 1) (EQ s32 1) (EQ s38 1) (EQ s36 1) (EQ s42 1) (EQ s40 1) (EQ s46 1) (EQ s44 1) (EQ s50 1) (EQ s48 1) (EQ s1 1) (EQ s3 1) (EQ s7 1) (EQ s5 1) (EQ s11 1) (EQ s9 1) (EQ s15 1) (EQ s13 1) (EQ s19 1) (EQ s17 1) (EQ s23 1) (EQ s21 1) (EQ s27 1) (EQ 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 3711 reset in 335 ms.
Product exploration explored 100000 steps with 3675 reset in 315 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-PT-0050-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0050-03 finished in 908 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 14:10:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:07] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-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 (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4 1) (EQ s10 1) (EQ s8 1) (EQ s14 1) (EQ s12 1) (EQ s18 1) (EQ s16 1) (EQ s22 1) (EQ s20 1) (EQ s26 1) (EQ s24 1) (EQ s30 1) (EQ s28 1) (EQ s34 1) (EQ s32 1) (EQ s38 1) (EQ s36 1) (EQ s42 1) (EQ s40 1) (EQ s46 1) (EQ s44 1) (EQ s50 1) (EQ s48 1) (EQ s1 1) (EQ s3 1) (EQ s7 1) (EQ s5 1) (EQ s11 1) (EQ s9 1) (EQ s15 1) (EQ s13 1) (EQ s19 1) (EQ s17 1) (EQ s23 1) (EQ s21 1) (EQ s27 1) (EQ 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 277 ms.
Product exploration explored 100000 steps with 50000 reset in 245 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 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 61 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 14:10:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:09] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-17 14:10:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Product exploration explored 100000 steps with 50000 reset in 448 ms.
[2021-05-17 14:10:10] [INFO ] Flatten gal took : 6 ms
[2021-05-17 14:10:10] [INFO ] Flatten gal took : 16 ms
[2021-05-17 14:10:10] [INFO ] Time to serialize gal into /tmp/LTL1226484108895593869.gal : 9 ms
[2021-05-17 14:10:10] [INFO ] Time to serialize properties into /tmp/LTL11204396586139673016.ltl : 5 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/LTL1226484108895593869.gal, -t, CGAL, -LTL, /tmp/LTL11204396586139673016.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/LTL1226484108895593869.gal -t CGAL -LTL /tmp/LTL11204396586139673016.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_31==1)||(voting_29==1))||(voting_35==1))||(voting_33==1))||(voting_39==1))||(voting_37==1))||(voting_43==1))||(voting_41==1))||(voting_47==1))||(voting_45==1))||(voting_49==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))||(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_50==1))||(voting_48==1))||(voting_1==1))||(voting_3==1))||(voting_7==1))||(voting_5==1))||(voting_11==1))||(voting_9==1))||(voting_15==1))||(voting_13==1))||(voting_19==1))||(voting_17==1))||(voting_23==1))||(voting_21==1))||(voting_27==1))||(voting_25==1))")))||((F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_31==1)||(voting_29==1))||(voting_35==1))||(voting_33==1))||(voting_39==1))||(voting_37==1))||(voting_43==1))||(voting_41==1))||(voting_47==1))||(voting_45==1))||(voting_49==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))||(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_50==1))||(voting_48==1))||(voting_1==1))||(voting_3==1))||(voting_7==1))||(voting_5==1))||(voting_11==1))||(voting_9==1))||(voting_15==1))||(voting_13==1))||(voting_19==1))||(voting_17==1))||(voting_23==1))||(voting_21==1))||(voting_27==1))||(voting_25==1))"))&&(G(F("((((((((((((((((((((((((((((((((((((((((((((((((((voting_31==0)&&(voting_29==0))&&(voting_35==0))&&(voting_33==0))&&(voting_39==0))&&(voting_37==0))&&(voting_43==0))&&(voting_41==0))&&(voting_47==0))&&(voting_45==0))&&(voting_49==0))&&(voting_2==0))&&(voting_6==0))&&(voting_4==0))&&(voting_10==0))&&(voting_8==0))&&(voting_14==0))&&(voting_12==0))&&(voting_18==0))&&(voting_16==0))&&(voting_22==0))&&(voting_20==0))&&(voting_26==0))&&(voting_24==0))&&(voting_30==0))&&(voting_28==0))&&(voting_34==0))&&(voting_32==0))&&(voting_38==0))&&(voting_36==0))&&(voting_42==0))&&(voting_40==0))&&(voting_46==0))&&(voting_44==0))&&(voting_50==0))&&(voting_48==0))&&(voting_1==0))&&(voting_3==0))&&(voting_7==0))&&(voting_5==0))&&(voting_11==0))&&(voting_9==0))&&(voting_15==0))&&(voting_13==0))&&(voting_19==0))&&(voting_17==0))&&(voting_23==0))&&(voting_21==0))&&(voting_27==0))&&(voting_25==0))")))))))
Formula 0 simplified : !X(GF"((((((((((((((((((((((((((((((((((((((((((((((((((voting_31==1)||(voting_29==1))||(voting_35==1))||(voting_33==1))||(voting_39==1))||(voting_37==1))||(voting_43==1))||(voting_41==1))||(voting_47==1))||(voting_45==1))||(voting_49==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))||(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_50==1))||(voting_48==1))||(voting_1==1))||(voting_3==1))||(voting_7==1))||(voting_5==1))||(voting_11==1))||(voting_9==1))||(voting_15==1))||(voting_13==1))||(voting_19==1))||(voting_17==1))||(voting_23==1))||(voting_21==1))||(voting_27==1))||(voting_25==1))" | (F"((((((((((((((((((((((((((((((((((((((((((((((((((voting_31==1)||(voting_29==1))||(voting_35==1))||(voting_33==1))||(voting_39==1))||(voting_37==1))||(voting_43==1))||(voting_41==1))||(voting_47==1))||(voting_45==1))||(voting_49==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))||(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_50==1))||(voting_48==1))||(voting_1==1))||(voting_3==1))||(voting_7==1))||(voting_5==1))||(voting_11==1))||(voting_9==1))||(voting_15==1))||(voting_13==1))||(voting_19==1))||(voting_17==1))||(voting_23==1))||(voting_21==1))||(voting_27==1))||(voting_25==1))" & GF"((((((((((((((((((((((((((((((((((((((((((((((((((voting_31==0)&&(voting_29==0))&&(voting_35==0))&&(voting_33==0))&&(voting_39==0))&&(voting_37==0))&&(voting_43==0))&&(voting_41==0))&&(voting_47==0))&&(voting_45==0))&&(voting_49==0))&&(voting_2==0))&&(voting_6==0))&&(voting_4==0))&&(voting_10==0))&&(voting_8==0))&&(voting_14==0))&&(voting_12==0))&&(voting_18==0))&&(voting_16==0))&&(voting_22==0))&&(voting_20==0))&&(voting_26==0))&&(voting_24==0))&&(voting_30==0))&&(voting_28==0))&&(voting_34==0))&&(voting_32==0))&&(voting_38==0))&&(voting_36==0))&&(voting_42==0))&&(voting_40==0))&&(voting_46==0))&&(voting_44==0))&&(voting_50==0))&&(voting_48==0))&&(voting_1==0))&&(voting_3==0))&&(voting_7==0))&&(voting_5==0))&&(voting_11==0))&&(voting_9==0))&&(voting_15==0))&&(voting_13==0))&&(voting_19==0))&&(voting_17==0))&&(voting_23==0))&&(voting_21==0))&&(voting_27==0))&&(voting_25==0))"))
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.123294,19452,1,0,212,11194,129,155,1663,13644,516
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0050-04 finished in 2864 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(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 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 14:10:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:10] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:10] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2021-05-17 14:10:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 14:10:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-05 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s31 1) (EQ s29 1) (EQ s35 1) (EQ s33 1) (EQ s39 1) (EQ s37 1) (EQ s43 1) (EQ s41 1) (EQ s47 1) (EQ s45 1) (EQ s49 1) (EQ s2 1) (EQ s6 1) (EQ s4 1) (EQ s10 1) (EQ s8 1) (EQ s14 1) (EQ s12 1) (EQ s18 1) (EQ s16 1) (EQ s22 1) (EQ s20 1) (EQ s26 1) (EQ s24 1) (EQ s30 1) (EQ s28 1) (EQ s34 1) (EQ s32 1) (EQ s38 1) (EQ s36 1) (EQ s42 1) (EQ s40 1) (EQ s46 1) (EQ s44 1) (EQ s50 1) (EQ s48 1) (EQ s1 1) (EQ s3 1) (EQ s7 1) (EQ s5 1) (EQ s11 1) (EQ s9 1) (EQ s15 1) (EQ s13 1) (EQ s19 1) (EQ s17 1) (EQ s23 1) (EQ s21 1) (EQ s27 1) (EQ s25 1)), p1:(OR (NEQ s31 0) (NEQ s29 0) (NEQ s35 0) (NEQ s33 0) (NEQ s39 0) (NEQ s37 0) (NEQ s43 0) (NEQ s41 0) (NEQ s47 0) (NEQ s45 0) (NEQ s49 0) (NEQ s2 0) (NEQ s6 0) (NEQ s4 0) (NEQ s10 0) (NEQ s8 0) (NEQ s14 0) (NEQ s12 0) (NEQ s18 0) (NEQ s16 0) (NEQ s22 0) (NEQ s20 0) (NEQ s26 0) (NEQ s24 0) (NEQ s30 0) (NEQ s28 0) (NEQ s34 0) (NEQ s32 0) (NEQ s38 0) (NEQ s36 0) (NEQ s42 0) (NEQ s40 0) (NEQ s46 0) (NEQ s44 0) (NEQ s50 0) (NEQ s48 0) (NEQ s1 0) (NEQ s3 0) (NEQ s7 0) (NEQ s5 0) (NEQ s11 0) (NEQ s9 0) (NEQ s15 0) (NEQ s13 0) (NEQ s19 0) (NEQ s17 0) (NEQ s23 0) (NEQ s21 0) (NEQ s27 0) (NEQ s25 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-05 finished in 211 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 4 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 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, true, p0, true]
Running random walk in product with property : Referendum-PT-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:(NEQ 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-PT-0050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-06 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((p1&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 5 transition count 5
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 5 transition count 5
Applied a total of 92 rules in 1 ms. Remains 5 /51 variables (removed 46) and now considering 5/51 (removed 46) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/51 places, 5/51 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Referendum-PT-0050-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s3 0), p0:(EQ s2 0), p2:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-08 finished in 139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(X(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 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 3 transition count 3
Applied a total of 96 rules in 2 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:11] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-14 finished in 128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(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 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 3 transition count 3
Applied a total of 96 rules in 1 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:11] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 38 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3/3 places, 3/3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2021-05-17 14:10:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:12] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 3/3 transitions.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
[2021-05-17 14:10:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:10:12] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:10:12] [INFO ] Time to serialize gal into /tmp/LTL512112013713339117.gal : 1 ms
[2021-05-17 14:10:12] [INFO ] Time to serialize properties into /tmp/LTL10050065777150188515.ltl : 0 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/LTL512112013713339117.gal, -t, CGAL, -LTL, /tmp/LTL10050065777150188515.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/LTL512112013713339117.gal -t CGAL -LTL /tmp/LTL10050065777150188515.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(voting_33==1)"))))
Formula 0 simplified : !XF"(voting_33==1)"
Reverse transition relation is NOT exact ! Due to transitions t1, t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/2/3
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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.009707,15308,1,0,18,165,30,8,162,207,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0050-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0050-15 finished in 813 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260613438

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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