Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280000132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r175-smll-171636280000132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 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 1716577846796

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 19:10:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:10:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:10:49] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-24 19:10:49] [INFO ] Transformed 53 places.
[2024-05-24 19:10:49] [INFO ] Transformed 102 transitions.
[2024-05-24 19:10:49] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Election2020-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 38 transition count 72
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 38 transition count 72
Applied a total of 30 rules in 31 ms. Remains 38 /53 variables (removed 15) and now considering 72/102 (removed 30) transitions.
// Phase 1: matrix 72 rows 38 cols
[2024-05-24 19:10:49] [INFO ] Computed 1 invariants in 17 ms
[2024-05-24 19:10:50] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
[2024-05-24 19:10:50] [INFO ] Invariant cache hit.
[2024-05-24 19:10:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 19:10:50] [INFO ] Invariant cache hit.
[2024-05-24 19:10:50] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-24 19:10:50] [INFO ] Invariant cache hit.
[2024-05-24 19:10:50] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/53 places, 72/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 38/53 places, 72/102 transitions.
Support contains 22 out of 38 places after structural reductions.
[2024-05-24 19:10:50] [INFO ] Flatten gal took : 36 ms
[2024-05-24 19:10:50] [INFO ] Flatten gal took : 13 ms
[2024-05-24 19:10:50] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 138 steps, including 2 resets, run visited all 16 properties in 29 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 72 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 72
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 7 ms. Remains 2 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 19:10:51] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:10:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-24 19:10:51] [INFO ] Invariant cache hit.
[2024-05-24 19:10:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 19:10:51] [INFO ] Invariant cache hit.
[2024-05-24 19:10:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 19:10:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:10:51] [INFO ] Invariant cache hit.
[2024-05-24 19:10:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 2/38 places, 2/72 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-00 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:(OR (LEQ 1 s1) (LEQ 1 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA Election2020-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-00 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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, 72/72 transitions.
Graph (complete) has 72 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 70 output transitions
Drop transitions removed 70 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 2 ms. Remains 1 /38 variables (removed 37) and now considering 1/72 (removed 71) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-24 19:10:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:10:51] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2024-05-24 19:10:51] [INFO ] Invariant cache hit.
[2024-05-24 19:10:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 19:10:51] [INFO ] Invariant cache hit.
[2024-05-24 19:10:51] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 19:10:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:10:51] [INFO ] Invariant cache hit.
[2024-05-24 19:10:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 1/38 places, 1/72 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-04 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:(GT 2 s0)], 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 268 ms.
Product exploration explored 100000 steps with 50000 reset in 140 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 : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-24 19:10:52] [INFO ] Invariant cache hit.
[2024-05-24 19:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 19:10:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 19:10:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 19:10:52] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT 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.
[2024-05-24 19:10:52] [INFO ] Invariant cache hit.
[2024-05-24 19:10:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2024-05-24 19:10:52] [INFO ] Invariant cache hit.
[2024-05-24 19:10:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 19:10:52] [INFO ] Invariant cache hit.
[2024-05-24 19:10:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 19:10:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:10:52] [INFO ] Invariant cache hit.
[2024-05-24 19:10:52] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 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 : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-24 19:10:53] [INFO ] Invariant cache hit.
[2024-05-24 19:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 19:10:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 19:10:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 19:10:53] [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 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Built C files in :
/tmp/ltsmin8530609705032523652
[2024-05-24 19:10:53] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2024-05-24 19:10:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:10:53] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2024-05-24 19:10:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:10:53] [INFO ] Computing Do-Not-Accords matrix : 1 transitions.
[2024-05-24 19:10:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:10:53] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8530609705032523652
Running compilation step : cd /tmp/ltsmin8530609705032523652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin8530609705032523652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8530609705032523652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13730504559352095229.hoa' '--buchi-type=spotba'
LTSmin run took 211 ms.
FORMULA Election2020-PT-none-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-04 finished in 2719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 23 transition count 23
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 23 transition count 23
Applied a total of 64 rules in 2 ms. Remains 23 /38 variables (removed 15) and now considering 23/72 (removed 49) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-24 19:10:54] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:10:54] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 19:10:54] [INFO ] Invariant cache hit.
[2024-05-24 19:10:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 19:10:54] [INFO ] Invariant cache hit.
[2024-05-24 19:10:54] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 19:10:54] [INFO ] Invariant cache hit.
[2024-05-24 19:10:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/38 places, 23/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 23/38 places, 23/72 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GT 1 s19) (GT 2 s4)), p1:(LEQ s1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1694 reset in 233 ms.
Product exploration explored 100000 steps with 1694 reset in 238 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 23
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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 632 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 560 steps, including 7 resets, run visited all 5 properties in 13 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 854 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Graph (complete) has 0 edges and 23 vertex of which 4 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Applied a total of 1 rules in 2 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 19:10:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:10:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-24 19:10:56] [INFO ] Invariant cache hit.
[2024-05-24 19:10:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 19:10:56] [INFO ] Invariant cache hit.
[2024-05-24 19:10:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 19:10:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:10:56] [INFO ] Invariant cache hit.
[2024-05-24 19:10:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/23 places, 4/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 4/23 places, 4/23 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 571 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 38 steps, including 3 resets, run visited all 5 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 894 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11111 reset in 108 ms.
Product exploration explored 100000 steps with 11111 reset in 327 ms.
Built C files in :
/tmp/ltsmin2185820525504847941
[2024-05-24 19:10:59] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-24 19:10:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:10:59] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-24 19:10:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:10:59] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-24 19:10:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:10:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2185820525504847941
Running compilation step : cd /tmp/ltsmin2185820525504847941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin2185820525504847941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2185820525504847941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5482600807507294185.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA Election2020-PT-none-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 5118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(G(p1))) U (p2||X(!p0))))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 19:10:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:10:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GT 1 s13), p0:(LEQ s13 s16), p1:(LEQ 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 11 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 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 21 transition count 21
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 21 transition count 21
Applied a total of 68 rules in 4 ms. Remains 21 /38 variables (removed 17) and now considering 21/72 (removed 51) transitions.
// Phase 1: matrix 21 rows 21 cols
[2024-05-24 19:10:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:10:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 21/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 21/38 places, 21/72 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-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: 2}]], initial=1, aps=[p0:(GT 1 s17)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-08 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p1||F(p2)))||p0))))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 26 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 26 transition count 50
Applied a total of 23 rules in 5 ms. Remains 26 /38 variables (removed 12) and now considering 50/72 (removed 22) transitions.
// Phase 1: matrix 50 rows 26 cols
[2024-05-24 19:10:59] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 19:10:59] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:10:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 19:10:59] [INFO ] Invariant cache hit.
[2024-05-24 19:11:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 19:11:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 19:11:00] [INFO ] Invariant cache hit.
[2024-05-24 19:11:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 50/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 26/38 places, 50/72 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 3 s25), p1:(GT 1 s16), p0:(OR (GT s15 s18) (GT s0 s2))], 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 1699 reset in 284 ms.
Product exploration explored 100000 steps with 1702 reset in 306 ms.
Computed a total of 26 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 50
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) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (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) (NOT p1) (NOT p0)))), (X (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)))))]
Knowledge based reduction with 5 factoid took 719 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (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) (NOT p1) (NOT p0)))), (X (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))))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 911 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 19:11:02] [INFO ] Invariant cache hit.
[2024-05-24 19:11:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-24 19:11:02] [INFO ] Invariant cache hit.
[2024-05-24 19:11:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 19:11:02] [INFO ] Invariant cache hit.
[2024-05-24 19:11:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 19:11:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:11:02] [INFO ] Invariant cache hit.
[2024-05-24 19:11:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 26/26 places, 50/50 transitions.
Computed a total of 26 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 50
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) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (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) (NOT p1) (NOT p0)))), (X (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)))))]
Knowledge based reduction with 5 factoid took 719 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Finished random walk after 8396 steps, including 120 resets, run visited all 2 properties in 66 ms. (steps per millisecond=127 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (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) (NOT p1) (NOT p0)))), (X (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))))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 908 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 1702 reset in 208 ms.
Product exploration explored 100000 steps with 1702 reset in 222 ms.
Built C files in :
/tmp/ltsmin10692197222011621041
[2024-05-24 19:11:05] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-24 19:11:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:11:05] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-24 19:11:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:11:05] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-24 19:11:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:11:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10692197222011621041
Running compilation step : cd /tmp/ltsmin10692197222011621041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin10692197222011621041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10692197222011621041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15073531695222531644.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 19:11:20] [INFO ] Invariant cache hit.
[2024-05-24 19:11:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-24 19:11:20] [INFO ] Invariant cache hit.
[2024-05-24 19:11:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 19:11:20] [INFO ] Invariant cache hit.
[2024-05-24 19:11:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 19:11:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:11:20] [INFO ] Invariant cache hit.
[2024-05-24 19:11:20] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 26/26 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin2857149923751255598
[2024-05-24 19:11:20] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-24 19:11:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:11:20] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-24 19:11:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:11:20] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-24 19:11:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:11:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2857149923751255598
Running compilation step : cd /tmp/ltsmin2857149923751255598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin2857149923751255598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2857149923751255598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11494460585768429072.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 19:11:36] [INFO ] Flatten gal took : 5 ms
[2024-05-24 19:11:36] [INFO ] Flatten gal took : 4 ms
[2024-05-24 19:11:36] [INFO ] Time to serialize gal into /tmp/LTL5546903235722681678.gal : 2 ms
[2024-05-24 19:11:36] [INFO ] Time to serialize properties into /tmp/LTL662498664136393543.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5546903235722681678.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4466646640984791121.hoa' '-atoms' '/tmp/LTL662498664136393543.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL662498664136393543.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4466646640984791121.hoa
Detected timeout of ITS tools.
[2024-05-24 19:11:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 19:11:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 19:11:51] [INFO ] Time to serialize gal into /tmp/LTL7477729843704262619.gal : 1 ms
[2024-05-24 19:11:51] [INFO ] Time to serialize properties into /tmp/LTL3652712516456584335.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7477729843704262619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3652712516456584335.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((MI>NY)||(Total_R>AK))")||(G(("(MT>=1)")||(F("(WI>=3)"))))))))
Formula 0 simplified : G(F!"(MT>=1)" & FG(!"((MI>NY)||(Total_R>AK))" & !"(WI>=3)"))
Detected timeout of ITS tools.
[2024-05-24 19:12:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 19:12:06] [INFO ] Applying decomposition
[2024-05-24 19:12:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9241376880003283467.txt' '-o' '/tmp/graph9241376880003283467.bin' '-w' '/tmp/graph9241376880003283467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9241376880003283467.bin' '-l' '-1' '-v' '-w' '/tmp/graph9241376880003283467.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:12:06] [INFO ] Decomposing Gal with order
[2024-05-24 19:12:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:12:06] [INFO ] Flatten gal took : 39 ms
[2024-05-24 19:12:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 19:12:06] [INFO ] Time to serialize gal into /tmp/LTL10659930382488456555.gal : 2 ms
[2024-05-24 19:12:06] [INFO ] Time to serialize properties into /tmp/LTL4816515400939476316.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10659930382488456555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4816515400939476316.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu1.MI>gu1.NY)||(gu0.Total_R>gu0.AK))")||(G(("(gu0.MT>=1)")||(F("(gu0.WI>=3)"))))))))
Formula 0 simplified : G(F!"(gu0.MT>=1)" & FG(!"((gu1.MI>gu1.NY)||(gu0.Total_R>gu0.AK))" & !"(gu0.WI>=3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10308412711849744455
[2024-05-24 19:12:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10308412711849744455
Running compilation step : cd /tmp/ltsmin10308412711849744455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin10308412711849744455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10308412711849744455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](((LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Election2020-PT-none-LTLCardinality-10 finished in 96594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 24 transition count 46
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 24 transition count 46
Applied a total of 27 rules in 14 ms. Remains 24 /38 variables (removed 14) and now considering 46/72 (removed 26) transitions.
// Phase 1: matrix 46 rows 24 cols
[2024-05-24 19:12:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:12:36] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2024-05-24 19:12:36] [INFO ] Invariant cache hit.
[2024-05-24 19:12:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 19:12:36] [INFO ] Invariant cache hit.
[2024-05-24 19:12:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 19:12:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 19:12:36] [INFO ] Invariant cache hit.
[2024-05-24 19:12:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 46/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 24/38 places, 46/72 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s8 s0) (GT s20 s3))], 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 58 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-11 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 19:12:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:12:36] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-24 19:12:36] [INFO ] Invariant cache hit.
[2024-05-24 19:12:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 19:12:36] [INFO ] Invariant cache hit.
[2024-05-24 19:12:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 19:12:36] [INFO ] Invariant cache hit.
[2024-05-24 19:12:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 161 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-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s5), p0:(GT 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1992 reset in 129 ms.
Product exploration explored 100000 steps with 2002 reset in 145 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
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 p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 450 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Finished random walk after 153 steps, including 2 resets, run visited all 4 properties in 8 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 576 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 19:12:39] [INFO ] Invariant cache hit.
[2024-05-24 19:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 19:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 19:12:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 19:12:39] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-24 19:12:39] [INFO ] Invariant cache hit.
[2024-05-24 19:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 19:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 19:12:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 19:12:39] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /22 variables (removed 20) and now considering 2/22 (removed 20) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 19:12:39] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:12:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2024-05-24 19:12:39] [INFO ] Invariant cache hit.
[2024-05-24 19:12:39] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 19:12:39] [INFO ] Invariant cache hit.
[2024-05-24 19:12:39] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-24 19:12:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:12:39] [INFO ] Invariant cache hit.
[2024-05-24 19:12:39] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 2/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 2/22 places, 2/22 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 624 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Finished random walk after 4 steps, including 1 resets, run visited all 4 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 817 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 19:12:41] [INFO ] Invariant cache hit.
[2024-05-24 19:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 19:12:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 19:12:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 19:12:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-24 19:12:41] [INFO ] Invariant cache hit.
[2024-05-24 19:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 19:12:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 19:12:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 19:12:41] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Product exploration explored 100000 steps with 33333 reset in 70 ms.
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Built C files in :
/tmp/ltsmin6468247048716845716
[2024-05-24 19:12:42] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-24 19:12:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:12:42] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-24 19:12:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:12:42] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-24 19:12:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:12:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6468247048716845716
Running compilation step : cd /tmp/ltsmin6468247048716845716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin6468247048716845716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6468247048716845716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9096586343806693971.hoa' '--buchi-type=spotba'
LTSmin run took 43 ms.
FORMULA Election2020-PT-none-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 5594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 1 ms. Remains 2 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 19:12:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:12:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2024-05-24 19:12:42] [INFO ] Invariant cache hit.
[2024-05-24 19:12:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 19:12:42] [INFO ] Invariant cache hit.
[2024-05-24 19:12:42] [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.
[2024-05-24 19:12:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 19:12:42] [INFO ] Invariant cache hit.
[2024-05-24 19:12:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 2/38 places, 2/72 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 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 39981 reset in 46 ms.
Product exploration explored 100000 steps with 40009 reset in 64 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-13 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 3 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 19:12:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:12:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 19:12:42] [INFO ] Invariant cache hit.
[2024-05-24 19:12:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 19:12:42] [INFO ] Invariant cache hit.
[2024-05-24 19:12:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 19:12:42] [INFO ] Invariant cache hit.
[2024-05-24 19:12:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6 s18)], 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][false, false]]
Stuttering criterion allowed to conclude after 61 steps with 1 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-14 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p1||F(p2)))||p0))))'
[2024-05-24 19:12:43] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15201175445267835184
[2024-05-24 19:12:43] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2024-05-24 19:12:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:12:43] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2024-05-24 19:12:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:12:43] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2024-05-24 19:12:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:12:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15201175445267835184
Running compilation step : cd /tmp/ltsmin15201175445267835184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 19:12:43] [INFO ] Applying decomposition
[2024-05-24 19:12:43] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16022416868406158044.txt' '-o' '/tmp/graph16022416868406158044.bin' '-w' '/tmp/graph16022416868406158044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16022416868406158044.bin' '-l' '-1' '-v' '-w' '/tmp/graph16022416868406158044.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:12:43] [INFO ] Decomposing Gal with order
[2024-05-24 19:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:12:43] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-24 19:12:43] [INFO ] Flatten gal took : 35 ms
[2024-05-24 19:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2024-05-24 19:12:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality11852099342853676526.gal : 6 ms
[2024-05-24 19:12:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality730016742627039744.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11852099342853676526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality730016742627039744.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu2.MI>gu2.NY)||(gu1.Total_R>gu1.AK))")||(G(("(gu0.MT>=1)")||(F("(gu0.WI>=3)"))))))))
Formula 0 simplified : G(F!"(gu0.MT>=1)" & FG(!"((gu2.MI>gu2.NY)||(gu1.Total_R>gu1.AK))" & !"(gu0.WI>=3)"))
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin15201175445267835184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15201175445267835184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 19:33:20] [INFO ] Flatten gal took : 5 ms
[2024-05-24 19:33:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality16308530208109716626.gal : 2 ms
[2024-05-24 19:33:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality2270272405466742223.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16308530208109716626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2270272405466742223.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("((MI>NY)||(Total_R>AK))")||(G(("(MT>=1)")||(F("(WI>=3)"))))))))
Formula 0 simplified : G(F!"(MT>=1)" & FG(!"((MI>NY)||(Total_R>AK))" & !"(WI>=3)"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Initializing POR dependencies: labels 75, guards 72
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed 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( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: LTL layer: formula: [](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 5/ 8), 0.020: "[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.052: There are 76 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.052: State length is 39, there are 78 groups
pins2lts-mc-linux64( 0/ 8), 0.052: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.052: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.052: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.052: Visible groups: 0 / 78, labels: 3 / 76
pins2lts-mc-linux64( 0/ 8), 0.052: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.052: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.447: [Blue] ~59 levels ~960 states ~18288 transitions
pins2lts-mc-linux64( 1/ 8), 0.472: [Blue] ~59 levels ~1920 states ~21184 transitions
pins2lts-mc-linux64( 1/ 8), 0.519: [Blue] ~59 levels ~3840 states ~29088 transitions
pins2lts-mc-linux64( 3/ 8), 0.600: [Blue] ~59 levels ~7680 states ~54136 transitions
pins2lts-mc-linux64( 0/ 8), 0.743: [Blue] ~59 levels ~15360 states ~102232 transitions
pins2lts-mc-linux64( 0/ 8), 1.023: [Blue] ~59 levels ~30720 states ~207816 transitions
pins2lts-mc-linux64( 4/ 8), 1.540: [Blue] ~59 levels ~61440 states ~343568 transitions
pins2lts-mc-linux64( 4/ 8), 2.416: [Blue] ~59 levels ~122880 states ~759600 transitions
pins2lts-mc-linux64( 4/ 8), 3.976: [Blue] ~59 levels ~245760 states ~1617216 transitions
pins2lts-mc-linux64( 4/ 8), 6.697: [Blue] ~59 levels ~491520 states ~3552624 transitions
pins2lts-mc-linux64( 4/ 8), 11.427: [Blue] ~59 levels ~983040 states ~7956208 transitions
pins2lts-mc-linux64( 4/ 8), 19.957: [Blue] ~59 levels ~1966080 states ~17127856 transitions
pins2lts-mc-linux64( 4/ 8), 38.524: [Blue] ~59 levels ~3932160 states ~37474768 transitions
pins2lts-mc-linux64( 4/ 8), 79.802: [Blue] ~59 levels ~7864320 states ~81371272 transitions
pins2lts-mc-linux64( 4/ 8), 172.480: [Blue] ~59 levels ~15728640 states ~177928520 transitions
pins2lts-mc-linux64( 2/ 8), 374.641: [Blue] ~59 levels ~31457280 states ~399363152 transitions
pins2lts-mc-linux64( 4/ 8), 798.416: [Blue] ~59 levels ~62914560 states ~830784520 transitions
pins2lts-mc-linux64( 3/ 8), 1358.484: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1358.587:
pins2lts-mc-linux64( 0/ 8), 1358.587: Explored 91559674 states 1359777453 transitions, fanout: 14.851
pins2lts-mc-linux64( 0/ 8), 1358.587: Total exploration time 1358.480 sec (1358.420 sec minimum, 1358.451 sec on average)
pins2lts-mc-linux64( 0/ 8), 1358.587: States per second: 67399, Transitions per second: 1000955
pins2lts-mc-linux64( 0/ 8), 1358.587:
pins2lts-mc-linux64( 0/ 8), 1358.587: State space has 91573344 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1358.587: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1358.587: blue states: 91559674 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1358.587: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1358.587: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1358.587:
pins2lts-mc-linux64( 0/ 8), 1358.587: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1358.587:
pins2lts-mc-linux64( 0/ 8), 1358.587: Queue width: 8B, total height: 472, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1358.587: Tree memory: 954.6MB, 10.9 B/state, compr.: 6.9%
pins2lts-mc-linux64( 0/ 8), 1358.587: Tree fill ratio (roots/leafs): 68.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1358.587: Stored 78 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1358.587: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1358.587: Est. total memory use: 954.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15201175445267835184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15201175445267835184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 19:53:58] [INFO ] Flatten gal took : 6 ms
[2024-05-24 19:53:58] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 19:53:58] [INFO ] Transformed 38 places.
[2024-05-24 19:53:58] [INFO ] Transformed 72 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-24 19:53:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality14530953246249519441.gal : 7 ms
[2024-05-24 19:53:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality18324926168603922448.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14530953246249519441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18324926168603922448.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((MI>NY)||(Total_R>AK))")||(G(("(MT>=1)")||(F("(WI>=3)"))))))))
Formula 0 simplified : G(F!"(MT>=1)" & FG(!"((MI>NY)||(Total_R>AK))" & !"(WI>=3)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1077796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034728 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r175-smll-171636280000132"
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 ;