Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 21:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 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-LTLFireability-00
FORMULA_NAME Election2020-PT-none-LTLFireability-01
FORMULA_NAME Election2020-PT-none-LTLFireability-02
FORMULA_NAME Election2020-PT-none-LTLFireability-03
FORMULA_NAME Election2020-PT-none-LTLFireability-04
FORMULA_NAME Election2020-PT-none-LTLFireability-05
FORMULA_NAME Election2020-PT-none-LTLFireability-06
FORMULA_NAME Election2020-PT-none-LTLFireability-07
FORMULA_NAME Election2020-PT-none-LTLFireability-08
FORMULA_NAME Election2020-PT-none-LTLFireability-09
FORMULA_NAME Election2020-PT-none-LTLFireability-10
FORMULA_NAME Election2020-PT-none-LTLFireability-11
FORMULA_NAME Election2020-PT-none-LTLFireability-12
FORMULA_NAME Election2020-PT-none-LTLFireability-13
FORMULA_NAME Election2020-PT-none-LTLFireability-14
FORMULA_NAME Election2020-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678445005072

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 10:43:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 10:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:43:26] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-10 10:43:26] [INFO ] Transformed 53 places.
[2023-03-10 10:43:26] [INFO ] Transformed 102 transitions.
[2023-03-10 10:43:26] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Election2020-PT-none-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 51 transition count 51
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 38 transition count 38
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 38 transition count 38
Applied a total of 79 rules in 13 ms. Remains 38 /53 variables (removed 15) and now considering 38/102 (removed 64) transitions.
// Phase 1: matrix 38 rows 38 cols
[2023-03-10 10:43:26] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-10 10:43:27] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
[2023-03-10 10:43:27] [INFO ] Invariant cache hit.
[2023-03-10 10:43:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 10:43:27] [INFO ] Invariant cache hit.
[2023-03-10 10:43:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-10 10:43:27] [INFO ] Invariant cache hit.
[2023-03-10 10:43:27] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/53 places, 38/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 38/53 places, 38/102 transitions.
Support contains 21 out of 38 places after structural reductions.
[2023-03-10 10:43:27] [INFO ] Flatten gal took : 16 ms
[2023-03-10 10:43:27] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:43:27] [INFO ] Input system was already deterministic with 38 transitions.
Finished random walk after 65 steps, including 0 resets, run visited all 22 properties in 17 ms. (steps per millisecond=3 )
FORMULA Election2020-PT-none-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 38
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1 U p2))))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 23 transition count 23
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 23 transition count 23
Applied a total of 30 rules in 1 ms. Remains 23 /38 variables (removed 15) and now considering 23/38 (removed 15) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-10 10:43:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 10:43:27] [INFO ] Invariant cache hit.
[2023-03-10 10:43:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 10:43:27] [INFO ] Invariant cache hit.
[2023-03-10 10:43:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-10 10:43:27] [INFO ] Invariant cache hit.
[2023-03-10 10:43:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/38 places, 23/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 23/38 places, 23/38 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s16 3) (GEQ s10 6) (GEQ s21 5)), p2:(GEQ s16 3), p1:(GEQ s10 6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 3 ms.
FORMULA Election2020-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-00 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&X(X(F(p1))))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 22 transition count 22
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 22 transition count 22
Applied a total of 32 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 22/38 (removed 16) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 10:43:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 22/38 places, 22/38 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s8 4), p0:(GEQ s5 7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 82 steps with 8 reset in 5 ms.
FORMULA Election2020-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-01 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(X(F(X(F(X(!(p0 U p1)))))))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 22 transition count 22
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 22 transition count 22
Applied a total of 32 rules in 9 ms. Remains 22 /38 variables (removed 16) and now considering 22/38 (removed 16) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 10:43:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:43:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 22/38 places, 22/38 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : Election2020-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16 3), p1:(GEQ s6 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2320 steps with 84 reset in 19 ms.
FORMULA Election2020-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-03 finished in 467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U X(p1))||G(p2))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 24 transition count 24
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 24 transition count 24
Applied a total of 28 rules in 3 ms. Remains 24 /38 variables (removed 14) and now considering 24/38 (removed 14) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-10 10:43:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:43:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 10:43:28] [INFO ] Invariant cache hit.
[2023-03-10 10:43:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/38 places, 24/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 24/38 places, 24/38 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s15 11) (LT s11 6)), p2:(LT s0 9), p1:(GEQ s20 9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 195 steps with 29 reset in 3 ms.
FORMULA Election2020-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-04 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Graph (complete) has 0 edges and 38 vertex of which 1 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /38 variables (removed 37) and now considering 1/38 (removed 37) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-10 10:43:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-10 10:43:29] [INFO ] Invariant cache hit.
[2023-03-10 10:43:29] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 10:43:29] [INFO ] Invariant cache hit.
[2023-03-10 10:43:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-10 10:43:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:29] [INFO ] Invariant cache hit.
[2023-03-10 10:43:29] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 1/38 places, 1/38 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-05 finished in 130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U (p1 U p2)))))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Graph (complete) has 0 edges and 38 vertex of which 3 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /38 variables (removed 35) and now considering 3/38 (removed 35) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:43:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:29] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
[2023-03-10 10:43:29] [INFO ] Invariant cache hit.
[2023-03-10 10:43:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:43:29] [INFO ] Invariant cache hit.
[2023-03-10 10:43:29] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-10 10:43:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:29] [INFO ] Invariant cache hit.
[2023-03-10 10:43:29] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/38 places, 3/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 3/38 places, 3/38 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Election2020-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LT s1 1), p1:(LT s0 9), p0:(GEQ s2 20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14458 reset in 142 ms.
Product exploration explored 100000 steps with 14451 reset in 103 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT p2))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 8 factoid took 356 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLFireability-06 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Graph (complete) has 0 edges and 38 vertex of which 1 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /38 variables (removed 37) and now considering 1/38 (removed 37) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-10 10:43:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-10 10:43:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 1/38 places, 1/38 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 73 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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLFireability-07 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p0&&G(!p1)))))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 21 transition count 21
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 21 transition count 21
Applied a total of 34 rules in 4 ms. Remains 21 /38 variables (removed 17) and now considering 21/38 (removed 17) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-10 10:43:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 21/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 21/38 places, 21/38 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s18 38), p1:(GEQ s10 6)], 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 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-08 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Graph (complete) has 0 edges and 38 vertex of which 1 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /38 variables (removed 37) and now considering 1/38 (removed 37) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-10 10:43:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:30] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:30] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 10:43:30] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-10 10:43:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 1/38 places, 1/38 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 71 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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLFireability-10 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 22 transition count 22
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 22 transition count 22
Applied a total of 32 rules in 4 ms. Remains 22 /38 variables (removed 16) and now considering 22/38 (removed 16) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 10:43:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 22/38 places, 22/38 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s14 4), p1:(LT s13 16)], 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 2123 steps with 35 reset in 3 ms.
FORMULA Election2020-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-12 finished in 278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(X(p1))||(p2&&X(p0)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 24 transition count 24
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 24 transition count 24
Applied a total of 28 rules in 3 ms. Remains 24 /38 variables (removed 14) and now considering 24/38 (removed 14) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-10 10:43:31] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 10:43:31] [INFO ] Invariant cache hit.
[2023-03-10 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/38 places, 24/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 24/38 places, 24/38 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}]], initial=3, aps=[p0:(GEQ s23 10), p1:(AND (GEQ s11 6) (GEQ s6 3)), p2:(GEQ s19 20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 35 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-13 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Graph (complete) has 0 edges and 38 vertex of which 1 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /38 variables (removed 37) and now considering 1/38 (removed 37) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-10 10:43:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:43:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-10 10:43:32] [INFO ] Invariant cache hit.
[2023-03-10 10:43:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 10:43:32] [INFO ] Invariant cache hit.
[2023-03-10 10:43:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 10:43:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:32] [INFO ] Invariant cache hit.
[2023-03-10 10:43:32] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 1/38 places, 1/38 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, true, p0]
Running random walk in product with property : Election2020-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s0 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 36 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 : [p0, (X (NOT p0)), (X (X (NOT p0))), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, true, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 79 ms :[p0, true, p0]
[2023-03-10 10:43:32] [INFO ] Invariant cache hit.
[2023-03-10 10:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:43:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 10:43:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 10:43:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-10 10:43:32] [INFO ] Invariant cache hit.
[2023-03-10 10:43:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-10 10:43:33] [INFO ] Invariant cache hit.
[2023-03-10 10:43:33] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 10:43:33] [INFO ] Invariant cache hit.
[2023-03-10 10:43:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-10 10:43:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:33] [INFO ] Invariant cache hit.
[2023-03-10 10:43:33] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 1/1 places, 1/1 transitions.
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 : [p0, (X (NOT p0)), (X (X (NOT p0))), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p0, true, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, true, p0]
[2023-03-10 10:43:33] [INFO ] Invariant cache hit.
[2023-03-10 10:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:43:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 10:43:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 10:43:33] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 86 ms :[p0, true, p0]
Product exploration explored 100000 steps with 50000 reset in 33 ms.
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-10 10:43:33] [INFO ] Invariant cache hit.
[2023-03-10 10:43:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-10 10:43:33] [INFO ] Invariant cache hit.
[2023-03-10 10:43:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 10:43:34] [INFO ] Invariant cache hit.
[2023-03-10 10:43:34] [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.
[2023-03-10 10:43:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:43:34] [INFO ] Invariant cache hit.
[2023-03-10 10:43:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Election2020-PT-none-LTLFireability-14 finished in 2115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1||F(!p2))))))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 23 transition count 23
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 23 transition count 23
Applied a total of 30 rules in 1 ms. Remains 23 /38 variables (removed 15) and now considering 23/38 (removed 15) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-10 10:43:34] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:43:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-10 10:43:34] [INFO ] Invariant cache hit.
[2023-03-10 10:43:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 10:43:34] [INFO ] Invariant cache hit.
[2023-03-10 10:43:34] [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.
[2023-03-10 10:43:34] [INFO ] Invariant cache hit.
[2023-03-10 10:43:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/38 places, 23/38 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 23/38 places, 23/38 transitions.
Stuttering acceptance computed with spot in 165 ms :[p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p2:(LT s13 16), p1:(GEQ s12 10), p0:(LT s20 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 397 steps with 113 reset in 1 ms.
FORMULA Election2020-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-15 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
[2023-03-10 10:43:34] [INFO ] Flatten gal took : 8 ms
[2023-03-10 10:43:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 10:43:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 38 transitions and 38 arcs took 1 ms.
Total runtime 8097 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Election2020-PT-none
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Election2020-PT-none-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678445015909

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Election2020-PT-none-LTLFireability-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Election2020-PT-none-LTLFireability-14
lola: result : true
lola: markings : 100
lola: fired transitions : 199
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLFireability-14: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Election2020-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838852600124"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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