Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110300443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Election2020-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 6.6K Apr 29 12:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 12:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K May 10 09:33 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 Election2020-PT-none-LTLCardinality-00
FORMULA_NAME Election2020-PT-none-LTLCardinality-01
FORMULA_NAME Election2020-PT-none-LTLCardinality-02
FORMULA_NAME Election2020-PT-none-LTLCardinality-03
FORMULA_NAME Election2020-PT-none-LTLCardinality-04
FORMULA_NAME Election2020-PT-none-LTLCardinality-05
FORMULA_NAME Election2020-PT-none-LTLCardinality-06
FORMULA_NAME Election2020-PT-none-LTLCardinality-07
FORMULA_NAME Election2020-PT-none-LTLCardinality-08
FORMULA_NAME Election2020-PT-none-LTLCardinality-09
FORMULA_NAME Election2020-PT-none-LTLCardinality-10
FORMULA_NAME Election2020-PT-none-LTLCardinality-11
FORMULA_NAME Election2020-PT-none-LTLCardinality-12
FORMULA_NAME Election2020-PT-none-LTLCardinality-13
FORMULA_NAME Election2020-PT-none-LTLCardinality-14
FORMULA_NAME Election2020-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652684530873

Running Version 202205111006
[2022-05-16 07:02:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:02:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:02:12] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2022-05-16 07:02:12] [INFO ] Transformed 53 places.
[2022-05-16 07:02:12] [INFO ] Transformed 102 transitions.
[2022-05-16 07:02:12] [INFO ] Parsed PT model containing 53 places and 102 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Election2020-PT-none-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 102
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 40 transition count 78
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 40 transition count 78
Applied a total of 25 rules in 14 ms. Remains 40 /53 variables (removed 13) and now considering 78/102 (removed 24) transitions.
// Phase 1: matrix 78 rows 40 cols
[2022-05-16 07:02:12] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 07:02:12] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
// Phase 1: matrix 78 rows 40 cols
[2022-05-16 07:02:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:12] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 78 rows 40 cols
[2022-05-16 07:02:12] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-16 07:02:12] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 40 cols
[2022-05-16 07:02:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:12] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/53 places, 78/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/53 places, 78/102 transitions.
Support contains 24 out of 40 places after structural reductions.
[2022-05-16 07:02:13] [INFO ] Flatten gal took : 20 ms
[2022-05-16 07:02:13] [INFO ] Flatten gal took : 9 ms
[2022-05-16 07:02:13] [INFO ] Input system was already deterministic with 78 transitions.
Finished random walk after 104 steps, including 1 resets, run visited all 20 properties in 31 ms. (steps per millisecond=3 )
FORMULA Election2020-PT-none-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Election2020-PT-none-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 40 stabilizing places and 78 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 78
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U p1)||F((X(p1) U X(X(p2))))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 39 transition count 39
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 24 transition count 24
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 24 transition count 24
Applied a total of 70 rules in 6 ms. Remains 24 /40 variables (removed 16) and now considering 24/78 (removed 54) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:13] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/40 places, 24/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/40 places, 24/78 transitions.
Stuttering acceptance computed with spot in 461 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p2:(LEQ s22 s19), p1:(LEQ s16 s20), p0:(LEQ s14 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23621 reset in 264 ms.
Product exploration explored 100000 steps with 23007 reset in 232 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 700 ms. Reduced automaton from 8 states, 21 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Finished random walk after 2044 steps, including 28 resets, run visited all 11 properties in 50 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 6 factoid took 968 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 783 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:17] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 24/24 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 603 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Finished random walk after 417 steps, including 5 resets, run visited all 11 properties in 12 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 5 factoid took 825 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Product exploration explored 100000 steps with 23404 reset in 196 ms.
Product exploration explored 100000 steps with 23364 reset in 164 ms.
Applying partial POR strategy [true, false, false, true, true, true]
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p1 p0)]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Graph (complete) has 0 edges and 24 vertex of which 6 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Applied a total of 1 rules in 6 ms. Remains 6 /24 variables (removed 18) and now considering 6/24 (removed 18) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:02:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2022-05-16 07:02:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:02:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/24 places, 6/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/24 places, 6/24 transitions.
Product exploration explored 100000 steps with 30617 reset in 210 ms.
Product exploration explored 100000 steps with 30503 reset in 184 ms.
Built C files in :
/tmp/ltsmin1533260386728041449
[2022-05-16 07:02:21] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1533260386728041449
Running compilation step : cd /tmp/ltsmin1533260386728041449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin1533260386728041449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1533260386728041449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7731655256724461202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:36] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:02:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 24/24 transitions.
Built C files in :
/tmp/ltsmin6589135023835181243
[2022-05-16 07:02:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6589135023835181243
Running compilation step : cd /tmp/ltsmin6589135023835181243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin6589135023835181243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6589135023835181243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9644080114557118149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:02:51] [INFO ] Flatten gal took : 2 ms
[2022-05-16 07:02:51] [INFO ] Flatten gal took : 1 ms
[2022-05-16 07:02:51] [INFO ] Time to serialize gal into /tmp/LTL16407218915058679937.gal : 1 ms
[2022-05-16 07:02:51] [INFO ] Time to serialize properties into /tmp/LTL16880543607169702182.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16407218915058679937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16880543607169702182.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1640721...268
Read 1 LTL properties
Checking formula 0 : !(((!((F("(NE<=AR)"))U("(NY<=SC)")))||(F((X("(NY<=SC)"))U(X(X("(VA<=OH)")))))))
Formula 0 simplified : !(!(F"(NE<=AR)" U "(NY<=SC)") | F(X"(NY<=SC)" U XX"(VA<=OH)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
322 unique states visited
0 strongly connected components in search stack
538 transitions explored
59 items max in DFS search stack
25 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.279868,26684,1,0,1299,45667,60,1075,443,84736,4098
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Election2020-PT-none-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Election2020-PT-none-LTLCardinality-03 finished in 38785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 39 transition count 39
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 22 transition count 22
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 22 transition count 22
Applied a total of 74 rules in 2 ms. Remains 22 /40 variables (removed 18) and now considering 22/78 (removed 56) transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:52] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/40 places, 22/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/40 places, 22/78 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06 automaton TGBA Formula[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:(GT s12 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-06 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 21 transition count 40
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 21 transition count 40
Applied a total of 38 rules in 8 ms. Remains 21 /40 variables (removed 19) and now considering 40/78 (removed 38) transitions.
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:52] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-16 07:02:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/40 places, 40/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/40 places, 40/78 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s17 s0)], 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 20715 reset in 262 ms.
Product exploration explored 100000 steps with 20680 reset in 272 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 40
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:02:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:02:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:02:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 07:02:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 07:02:53] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:53] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-16 07:02:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:02:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 40/40 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 40
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 1461 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:02:55] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:02:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:02:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:02:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:02:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 07:02:55] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20656 reset in 166 ms.
Product exploration explored 100000 steps with 20636 reset in 178 ms.
Built C files in :
/tmp/ltsmin3055727358798739093
[2022-05-16 07:02:56] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-16 07:02:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:02:56] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-16 07:02:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:02:56] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-16 07:02:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:02:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3055727358798739093
Running compilation step : cd /tmp/ltsmin3055727358798739093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin3055727358798739093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3055727358798739093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6667413863789456754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:03:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:03:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:03:11] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:03:11] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 07:03:11] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-16 07:03:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2022-05-16 07:03:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin7782987066862727498
[2022-05-16 07:03:11] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-16 07:03:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:03:11] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-16 07:03:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:03:11] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-16 07:03:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:03:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7782987066862727498
Running compilation step : cd /tmp/ltsmin7782987066862727498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 116 ms.
Running link step : cd /tmp/ltsmin7782987066862727498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7782987066862727498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10372921146750809722.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:03:27] [INFO ] Flatten gal took : 3 ms
[2022-05-16 07:03:27] [INFO ] Flatten gal took : 3 ms
[2022-05-16 07:03:27] [INFO ] Time to serialize gal into /tmp/LTL12710451468682203704.gal : 1 ms
[2022-05-16 07:03:27] [INFO ] Time to serialize properties into /tmp/LTL507472195329765489.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12710451468682203704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL507472195329765489.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1271045...266
Read 1 LTL properties
Checking formula 0 : !((F("(OH<=Total_D)")))
Formula 0 simplified : !F"(OH<=Total_D)"
Detected timeout of ITS tools.
[2022-05-16 07:03:42] [INFO ] Flatten gal took : 2 ms
[2022-05-16 07:03:42] [INFO ] Applying decomposition
[2022-05-16 07:03:42] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10809432804697087867.txt' '-o' '/tmp/graph10809432804697087867.bin' '-w' '/tmp/graph10809432804697087867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10809432804697087867.bin' '-l' '-1' '-v' '-w' '/tmp/graph10809432804697087867.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:03:42] [INFO ] Decomposing Gal with order
[2022-05-16 07:03:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:03:42] [INFO ] Flatten gal took : 2 ms
[2022-05-16 07:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 07:03:42] [INFO ] Time to serialize gal into /tmp/LTL12685735281065034057.gal : 1 ms
[2022-05-16 07:03:42] [INFO ] Time to serialize properties into /tmp/LTL11156754305754267090.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12685735281065034057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11156754305754267090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1268573...268
Read 1 LTL properties
Checking formula 0 : !((F("(gu0.OH<=gu0.Total_D)")))
Formula 0 simplified : !F"(gu0.OH<=gu0.Total_D)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2888341915184780598
[2022-05-16 07:03:57] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2888341915184780598
Running compilation step : cd /tmp/ltsmin2888341915184780598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin2888341915184780598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2888341915184780598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Election2020-PT-none-LTLCardinality-07 finished in 79904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((F(p1)||X((!F(p2)||!p0))))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 39 transition count 39
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 25 transition count 25
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 25 transition count 25
Applied a total of 68 rules in 3 ms. Remains 25 /40 variables (removed 15) and now considering 25/78 (removed 53) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:12] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:04:12] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/40 places, 25/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/40 places, 25/78 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s14 s10), p0:(LEQ s20 s23), p2:(GT s19 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 48415 reset in 132 ms.
Product exploration explored 100000 steps with 48383 reset in 138 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2))))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Finished random walk after 321 steps, including 4 resets, run visited all 3 properties in 14 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (NOT p1)), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 5 factoid took 407 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 548 ms :[(AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:14] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0))))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Finished random walk after 159 steps, including 2 resets, run visited all 3 properties in 6 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (NOT p1)), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 309 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 48409 reset in 134 ms.
Product exploration explored 100000 steps with 48381 reset in 146 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Graph (complete) has 0 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 5/25 (removed 20) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:04:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2022-05-16 07:04:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:04:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/25 places, 5/25 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 5/25 transitions.
Product exploration explored 100000 steps with 48878 reset in 131 ms.
Product exploration explored 100000 steps with 48966 reset in 142 ms.
Built C files in :
/tmp/ltsmin9743598087288714085
[2022-05-16 07:04:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9743598087288714085
Running compilation step : cd /tmp/ltsmin9743598087288714085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin9743598087288714085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9743598087288714085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17288461624444363470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:04:31] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-16 07:04:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Built C files in :
/tmp/ltsmin11161755194888836126
[2022-05-16 07:04:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11161755194888836126
Running compilation step : cd /tmp/ltsmin11161755194888836126;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin11161755194888836126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11161755194888836126;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5074511921968463097.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:04:46] [INFO ] Flatten gal took : 1 ms
[2022-05-16 07:04:46] [INFO ] Flatten gal took : 1 ms
[2022-05-16 07:04:46] [INFO ] Time to serialize gal into /tmp/LTL10879748893238250319.gal : 1 ms
[2022-05-16 07:04:46] [INFO ] Time to serialize properties into /tmp/LTL14879864500527089656.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10879748893238250319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14879864500527089656.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1087974...268
Read 1 LTL properties
Checking formula 0 : !(((F("(SC<=WV)"))U(X((F("(MS<=IA)"))||(X((!(F("(OR>WV)")))||("(SC>WV)")))))))
Formula 0 simplified : !(F"(SC<=WV)" U X(F"(MS<=IA)" | X("(SC>WV)" | !F"(OR>WV)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
116 unique states visited
0 strongly connected components in search stack
169 transitions explored
59 items max in DFS search stack
8 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.104781,21912,1,0,554,18823,50,440,450,34469,1777
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Election2020-PT-none-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Election2020-PT-none-LTLCardinality-09 finished in 34531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Graph (complete) has 39 edges and 40 vertex of which 1 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 76 output transitions
Drop transitions removed 76 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 1 ms. Remains 1 /40 variables (removed 39) and now considering 1/78 (removed 77) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:04:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:04:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:04:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 07:04:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:04:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/40 places, 1/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/40 places, 1/78 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s0)], 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 33 ms.
Product exploration explored 100000 steps with 50000 reset in 37 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
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 (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Election2020-PT-none-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-10 finished in 592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((F((((p0 U p1)&&p2)||p0))||G(X(p1)))))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Graph (complete) has 39 edges and 40 vertex of which 6 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 6 transition count 6
Applied a total of 7 rules in 2 ms. Remains 6 /40 variables (removed 34) and now considering 6/78 (removed 72) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:47] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:47] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:47] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 07:04:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:04:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/40 places, 6/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/40 places, 6/78 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s5), p1:(LEQ s2 s0), p2:(LEQ s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14586 reset in 79 ms.
Product exploration explored 100000 steps with 14601 reset in 82 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 87 steps, including 12 resets, run visited all 2 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:04:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:48] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2022-05-16 07:04:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:04:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 6/6 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 23 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 358 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14615 reset in 58 ms.
Product exploration explored 100000 steps with 14609 reset in 60 ms.
Built C files in :
/tmp/ltsmin11956860217555491315
[2022-05-16 07:04:50] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 07:04:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:04:50] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 07:04:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:04:50] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 07:04:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:04:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11956860217555491315
Running compilation step : cd /tmp/ltsmin11956860217555491315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin11956860217555491315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin11956860217555491315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased103785023334332452.hoa' '--buchi-type=spotba'
LTSmin run took 67 ms.
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-13 finished in 2843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(F(p0)) U p1)))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Graph (complete) has 39 edges and 40 vertex of which 4 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 4
Applied a total of 5 rules in 2 ms. Remains 4 /40 variables (removed 36) and now considering 4/78 (removed 74) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-16 07:04:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/40 places, 4/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/40 places, 4/78 transitions.
Stuttering acceptance computed with spot in 83 ms :[p1, (AND p1 p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2 s0), p0:(LEQ s1 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-14 finished in 181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(F(p1)||p1))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 39 transition count 39
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 22 transition count 22
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 22 transition count 22
Applied a total of 74 rules in 8 ms. Remains 22 /40 variables (removed 18) and now considering 22/78 (removed 56) transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 07:04:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:04:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/40 places, 22/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/40 places, 22/78 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s17), p0:(GT 2 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-15 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-16 07:04:50] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5385407395956748759
[2022-05-16 07:04:50] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2022-05-16 07:04:50] [INFO ] Applying decomposition
[2022-05-16 07:04:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:04:50] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2022-05-16 07:04:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:04:50] [INFO ] Flatten gal took : 3 ms
[2022-05-16 07:04:50] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2022-05-16 07:04:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:04:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5385407395956748759
Running compilation step : cd /tmp/ltsmin5385407395956748759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14581948277943065732.txt' '-o' '/tmp/graph14581948277943065732.bin' '-w' '/tmp/graph14581948277943065732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14581948277943065732.bin' '-l' '-1' '-v' '-w' '/tmp/graph14581948277943065732.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:04:50] [INFO ] Decomposing Gal with order
[2022-05-16 07:04:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:04:50] [INFO ] Flatten gal took : 34 ms
[2022-05-16 07:04:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 07:04:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality6611296301113400777.gal : 3 ms
[2022-05-16 07:04:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality3200683310303480197.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6611296301113400777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3200683310303480197.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((F("(gu1.OH<=gu1.Total_D)")))
Formula 0 simplified : !F"(gu1.OH<=gu1.Total_D)"
Compilation finished in 167 ms.
Running link step : cd /tmp/ltsmin5385407395956748759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin5385407395956748759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 07:25:43] [INFO ] Flatten gal took : 3 ms
[2022-05-16 07:25:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality7116036758556537615.gal : 14 ms
[2022-05-16 07:25:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality8547506886356294677.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7116036758556537615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8547506886356294677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((F("(OH<=Total_D)")))
Formula 0 simplified : !F"(OH<=Total_D)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 1/ 8), 0.003: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Initializing POR dependencies: labels 79, guards 78
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.029: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.032: There are 81 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.032: State length is 41, there are 79 groups
pins2lts-mc-linux64( 0/ 8), 0.032: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.032: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.032: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.032: Visible groups: 0 / 79, labels: 1 / 81
pins2lts-mc-linux64( 0/ 8), 0.032: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.032: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.158: [Blue] ~27 levels ~960 states ~12160 transitions
pins2lts-mc-linux64( 6/ 8), 0.202: [Blue] ~59 levels ~1920 states ~18528 transitions
pins2lts-mc-linux64( 7/ 8), 0.225: [Blue] ~59 levels ~3840 states ~22592 transitions
pins2lts-mc-linux64( 3/ 8), 0.252: [Blue] ~57 levels ~7680 states ~25040 transitions
pins2lts-mc-linux64( 3/ 8), 0.314: [Blue] ~58 levels ~15360 states ~37088 transitions
pins2lts-mc-linux64( 7/ 8), 0.457: [Blue] ~59 levels ~30720 states ~68112 transitions
pins2lts-mc-linux64( 4/ 8), 0.713: [Blue] ~59 levels ~61440 states ~112656 transitions
pins2lts-mc-linux64( 4/ 8), 1.233: [Blue] ~59 levels ~122880 states ~212176 transitions
pins2lts-mc-linux64( 7/ 8), 2.145: [Blue] ~59 levels ~245760 states ~499600 transitions
pins2lts-mc-linux64( 7/ 8), 3.839: [Blue] ~59 levels ~491520 states ~1014560 transitions
pins2lts-mc-linux64( 7/ 8), 7.202: [Blue] ~59 levels ~983040 states ~2103312 transitions
pins2lts-mc-linux64( 7/ 8), 13.472: [Blue] ~59 levels ~1966080 states ~4239360 transitions
pins2lts-mc-linux64( 7/ 8), 25.793: [Blue] ~59 levels ~3932160 states ~8548064 transitions
pins2lts-mc-linux64( 7/ 8), 53.591: [Blue] ~59 levels ~7864320 states ~17780128 transitions
pins2lts-mc-linux64( 7/ 8), 115.999: [Blue] ~59 levels ~15728640 states ~37089040 transitions
pins2lts-mc-linux64( 7/ 8), 254.580: [Blue] ~59 levels ~31457280 states ~75084816 transitions
pins2lts-mc-linux64( 7/ 8), 557.316: [Blue] ~59 levels ~62914560 states ~157438528 transitions
pins2lts-mc-linux64( 6/ 8), 1229.505: [Blue] ~59 levels ~125829120 states ~302370288 transitions
pins2lts-mc-linux64( 0/ 8), 1448.393: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1448.478:
pins2lts-mc-linux64( 0/ 8), 1448.478: Explored 134216631 states 287919208 transitions, fanout: 2.145
pins2lts-mc-linux64( 0/ 8), 1448.478: Total exploration time 1448.410 sec (1448.340 sec minimum, 1448.384 sec on average)
pins2lts-mc-linux64( 0/ 8), 1448.478: States per second: 92665, Transitions per second: 198783
pins2lts-mc-linux64( 0/ 8), 1448.478:
pins2lts-mc-linux64( 0/ 8), 1448.478: State space has 134217232 states, 133860625 are accepting
pins2lts-mc-linux64( 0/ 8), 1448.478: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1448.478: blue states: 134216631 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1448.478: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1448.478: all-red states: 133860625 (99.73%), bogus 13240 (0.01%)
pins2lts-mc-linux64( 0/ 8), 1448.478:
pins2lts-mc-linux64( 0/ 8), 1448.478: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1448.478:
pins2lts-mc-linux64( 0/ 8), 1448.478: Queue width: 8B, total height: 468, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1448.478: Tree memory: 1026.7MB, 8.0 B/state, compr.: 4.8%
pins2lts-mc-linux64( 0/ 8), 1448.478: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 1448.478: Stored 78 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1448.478: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1448.478: Est. total memory use: 1026.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5385407395956748759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5385407395956748759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 07:46:37] [INFO ] Flatten gal took : 136 ms
[2022-05-16 07:46:38] [INFO ] Input system was already deterministic with 78 transitions.
[2022-05-16 07:46:38] [INFO ] Transformed 40 places.
[2022-05-16 07:46:38] [INFO ] Transformed 78 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 07:46:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality4325240179561637248.gal : 3 ms
[2022-05-16 07:46:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality1374909414697266209.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4325240179561637248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1374909414697266209.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(OH<=Total_D)")))
Formula 0 simplified : !F"(OH<=Total_D)"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Election2020-PT-none"
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 Election2020-PT-none, 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 r078-tall-165260110300443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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