About the Execution of LTSMin+red for Referendum-PT-0500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 407.764 | 32026.00 | 43118.00 | 504.00 | FFTTFTFFFFFTFFFT | 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.r329-tall-167889202100516.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 ltsminxred
Input is Referendum-PT-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202100516
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 496K Feb 26 19:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Feb 26 19:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 255K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 257K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 881K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 404K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M Feb 26 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Feb 26 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 511K Feb 26 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 571K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0500-LTLFireability-00
FORMULA_NAME Referendum-PT-0500-LTLFireability-01
FORMULA_NAME Referendum-PT-0500-LTLFireability-02
FORMULA_NAME Referendum-PT-0500-LTLFireability-03
FORMULA_NAME Referendum-PT-0500-LTLFireability-04
FORMULA_NAME Referendum-PT-0500-LTLFireability-05
FORMULA_NAME Referendum-PT-0500-LTLFireability-06
FORMULA_NAME Referendum-PT-0500-LTLFireability-07
FORMULA_NAME Referendum-PT-0500-LTLFireability-08
FORMULA_NAME Referendum-PT-0500-LTLFireability-09
FORMULA_NAME Referendum-PT-0500-LTLFireability-10
FORMULA_NAME Referendum-PT-0500-LTLFireability-11
FORMULA_NAME Referendum-PT-0500-LTLFireability-12
FORMULA_NAME Referendum-PT-0500-LTLFireability-13
FORMULA_NAME Referendum-PT-0500-LTLFireability-14
FORMULA_NAME Referendum-PT-0500-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679144102543
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 12:55:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 12:55:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:55:04] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-18 12:55:04] [INFO ] Transformed 1501 places.
[2023-03-18 12:55:04] [INFO ] Transformed 1001 transitions.
[2023-03-18 12:55:04] [INFO ] Found NUPN structural information;
[2023-03-18 12:55:04] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Applied a total of 1500 rules in 55 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2023-03-18 12:55:04] [INFO ] Computed 0 place invariants in 13 ms
[2023-03-18 12:55:04] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-18 12:55:05] [INFO ] Invariant cache hit.
[2023-03-18 12:55:05] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-18 12:55:05] [INFO ] Invariant cache hit.
[2023-03-18 12:55:05] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 501/1501 places, 501/1001 transitions.
Support contains 501 out of 501 places after structural reductions.
[2023-03-18 12:55:05] [INFO ] Flatten gal took : 139 ms
[2023-03-18 12:55:06] [INFO ] Flatten gal took : 85 ms
[2023-03-18 12:55:06] [INFO ] Input system was already deterministic with 501 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 12:55:06] [INFO ] Invariant cache hit.
[2023-03-18 12:55:07] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Referendum-PT-0500-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Referendum-PT-0500-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 G((X(p2)||p1)))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:07] [INFO ] Invariant cache hit.
[2023-03-18 12:55:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 12:55:07] [INFO ] Invariant cache hit.
[2023-03-18 12:55:07] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-18 12:55:07] [INFO ] Invariant cache hit.
[2023-03-18 12:55:08] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 36 ms.
FORMULA Referendum-PT-0500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-00 finished in 969 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)&&F(G(!p1))))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 5 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:08] [INFO ] Invariant cache hit.
[2023-03-18 12:55:08] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 12:55:08] [INFO ] Invariant cache hit.
[2023-03-18 12:55:08] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 12:55:08] [INFO ] Invariant cache hit.
[2023-03-18 12:55:09] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 1), p1:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-01 finished in 761 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(p1)&&F(p2)))||p0)))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:09] [INFO ] Invariant cache hit.
[2023-03-18 12:55:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 12:55:09] [INFO ] Invariant cache hit.
[2023-03-18 12:55:09] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-18 12:55:09] [INFO ] Invariant cache hit.
[2023-03-18 12:55:09] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s0 1), p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2606 ms.
Product exploration explored 100000 steps with 50000 reset in 2663 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p0), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-02 finished in 6494 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(F(p0))))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 6 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:15] [INFO ] Invariant cache hit.
[2023-03-18 12:55:15] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 12:55:15] [INFO ] Invariant cache hit.
[2023-03-18 12:55:16] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-18 12:55:16] [INFO ] Invariant cache hit.
[2023-03-18 12:55:16] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2946 ms.
Product exploration explored 100000 steps with 33333 reset in 3114 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-03 finished in 7148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 15 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:22] [INFO ] Invariant cache hit.
[2023-03-18 12:55:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 12:55:23] [INFO ] Invariant cache hit.
[2023-03-18 12:55:23] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-18 12:55:23] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-18 12:55:23] [INFO ] Invariant cache hit.
[2023-03-18 12:55:23] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 507 steps with 3 reset in 14 ms.
FORMULA Referendum-PT-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-04 finished in 690 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((!X(!p0) U p0))||G(p1))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 3 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:23] [INFO ] Invariant cache hit.
[2023-03-18 12:55:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-18 12:55:23] [INFO ] Invariant cache hit.
[2023-03-18 12:55:23] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-18 12:55:23] [INFO ] Invariant cache hit.
[2023-03-18 12:55:24] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}]], initial=1, aps=[p1:(EQ s0 0), p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2855 ms.
Product exploration explored 100000 steps with 33333 reset in 3056 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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 p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-05 finished in 7163 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))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 13 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-18 12:55:30] [INFO ] Invariant cache hit.
[2023-03-18 12:55:30] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 12:55:30] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-18 12:55:31] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 12:55:31] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 666 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1), p1:(AND (EQ s0 0) (OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 13 ms.
FORMULA Referendum-PT-0500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-07 finished in 741 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))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 22 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 12:55:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 12:55:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 12:55:31] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 12:55:31] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-10 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 15 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
[2023-03-18 12:55:31] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 12:55:31] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 12:55:31] [INFO ] Invariant cache hit.
[2023-03-18 12:55:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Product exploration explored 100000 steps with 50000 reset in 47 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 : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-11 finished in 354 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))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 20 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-12 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Graph (complete) has 500 edges and 501 vertex of which 1 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.6 ms
Discarding 500 places :
Also discarding 500 output transitions
Drop transitions removed 500 transitions
Applied a total of 1 rules in 9 ms. Remains 1 /501 variables (removed 500) and now considering 1/501 (removed 500) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 12:55:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 12:55:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/501 places, 1/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 1/501 places, 1/501 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-13 finished in 276 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((G((p0&&F(!p1)))||(p0&&X((!p1&&G(F(!p1)))))))))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 21 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 12:55:32] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, p1]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2007 steps with 3 reset in 5 ms.
FORMULA Referendum-PT-0500-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-14 finished in 290 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))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Graph (complete) has 500 edges and 501 vertex of which 2 are kept as prefixes of interest. Removing 499 places using SCC suffix rule.1 ms
Discarding 499 places :
Also discarding 499 output transitions
Drop transitions removed 499 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /501 variables (removed 499) and now considering 2/501 (removed 499) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 12:55:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-18 12:55:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 12:55:32] [INFO ] Invariant cache hit.
[2023-03-18 12:55:32] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/501 places, 2/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 2/501 places, 2/501 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-15 finished in 381 ms.
All properties solved by simple procedures.
Total runtime 29024 ms.
ITS solved all properties within timeout
BK_STOP 1679144134569
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Referendum-PT-0500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202100516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0500.tgz
mv Referendum-PT-0500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;