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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 132K 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 6.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 12K 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-0010-00
FORMULA_NAME Referendum-PT-0010-01
FORMULA_NAME Referendum-PT-0010-02
FORMULA_NAME Referendum-PT-0010-03
FORMULA_NAME Referendum-PT-0010-04
FORMULA_NAME Referendum-PT-0010-05
FORMULA_NAME Referendum-PT-0010-06
FORMULA_NAME Referendum-PT-0010-07
FORMULA_NAME Referendum-PT-0010-08
FORMULA_NAME Referendum-PT-0010-09
FORMULA_NAME Referendum-PT-0010-10
FORMULA_NAME Referendum-PT-0010-11
FORMULA_NAME Referendum-PT-0010-12
FORMULA_NAME Referendum-PT-0010-13
FORMULA_NAME Referendum-PT-0010-14
FORMULA_NAME Referendum-PT-0010-15

=== Now, execution of the tool begins

BK_START 1621260494231

Running Version 0
[2021-05-17 14:08:15] [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:08:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:08:15] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-17 14:08:15] [INFO ] Transformed 31 places.
[2021-05-17 14:08:15] [INFO ] Transformed 21 transitions.
[2021-05-17 14:08:15] [INFO ] Found NUPN structural information;
[2021-05-17 14:08:15] [INFO ] Parsed PT model containing 31 places and 21 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:08:15] [INFO ] Initial state test concluded for 3 properties.
FORMULA Referendum-PT-0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 7 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:15] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:16] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/31 places, 11/21 transitions.
[2021-05-17 14:08:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:08:16] [INFO ] Flatten gal took : 14 ms
FORMULA Referendum-PT-0010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:08:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:08:16] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 132 ms. (steps per millisecond=757 ) properties (out of 14) seen :13
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 1 ms
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Referendum-PT-0010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 1 transition count 1
Applied a total of 20 rules in 6 ms. Remains 1 /11 variables (removed 10) and now considering 1/11 (removed 10) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-17 14:08:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:16] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/11 places, 1/11 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-01 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: 1}]], initial=1, aps=[p0:(EQ s0 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-0010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-01 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 1 transition count 1
Applied a total of 20 rules in 3 ms. Remains 1 /11 variables (removed 10) and now considering 1/11 (removed 10) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:16] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 14:08:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:08:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/11 places, 1/11 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Referendum-PT-0010-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Referendum-PT-0010-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0010-03 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-17 14:08:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:08:17] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-04 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 s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 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 15 steps with 2 reset in 1 ms.
FORMULA Referendum-PT-0010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-04 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:17] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s0 0) (AND (NEQ s1 1) (NEQ s2 1) (NEQ s3 1) (NEQ s4 1) (NEQ s5 1) (NEQ s6 1) (NEQ s7 1) (NEQ s8 1) (NEQ s9 1) (NEQ s10 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-06 finished in 104 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(F(!p0))||G(!p1)) U (p1&&(X(F(!p0))||G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-17 14:08:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:17] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 113 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Referendum-PT-0010-07 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s0 1), p1:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 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]]
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 33333 reset in 73 ms.
Product exploration explored 100000 steps with 33333 reset in 76 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 73 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Support contains 11 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 14:08:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:08:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Product exploration explored 100000 steps with 33333 reset in 186 ms.
[2021-05-17 14:08:18] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:08:18] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:08:18] [INFO ] Time to serialize gal into /tmp/LTL3385922902092758063.gal : 1 ms
[2021-05-17 14:08:18] [INFO ] Time to serialize properties into /tmp/LTL6005587715681999036.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/LTL3385922902092758063.gal, -t, CGAL, -LTL, /tmp/LTL6005587715681999036.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/LTL3385922902092758063.gal -t CGAL -LTL /tmp/LTL6005587715681999036.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("(ready==0)")))||(G("((((((((((voting_1==0)&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0))")))U(("((((((((((voting_1==1)||(voting_2==1))||(voting_3==1))||(voting_4==1))||(voting_5==1))||(voting_6==1))||(voting_7==1))||(voting_8==1))||(voting_9==1))||(voting_10==1))")&&((X(F("(ready==0)")))||(G("((((((((((voting_1==0)&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0))")))))))
Formula 0 simplified : !X((XF"(ready==0)" | G"((((((((((voting_1==0)&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0))") U ("((((((((((voting_1==1)||(voting_2==1))||(voting_3==1))||(voting_4==1))||(voting_5==1))||(voting_6==1))||(voting_7==1))||(voting_8==1))||(voting_9==1))||(voting_10==1))" & (XF"(ready==0)" | G"((((((((((voting_1==0)&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0))")))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.025678,17156,1,0,43,465,55,17,335,352,43
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-PT-0010-07 finished in 1649 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 2 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:08:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:18] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:08:18] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:18] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 14:08:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:08:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:18] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1), p1:(NEQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-08 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(!p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:19] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:19] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-17 14:08:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:19] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-10 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 0 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:19] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:19] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:19] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0010-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17633 reset in 48 ms.
Product exploration explored 100000 steps with 17467 reset in 48 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))), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Referendum-PT-0010-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0010-11 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 2 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:19] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:19] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0010-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s2 1), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 43 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 p1)), (F (G p0)), p1, (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Product exploration explored 100000 steps with 50000 reset in 39 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 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 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2021-05-17 14:08:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:08:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:20] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 3/3 transitions.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
[2021-05-17 14:08:20] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:08:20] [INFO ] Flatten gal took : 0 ms
[2021-05-17 14:08:20] [INFO ] Time to serialize gal into /tmp/LTL7627768454313016149.gal : 0 ms
[2021-05-17 14:08:20] [INFO ] Time to serialize properties into /tmp/LTL5131285179317659656.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/LTL7627768454313016149.gal, -t, CGAL, -LTL, /tmp/LTL5131285179317659656.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/LTL7627768454313016149.gal -t CGAL -LTL /tmp/LTL5131285179317659656.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(ready==0)")||(G("(voting_5!=1)")))))
Formula 0 simplified : !X("(ready==0)" | G"(voting_5!=1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, 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.021625,16144,1,0,18,77,31,8,88,72,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0010-12 finished in 926 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 1 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:08:20] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:20] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:08:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:20] [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 4 rows 4 cols
[2021-05-17 14:08:20] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 0)), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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))), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4/4 places, 4/4 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 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-17 14:08:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 4/4 transitions.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
[2021-05-17 14:08:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:08:21] [INFO ] Flatten gal took : 0 ms
[2021-05-17 14:08:21] [INFO ] Time to serialize gal into /tmp/LTL17121922146081713176.gal : 0 ms
[2021-05-17 14:08:21] [INFO ] Time to serialize properties into /tmp/LTL3737305155629730790.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/LTL17121922146081713176.gal, -t, CGAL, -LTL, /tmp/LTL3737305155629730790.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/LTL17121922146081713176.gal -t CGAL -LTL /tmp/LTL3737305155629730790.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((ready==1)&&(voting_4==0))"))U(X("(voting_6==1)"))))
Formula 0 simplified : !(G"((ready==1)&&(voting_4==0))" U X"(voting_6==1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/3/4
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
1 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.011556,17056,1,0,21,110,35,9,115,98,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0010-13 finished in 1164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 1 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:21] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:21] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-17 14:08:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 37 ms.
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 42 ms.
[2021-05-17 14:08:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:08:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:08:21] [INFO ] Time to serialize gal into /tmp/LTL7626849165443838439.gal : 1 ms
[2021-05-17 14:08:21] [INFO ] Time to serialize properties into /tmp/LTL4255991645685349022.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/LTL7626849165443838439.gal, -t, CGAL, -LTL, /tmp/LTL4255991645685349022.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/LTL7626849165443838439.gal -t CGAL -LTL /tmp/LTL4255991645685349022.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(voting_9==1)")))
Formula 0 simplified : !F"(voting_9==1)"
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/1/2
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.009236,15316,1,0,11,22,26,8,41,28,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0010-14 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((!p0||X((p1 U p2)))) U (!p0&&X((!p0||X((p1 U p2))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 0 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:08:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:22] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:22] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:08:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:08:22] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, p0, (AND p0 (NOT p2)), (NOT p2), true]
Running random walk in product with property : Referendum-PT-0010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s2 1), p2:(AND (EQ s2 1) (EQ s3 1)), p1:(EQ s3 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 0 ms.
FORMULA Referendum-PT-0010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-15 finished in 183 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260502696

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

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