About the Execution of LoLa+red for Election2020-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1248.588 | 99692.00 | 104534.00 | 607.60 | ?TFFFFFFFTFT?TTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r167-tall-167838852600123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Election2020-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852600123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 21:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Election2020-PT-none-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 1678444895859
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 10:41:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 10:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:41:37] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-10 10:41:37] [INFO ] Transformed 53 places.
[2023-03-10 10:41:37] [INFO ] Transformed 102 transitions.
[2023-03-10 10:41:37] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Election2020-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 88
Applied a total of 14 rules in 13 ms. Remains 46 /53 variables (removed 7) and now considering 88/102 (removed 14) transitions.
// Phase 1: matrix 88 rows 46 cols
[2023-03-10 10:41:37] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-10 10:41:37] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
[2023-03-10 10:41:37] [INFO ] Invariant cache hit.
[2023-03-10 10:41:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 10:41:37] [INFO ] Invariant cache hit.
[2023-03-10 10:41:37] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-10 10:41:37] [INFO ] Invariant cache hit.
[2023-03-10 10:41:37] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 88/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 46/53 places, 88/102 transitions.
Support contains 29 out of 46 places after structural reductions.
[2023-03-10 10:41:38] [INFO ] Flatten gal took : 22 ms
[2023-03-10 10:41:38] [INFO ] Flatten gal took : 8 ms
[2023-03-10 10:41:38] [INFO ] Input system was already deterministic with 88 transitions.
Finished random walk after 147 steps, including 2 resets, run visited all 29 properties in 22 ms. (steps per millisecond=6 )
FORMULA Election2020-PT-none-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&p1) U (!G((p2 U p3))&&p2)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 25 transition count 48
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 25 transition count 48
Applied a total of 41 rules in 6 ms. Remains 25 /46 variables (removed 21) and now considering 48/88 (removed 40) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-10 10:41:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:41:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-10 10:41:38] [INFO ] Invariant cache hit.
[2023-03-10 10:41:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:41:38] [INFO ] Invariant cache hit.
[2023-03-10 10:41:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-10 10:41:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 10:41:38] [INFO ] Invariant cache hit.
[2023-03-10 10:41:38] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/46 places, 48/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 25/46 places, 48/88 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) p3), p0, p3]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s3), p1:(LEQ 1 s8), p0:(LEQ s22 s14), p3:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5482 reset in 304 ms.
Product exploration explored 100000 steps with 5507 reset in 244 ms.
Computed a total of 25 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 48
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 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 6 factoid took 499 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[p3, p3]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 6 factoid took 547 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[p3, p3]
Stuttering acceptance computed with spot in 79 ms :[p3, p3]
[2023-03-10 10:41:41] [INFO ] Invariant cache hit.
[2023-03-10 10:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-10 10:41:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:41] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-10 10:41:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 10:41:41] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG p3
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-10 10:41:41] [INFO ] Invariant cache hit.
[2023-03-10 10:41:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 10:41:41] [INFO ] Invariant cache hit.
[2023-03-10 10:41:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 10:41:41] [INFO ] Invariant cache hit.
[2023-03-10 10:41:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 10:41:41] [INFO ] Invariant cache hit.
[2023-03-10 10:41:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 25/25 places, 48/48 transitions.
Computed a total of 25 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 48
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 p3), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[p3, p3]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p2 p3), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[p3, p3]
Stuttering acceptance computed with spot in 65 ms :[p3, p3]
[2023-03-10 10:41:42] [INFO ] Invariant cache hit.
[2023-03-10 10:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-10 10:41:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-10 10:41:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 10:41:42] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 83 ms :[p3, p3]
Product exploration explored 100000 steps with 5520 reset in 282 ms.
Product exploration explored 100000 steps with 5423 reset in 208 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 69 ms :[p3, p3]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 44
Applied a total of 4 rules in 7 ms. Remains 23 /25 variables (removed 2) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-10 10:41:43] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 10:41:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-10 10:41:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/25 places, 44/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 23/25 places, 44/48 transitions.
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 44
Applied a total of 4 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 44/48 (removed 4) transitions.
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 44/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 23/25 places, 44/48 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-00 finished in 4642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||F(p2)))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 4 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 4
Applied a total of 5 rules in 3 ms. Remains 4 /46 variables (removed 42) and now considering 4/88 (removed 84) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-10 10:41:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-10 10:41:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:43] [INFO ] Invariant cache hit.
[2023-03-10 10:41:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/46 places, 4/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 4/46 places, 4/88 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s1), p2:(LEQ s0 s2), p0:(LEQ s3 s1)], 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 20158 reset in 96 ms.
Product exploration explored 100000 steps with 20170 reset in 84 ms.
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 p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 286 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 p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 37 steps, including 7 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 396 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 77 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-10 10:41:44] [INFO ] Invariant cache hit.
[2023-03-10 10:41:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-10 10:41:44] [INFO ] Invariant cache hit.
[2023-03-10 10:41:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 10:41:44] [INFO ] Invariant cache hit.
[2023-03-10 10:41:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 10:41:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:44] [INFO ] Invariant cache hit.
[2023-03-10 10:41:44] [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 100 ms. Remains : 4/4 places, 4/4 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 p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 407 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 63 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 12 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 302 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 73 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20172 reset in 53 ms.
Product exploration explored 100000 steps with 20168 reset in 53 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-10 10:41:45] [INFO ] Invariant cache hit.
[2023-03-10 10:41:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-10 10:41:45] [INFO ] Invariant cache hit.
[2023-03-10 10:41:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:41:45] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 10:41:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-01 finished in 2776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 3 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:41:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-10 10:41:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-02 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 4 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:41:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-10 10:41:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(GT s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-04 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(X(X(X(p1)))))) U X(X(p2)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 44 transition count 44
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 25 transition count 25
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 25 transition count 25
Applied a total of 84 rules in 11 ms. Remains 25 /46 variables (removed 21) and now considering 25/88 (removed 63) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-10 10:41:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-10 10:41:46] [INFO ] Invariant cache hit.
[2023-03-10 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/46 places, 25/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 25/46 places, 25/88 transitions.
Stuttering acceptance computed with spot in 506 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 11}, { cond=(NOT p2), acceptance={0} source=4 dest: 12}], [{ cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 7}], [{ cond=true, acceptance={} source=11 dest: 10}], [{ cond=(NOT p0), acceptance={} source=12 dest: 11}, { cond=true, acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(LEQ s14 s10), p2:(LEQ 2 s6), p1:(LEQ s2 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 434 steps with 75 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&X(((G(p0)&&p0) U p2)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 25 transition count 48
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 25 transition count 48
Applied a total of 41 rules in 4 ms. Remains 25 /46 variables (removed 21) and now considering 48/88 (removed 40) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-10 10:41:47] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/46 places, 48/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 25/46 places, 48/88 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (NOT p2), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s15 s21), p0:(LEQ s0 s19), p2:(GT 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-06 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 24 transition count 46
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 24 transition count 46
Applied a total of 43 rules in 4 ms. Remains 24 /46 variables (removed 22) and now considering 46/88 (removed 42) transitions.
// Phase 1: matrix 46 rows 24 cols
[2023-03-10 10:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/46 places, 46/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 24/46 places, 46/88 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-07 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:(AND (LEQ s6 s0) (LEQ s16 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][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-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-07 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 23 transition count 44
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 23 transition count 44
Applied a total of 45 rules in 4 ms. Remains 23 /46 variables (removed 23) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-10 10:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 10:41:47] [INFO ] Invariant cache hit.
[2023-03-10 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/46 places, 44/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 23/46 places, 44/88 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ 1 s0), p0:(GT s13 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33803 reset in 169 ms.
Product exploration explored 100000 steps with 33736 reset in 179 ms.
Computed a total of 23 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 44
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 (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
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 (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-10 10:41:49] [INFO ] Invariant cache hit.
[2023-03-10 10:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 10:41:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
Proved EG (AND (NOT p1) (NOT p0))
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 (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (G (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-08 finished in 1738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(p0)) U X(p1))))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 2 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:41:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:49] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
[2023-03-10 10:41:49] [INFO ] Invariant cache hit.
[2023-03-10 10:41:49] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-10 10:41:49] [INFO ] Invariant cache hit.
[2023-03-10 10:41:49] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2023-03-10 10:41:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:49] [INFO ] Invariant cache hit.
[2023-03-10 10:41:49] [INFO ] Dead Transitions using invariants and state equation in 11 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s0 s2)], 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 25520 reset in 86 ms.
Product exploration explored 100000 steps with 25550 reset in 91 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 192 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 p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 148 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 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-10 10:41:50] [INFO ] Invariant cache hit.
[2023-03-10 10:41:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-10 10:41:50] [INFO ] Invariant cache hit.
[2023-03-10 10:41:50] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:41:50] [INFO ] Invariant cache hit.
[2023-03-10 10:41:50] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-10 10:41:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:50] [INFO ] Invariant cache hit.
[2023-03-10 10:41:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 125 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 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 14 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 153 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 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25524 reset in 41 ms.
Product exploration explored 100000 steps with 25542 reset in 40 ms.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 0 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 10:41:51] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-10 10:41:51] [INFO ] Invariant cache hit.
[2023-03-10 10:41:51] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 10:41:51] [INFO ] Invariant cache hit.
[2023-03-10 10:41:51] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-10 10:41:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:51] [INFO ] Invariant cache hit.
[2023-03-10 10:41:51] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 2/3 places, 2/3 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-11 finished in 1782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 44 transition count 44
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 68 place count 22 transition count 22
Iterating global reduction 1 with 22 rules applied. Total rules applied 90 place count 22 transition count 22
Applied a total of 90 rules in 2 ms. Remains 22 /46 variables (removed 24) and now considering 22/88 (removed 66) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 10:41:51] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-10 10:41:51] [INFO ] Invariant cache hit.
[2023-03-10 10:41:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:41:51] [INFO ] Invariant cache hit.
[2023-03-10 10:41:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 10:41:51] [INFO ] Invariant cache hit.
[2023-03-10 10:41:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/46 places, 22/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 22/46 places, 22/88 transitions.
Stuttering acceptance computed with spot in 132 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 2014 reset in 106 ms.
Product exploration explored 100000 steps with 1986 reset in 109 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 based reduction with 3 factoid took 252 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 64 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=10 )
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 p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 10:41:52] [INFO ] Invariant cache hit.
[2023-03-10 10:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 10:41:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-10 10:41:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 10:41:52] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 10:41:52] [INFO ] Invariant cache hit.
[2023-03-10 10:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 10:41:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 10:41:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 10:41:52] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-10 10:41:52] [INFO ] Invariant cache hit.
[2023-03-10 10:41:53] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2023-03-10 10:41:53] [INFO ] Invariant cache hit.
[2023-03-10 10:41:53] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 10:41:53] [INFO ] Invariant cache hit.
[2023-03-10 10:41:53] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-10 10:41:53] [INFO ] Invariant cache hit.
[2023-03-10 10:41:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 22/22 places, 22/22 transitions.
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 (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 283 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 240 steps, including 3 resets, run visited all 3 properties in 5 ms. (steps per millisecond=48 )
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 (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 10:41:54] [INFO ] Invariant cache hit.
[2023-03-10 10:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 10:41:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-10 10:41:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 10:41:54] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 10:41:54] [INFO ] Invariant cache hit.
[2023-03-10 10:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-10 10:41:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 10:41:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 10:41:54] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2012 reset in 95 ms.
Product exploration explored 100000 steps with 2004 reset in 101 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (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 1 ms. Remains 2 /22 variables (removed 20) and now considering 2/22 (removed 20) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 10:41:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-10 10:41:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 19 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 48 ms. Remains : 2/22 places, 2/22 transitions.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 10:41:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 3960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(G(p1))))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 23 transition count 44
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 23 transition count 44
Applied a total of 45 rules in 2 ms. Remains 23 /46 variables (removed 23) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-10 10:41:55] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/46 places, 44/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 23/46 places, 44/88 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 2 s15), p1:(LEQ s0 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-15 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&p1) U (!G((p2 U p3))&&p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(p0)) U X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Found a Shortening insensitive property : Election2020-PT-none-LTLCardinality-12
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 2 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 84 output transitions
Drop transitions removed 84 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 6 ms. Remains 2 /46 variables (removed 44) and now considering 2/88 (removed 86) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 10:41:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:41:55] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-10 10:41:55] [INFO ] Invariant cache hit.
[2023-03-10 10:41:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:41:56] [INFO ] Invariant cache hit.
[2023-03-10 10:41:56] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-10 10:41:56] [INFO ] Invariant cache hit.
[2023-03-10 10:41:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2/46 places, 2/88 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 76 ms. Remains : 2/46 places, 2/88 transitions.
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 s0), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 39 ms.
Product exploration explored 100000 steps with 33333 reset in 38 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 : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (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)))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 10 steps, including 3 resets, run visited all 3 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (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))), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 10:41:57] [INFO ] Invariant cache hit.
[2023-03-10 10:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-10 10:41:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 10:41:57] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 10:41:57] [INFO ] Invariant cache hit.
[2023-03-10 10:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:57] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 10:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-10 10:41:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 10:41:57] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 10:41:57] [INFO ] Invariant cache hit.
[2023-03-10 10:41:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-10 10:41:57] [INFO ] Invariant cache hit.
[2023-03-10 10:41:57] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-10 10:41:57] [INFO ] Invariant cache hit.
[2023-03-10 10:41:57] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-10 10:41:57] [INFO ] Invariant cache hit.
[2023-03-10 10:41:57] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 2/2 places, 2/2 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 p1) (NOT p0)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1)]
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 10:41:58] [INFO ] Invariant cache hit.
[2023-03-10 10:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 10:41:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 10:41:58] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 10:41:58] [INFO ] Invariant cache hit.
[2023-03-10 10:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:58] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-10 10:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:41:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-10 10:41:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 10:41:58] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 40 ms.
Product exploration explored 100000 steps with 33333 reset in 39 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 10:41:58] [INFO ] Invariant cache hit.
[2023-03-10 10:41:59] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
[2023-03-10 10:41:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:41:59] [INFO ] Invariant cache hit.
[2023-03-10 10:41:59] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 2/2 places, 2/2 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 10:41:59] [INFO ] Invariant cache hit.
[2023-03-10 10:41:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-10 10:41:59] [INFO ] Invariant cache hit.
[2023-03-10 10:41:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 10:41:59] [INFO ] Invariant cache hit.
[2023-03-10 10:41:59] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 10:41:59] [INFO ] Invariant cache hit.
[2023-03-10 10:41:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 3389 ms.
[2023-03-10 10:41:59] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:41:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 10:41:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 88 transitions and 176 arcs took 2 ms.
Total runtime 21825 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Election2020-PT-none
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality
FORMULA Election2020-PT-none-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Election2020-PT-none-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678444995551
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:409
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 Election2020-PT-none-LTLCardinality-01
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Election2020-PT-none-LTLCardinality-01
lola: result : true
lola: markings : 64
lola: fired transitions : 82
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 Election2020-PT-none-LTLCardinality-12
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1200 7/32 Election2020-PT-none-LTLCardinality-12 937766 m, 187553 m/sec, 7558965 t fired, .
Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1200 12/32 Election2020-PT-none-LTLCardinality-12 1753762 m, 163199 m/sec, 14659229 t fired, .
Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1200 17/32 Election2020-PT-none-LTLCardinality-12 2514071 m, 152061 m/sec, 21643726 t fired, .
Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1200 22/32 Election2020-PT-none-LTLCardinality-12 3263477 m, 149881 m/sec, 28588188 t fired, .
Time elapsed: 20 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1200 27/32 Election2020-PT-none-LTLCardinality-12 3997314 m, 146767 m/sec, 35620845 t fired, .
Time elapsed: 25 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1200 32/32 Election2020-PT-none-LTLCardinality-12 4712143 m, 142965 m/sec, 42558205 t fired, .
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for Election2020-PT-none-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 Election2020-PT-none-LTLCardinality-11
lola: time limit : 1782 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for Election2020-PT-none-LTLCardinality-11
lola: result : true
lola: markings : 52
lola: fired transitions : 53
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Election2020-PT-none-LTLCardinality-00
lola: time limit : 3565 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3565 7/32 Election2020-PT-none-LTLCardinality-00 868552 m, 173710 m/sec, 4930700 t fired, .
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3565 11/32 Election2020-PT-none-LTLCardinality-00 1554399 m, 137169 m/sec, 9408910 t fired, .
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3565 16/32 Election2020-PT-none-LTLCardinality-00 2207063 m, 130532 m/sec, 13823901 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3565 20/32 Election2020-PT-none-LTLCardinality-00 2826075 m, 123802 m/sec, 17946185 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3565 24/32 Election2020-PT-none-LTLCardinality-00 3401227 m, 115030 m/sec, 22134550 t fired, .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3565 28/32 Election2020-PT-none-LTLCardinality-00 3924309 m, 104616 m/sec, 26268839 t fired, .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3565 31/32 Election2020-PT-none-LTLCardinality-00 4421796 m, 99497 m/sec, 30372607 t fired, .
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for Election2020-PT-none-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Election2020-PT-none-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
Election2020-PT-none-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Election2020-PT-none-LTLCardinality-00: LTL unknown AGGR
Election2020-PT-none-LTLCardinality-01: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-11: LTL true LTL model checker
Election2020-PT-none-LTLCardinality-12: LTL unknown AGGR
Time elapsed: 75 secs. Pages in use: 32
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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Election2020-PT-none, examination is 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 r167-tall-167838852600123"
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 '
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 ;