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-162089415800468.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.8K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-COL-0020-00
FORMULA_NAME Referendum-COL-0020-01
FORMULA_NAME Referendum-COL-0020-02
FORMULA_NAME Referendum-COL-0020-03
FORMULA_NAME Referendum-COL-0020-04
FORMULA_NAME Referendum-COL-0020-05
FORMULA_NAME Referendum-COL-0020-06
FORMULA_NAME Referendum-COL-0020-07
FORMULA_NAME Referendum-COL-0020-08
FORMULA_NAME Referendum-COL-0020-09
FORMULA_NAME Referendum-COL-0020-10
FORMULA_NAME Referendum-COL-0020-11
FORMULA_NAME Referendum-COL-0020-12
FORMULA_NAME Referendum-COL-0020-13
FORMULA_NAME Referendum-COL-0020-14
FORMULA_NAME Referendum-COL-0020-15

=== Now, execution of the tool begins

BK_START 1621258903990

Running Version 0
[2021-05-17 13:41:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 13:41:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:41:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 13:41:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:41:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 434 ms
[2021-05-17 13:41:46] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 61 PT places and 41.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-COL-0020-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:41:46] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:41:46] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_2965034284213876258.dot
[2021-05-17 13:41:46] [INFO ] Initial state test concluded for 4 properties.
FORMULA Referendum-COL-0020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100003 steps, including 4347 resets, run finished after 64 ms. (steps per millisecond=1562 ) properties (out of 19) seen :16
Running SMT prover for 3 properties.
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 13:41:46] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-17 13:41:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2021-05-17 13:41:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2021-05-17 13:41:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:41:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:41:46] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA Referendum-COL-0020-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:41:46] [INFO ] Flatten gal took : 16 ms
[2021-05-17 13:41:46] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:41:46] [INFO ] Unfolded HLPN to a Petri net with 61 places and 41 transitions in 1 ms.
[2021-05-17 13:41:46] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_11311902825513377607.dot
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:46] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 13:41:46] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:46] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 13:41:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:46] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 13:41:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 41/41 transitions.
[2021-05-17 13:41:46] [INFO ] Flatten gal took : 6 ms
[2021-05-17 13:41:46] [INFO ] Flatten gal took : 6 ms
[2021-05-17 13:41:46] [INFO ] Input system was already deterministic with 41 transitions.
Incomplete random walk after 100000 steps, including 4545 resets, run finished after 608 ms. (steps per millisecond=164 ) properties (out of 18) seen :16
Running SMT prover for 2 properties.
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:47] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 13:41:47] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2021-05-17 13:41:47] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-17 13:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:41:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 13:41:47] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 21 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 21 transition count 21
Applied a total of 21 rules in 10 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:47] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:47] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-17 13:41:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/61 places, 21/41 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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 320 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
[2021-05-17 13:41:49] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:41:49] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:41:49] [INFO ] Time to serialize gal into /tmp/LTL5438305598528108999.gal : 1 ms
[2021-05-17 13:41:49] [INFO ] Time to serialize properties into /tmp/LTL17756759339177036235.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/LTL5438305598528108999.gal, -t, CGAL, -LTL, /tmp/LTL17756759339177036235.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/LTL5438305598528108999.gal -t CGAL -LTL /tmp/LTL17756759339177036235.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=3)")))
Formula 0 simplified : !F"((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=3)"
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/20/21
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
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.031175,16440,1,0,73,1678,66,28,553,1152,58
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0020-00 finished in 1514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0||X(p1)))||((p0||X(p1))&&X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 41 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 14 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 13:41:49] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:49] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 629 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : Referendum-COL-0020-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(GT 1 s0), p0:(AND (GT (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)) (LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)))], 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 318 ms.
Product exploration explored 100000 steps with 25000 reset in 217 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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)]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 25000 reset in 286 ms.
Product exploration explored 100000 steps with 25000 reset in 397 ms.
Applying partial POR strategy [true, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Support contains 41 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2021-05-17 13:41:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:52] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:52] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 41/41 transitions.
Product exploration explored 100000 steps with 25000 reset in 505 ms.
Product exploration explored 100000 steps with 25000 reset in 369 ms.
[2021-05-17 13:41:53] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:41:53] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:41:53] [INFO ] Time to serialize gal into /tmp/LTL17681308396552046582.gal : 1 ms
[2021-05-17 13:41:53] [INFO ] Time to serialize properties into /tmp/LTL12466994481831713410.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/LTL17681308396552046582.gal, -t, CGAL, -LTL, /tmp/LTL12466994481831713410.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/LTL17681308396552046582.gal -t CGAL -LTL /tmp/LTL12466994481831713410.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(("(((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>(((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19))&&((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)>=2))")||(X("(ready_0<1)"))))||((X(X(F("(ready_0<1)"))))&&((X("(ready_0<1)"))||("(((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>(((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19))&&((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)>=2))"))))))
Formula 0 simplified : !X(G("(((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>(((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19))&&((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)>=2))" | X"(ready_0<1)") | (("(((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>(((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19))&&((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)>=2))" | X"(ready_0<1)") & XXF"(ready_0<1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/20/41
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
6 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.082712,18216,1,0,114,6098,118,48,1057,4827,111
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0020-01 finished in 4126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 1 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:53] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-02 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:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40))], 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 16 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-02 finished in 304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 1 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:53] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-03 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-03 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p0)))||G(F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 1 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:54] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:54] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:54] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:54] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-17 13:41:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Referendum-COL-0020-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p2:(AND (GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)) (GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))), p1:(GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-04 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (p1||X((G(p2) U (G(p2)&&p3))))))], workingDir=/home/mcc/execution]
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:54] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 13:41:54] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:54] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 13:41:54] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:54] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 13:41:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Referendum-COL-0020-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=(AND p3 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)) (LEQ 3 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60))), p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p2:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)), p3:(AND (LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)) (LEQ 3 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
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 p1))), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (NOT p1), (NOT p0), p2, (NOT p3)]
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 61 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2021-05-17 13:41:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 61 cols
[2021-05-17 13:41:57] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 13:41:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 41/41 transitions.
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 579 ms.
[2021-05-17 13:41:58] [INFO ] Flatten gal took : 4 ms
[2021-05-17 13:41:58] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:41:58] [INFO ] Time to serialize gal into /tmp/LTL17084533610707230842.gal : 1 ms
[2021-05-17 13:41:58] [INFO ] Time to serialize properties into /tmp/LTL2354470989815049708.ltl : 2 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/LTL17084533610707230842.gal, -t, CGAL, -LTL, /tmp/LTL2354470989815049708.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/LTL17084533610707230842.gal -t CGAL -LTL /tmp/LTL2354470989815049708.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(ready_0<=(((((((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19))"))U((X((G("((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))"))U(("(((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))&&((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=3))")&&(G("((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))")))))||("(((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))&&((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=3))"))))
Formula 0 simplified : !(X"(ready_0<=(((((((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19))" U ("(((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))&&((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=3))" | X(G"((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))" U ("(((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))&&((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=3))" & G"((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)<=(((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 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.051503,18320,1,0,8,2018,34,3,1014,652,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0020-05 finished in 4542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 41
Applied a total of 2 rules in 4 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2021-05-17 13:41:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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 190 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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 p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-COL-0020-06 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0020-06 finished in 662 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 21 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 0 output transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 21 transition count 21
Applied a total of 21 rules in 2 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:59] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:59] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2021-05-17 13:41:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/61 places, 21/41 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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 127 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
[2021-05-17 13:42:00] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:42:00] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:42:00] [INFO ] Time to serialize gal into /tmp/LTL2568262954215491012.gal : 1 ms
[2021-05-17 13:42:00] [INFO ] Time to serialize properties into /tmp/LTL18281317463293176432.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/LTL2568262954215491012.gal, -t, CGAL, -LTL, /tmp/LTL18281317463293176432.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/LTL2568262954215491012.gal -t CGAL -LTL /tmp/LTL18281317463293176432.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=1)")))
Formula 0 simplified : !F"((((((((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)>=1)"
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/20/21
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
2 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.035644,16220,1,0,73,1678,66,28,553,1152,58
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0020-07 finished in 908 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 0 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:00] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, p0, p0, p0]
Running random walk in product with property : Referendum-COL-0020-08 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-08 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((X(p1)&&G(!p2))))))], workingDir=/home/mcc/execution]
Support contains 41 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 1 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:42:00] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p0), (OR (NOT p1) p2), (NOT p1), p2]
Running random walk in product with property : Referendum-COL-0020-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p2:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40)), p1:(GT s0 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-15 finished in 407 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621258921521

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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