About the Execution of LTSMin+red for ViralEpidemic-PT-S02D1C1A10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1712.716 | 177928.00 | 211740.00 | 726.80 | FFTTFFTFFFFFTTTF | 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.r489-tall-167912707901244.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 ViralEpidemic-PT-S02D1C1A10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707901244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 11K Feb 25 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 20:34 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 4.7K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 21:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.8M 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 ViralEpidemic-PT-S02D1C1A10-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679350519112
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=ViralEpidemic-PT-S02D1C1A10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 22:15:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:15:21] [INFO ] Load time of PNML (sax parser for PT used): 468 ms
[2023-03-20 22:15:21] [INFO ] Transformed 8189 places.
[2023-03-20 22:15:21] [INFO ] Transformed 10235 transitions.
[2023-03-20 22:15:21] [INFO ] Found NUPN structural information;
[2023-03-20 22:15:21] [INFO ] Parsed PT model containing 8189 places and 10235 transitions and 22517 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 8189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8189/8189 places, 10235/10235 transitions.
Discarding 3033 places :
Symmetric choice reduction at 0 with 3033 rule applications. Total rules 3033 place count 5156 transition count 5183
Iterating global reduction 0 with 3033 rules applied. Total rules applied 6066 place count 5156 transition count 5183
Applied a total of 6066 rules in 2353 ms. Remains 5156 /8189 variables (removed 3033) and now considering 5183/10235 (removed 5052) transitions.
// Phase 1: matrix 5183 rows 5156 cols
[2023-03-20 22:15:24] [INFO ] Invariants computation overflowed in 524 ms
[2023-03-20 22:15:24] [INFO ] Implicit Places using invariants in 1122 ms returned []
// Phase 1: matrix 5183 rows 5156 cols
[2023-03-20 22:15:25] [INFO ] Invariants computation overflowed in 223 ms
[2023-03-20 22:15:26] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
// Phase 1: matrix 5183 rows 5156 cols
[2023-03-20 22:15:26] [INFO ] Invariants computation overflowed in 206 ms
[2023-03-20 22:15:29] [INFO ] Dead Transitions using invariants and state equation in 3385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5156/8189 places, 5183/10235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8058 ms. Remains : 5156/8189 places, 5183/10235 transitions.
Support contains 63 out of 5156 places after structural reductions.
[2023-03-20 22:15:29] [INFO ] Flatten gal took : 314 ms
[2023-03-20 22:15:30] [INFO ] Flatten gal took : 263 ms
[2023-03-20 22:15:30] [INFO ] Input system was already deterministic with 5183 transitions.
Support contains 62 out of 5156 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 399 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 33) seen :23
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 5183 rows 5156 cols
[2023-03-20 22:15:34] [INFO ] Invariants computation overflowed in 204 ms
[2023-03-20 22:15:35] [INFO ] After 1181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 22:15:40] [INFO ] After 3652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 22:15:41] [INFO ] After 5224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 871 ms.
[2023-03-20 22:15:42] [INFO ] After 7375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 389 steps, including 0 resets, run visited all 6 properties in 30 ms. (steps per millisecond=12 )
Parikh walk visited 6 properties in 36 ms.
Computed a total of 5156 stabilizing places and 5183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5156 transition count 5183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U G(p1))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 5122 transition count 5123
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 5122 transition count 5123
Applied a total of 68 rules in 1190 ms. Remains 5122 /5156 variables (removed 34) and now considering 5123/5183 (removed 60) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:15:44] [INFO ] Invariants computation overflowed in 198 ms
[2023-03-20 22:15:46] [INFO ] Implicit Places using invariants in 2301 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:15:46] [INFO ] Invariants computation overflowed in 204 ms
[2023-03-20 22:15:47] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 3441 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:15:47] [INFO ] Invariants computation overflowed in 197 ms
[2023-03-20 22:15:51] [INFO ] Dead Transitions using invariants and state equation in 3322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5122/5156 places, 5123/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7957 ms. Remains : 5122/5156 places, 5123/5183 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s4888 1) (EQ s4889 1)), p0:(AND (EQ s3283 1) (EQ s3288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 333 steps with 10 reset in 24 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-00 finished in 8290 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)&&F(!p1))||X(G(!p0))))'
Support contains 5 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 5122 transition count 5123
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 5122 transition count 5123
Applied a total of 68 rules in 1202 ms. Remains 5122 /5156 variables (removed 34) and now considering 5123/5183 (removed 60) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:15:52] [INFO ] Invariants computation overflowed in 195 ms
[2023-03-20 22:15:54] [INFO ] Implicit Places using invariants in 2369 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:15:55] [INFO ] Invariants computation overflowed in 195 ms
[2023-03-20 22:15:56] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:15:56] [INFO ] Invariants computation overflowed in 196 ms
[2023-03-20 22:15:59] [INFO ] Dead Transitions using invariants and state equation in 3153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5122/5156 places, 5123/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7809 ms. Remains : 5122/5156 places, 5123/5183 transitions.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s3566 1) (EQ s3567 1)), p0:(OR (EQ s2375 1) (AND (EQ s3612 1) (EQ s3616 1)))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4095 ms.
Product exploration explored 100000 steps with 50000 reset in 4682 ms.
Computed a total of 5122 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5122 transition count 5123
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 (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 10 factoid took 186 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-02 finished in 18889 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||G(F(p1)))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Graph (complete) has 3080 edges and 5156 vertex of which 44 are kept as prefixes of interest. Removing 5112 places using SCC suffix rule.17 ms
Discarding 5112 places :
Also discarding 5121 output transitions
Drop transitions removed 5121 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 38 ms. Remains 43 /5156 variables (removed 5113) and now considering 61/5183 (removed 5122) transitions.
// Phase 1: matrix 61 rows 43 cols
[2023-03-20 22:16:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:16:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 22:16:10] [INFO ] Invariant cache hit.
[2023-03-20 22:16:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [2, 4, 12, 24, 28, 30, 32]
Discarding 7 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT with State Equation took 61 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/5156 places, 55/5183 transitions.
Graph (complete) has 24 edges and 36 vertex of which 30 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 24 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 24 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 23 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 23 transition count 41
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 23 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 23 transition count 38
Applied a total of 21 rules in 10 ms. Remains 23 /36 variables (removed 13) and now considering 38/55 (removed 17) transitions.
// Phase 1: matrix 38 rows 23 cols
[2023-03-20 22:16:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:16:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 22:16:10] [INFO ] Invariant cache hit.
[2023-03-20 22:16:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/5156 places, 38/5183 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 23/5156 places, 38/5183 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s13 1)), p1:(OR (NEQ s20 1) (NEQ s22 1))], 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 6003 reset in 182 ms.
Product exploration explored 100000 steps with 6006 reset in 195 ms.
Computed a total of 23 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 38
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-03 finished in 817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 5121 transition count 5122
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 5121 transition count 5122
Applied a total of 70 rules in 1186 ms. Remains 5121 /5156 variables (removed 35) and now considering 5122/5183 (removed 61) transitions.
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:12] [INFO ] Invariants computation overflowed in 205 ms
[2023-03-20 22:16:14] [INFO ] Implicit Places using invariants in 2301 ms returned []
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:14] [INFO ] Invariants computation overflowed in 207 ms
[2023-03-20 22:16:15] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 3396 ms to find 0 implicit places.
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:15] [INFO ] Invariants computation overflowed in 199 ms
[2023-03-20 22:16:18] [INFO ] Dead Transitions using invariants and state equation in 3212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5156 places, 5122/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7798 ms. Remains : 5121/5156 places, 5122/5183 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s933 1) (NEQ s937 1)), p0:(OR (EQ s1542 0) (EQ s1559 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 1745 steps with 64 reset in 59 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-04 finished in 7996 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)&&X(G(p1))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 5121 transition count 5122
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 5121 transition count 5122
Applied a total of 70 rules in 1198 ms. Remains 5121 /5156 variables (removed 35) and now considering 5122/5183 (removed 61) transitions.
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:20] [INFO ] Invariants computation overflowed in 199 ms
[2023-03-20 22:16:22] [INFO ] Implicit Places using invariants in 2250 ms returned []
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:22] [INFO ] Invariants computation overflowed in 212 ms
[2023-03-20 22:16:23] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 3338 ms to find 0 implicit places.
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:23] [INFO ] Invariants computation overflowed in 198 ms
[2023-03-20 22:16:26] [INFO ] Dead Transitions using invariants and state equation in 3332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5156 places, 5122/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7870 ms. Remains : 5121/5156 places, 5122/5183 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s4333 1) (EQ s4334 1)), p0:(OR (EQ s3925 0) (EQ s3930 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-05 finished in 8033 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||X(p1)))))'
Support contains 3 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 5121 transition count 5121
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 5121 transition count 5121
Applied a total of 70 rules in 1206 ms. Remains 5121 /5156 variables (removed 35) and now considering 5121/5183 (removed 62) transitions.
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 22:16:28] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-20 22:16:30] [INFO ] Implicit Places using invariants in 2347 ms returned []
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 22:16:30] [INFO ] Invariants computation overflowed in 196 ms
[2023-03-20 22:16:31] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 22:16:31] [INFO ] Invariants computation overflowed in 195 ms
[2023-03-20 22:16:35] [INFO ] Dead Transitions using invariants and state equation in 3381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5156 places, 5121/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8007 ms. Remains : 5121/5156 places, 5121/5183 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1433 0), p1:(AND (EQ s2301 1) (EQ s2306 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4161 ms.
Product exploration explored 100000 steps with 50000 reset in 4914 ms.
Computed a total of 5121 stabilizing places and 5121 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5121 transition count 5121
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-06 finished in 19161 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 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 5120 transition count 5120
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 5120 transition count 5120
Applied a total of 72 rules in 1165 ms. Remains 5120 /5156 variables (removed 36) and now considering 5120/5183 (removed 63) transitions.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:16:47] [INFO ] Invariants computation overflowed in 199 ms
[2023-03-20 22:16:49] [INFO ] Implicit Places using invariants in 2383 ms returned []
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:16:50] [INFO ] Invariants computation overflowed in 200 ms
[2023-03-20 22:16:50] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:16:51] [INFO ] Invariants computation overflowed in 201 ms
[2023-03-20 22:16:54] [INFO ] Dead Transitions using invariants and state equation in 3274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5120/5156 places, 5120/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7914 ms. Remains : 5120/5156 places, 5120/5183 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2420 1) (EQ s2429 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-07 finished in 8013 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(F(p1)))))'
Support contains 3 out of 5156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Graph (complete) has 3080 edges and 5156 vertex of which 49 are kept as prefixes of interest. Removing 5107 places using SCC suffix rule.12 ms
Discarding 5107 places :
Also discarding 5114 output transitions
Drop transitions removed 5114 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 24 ms. Remains 48 /5156 variables (removed 5108) and now considering 68/5183 (removed 5115) transitions.
// Phase 1: matrix 68 rows 48 cols
[2023-03-20 22:16:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 22:16:54] [INFO ] Invariant cache hit.
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [0, 4, 10, 12, 24, 26, 32, 38]
Discarding 8 places :
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Implicit Place search using SMT with State Equation took 66 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/5156 places, 60/5183 transitions.
Graph (complete) has 26 edges and 40 vertex of which 33 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 27 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 27 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 27 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 16 place count 27 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 26 transition count 43
Applied a total of 18 rules in 10 ms. Remains 26 /40 variables (removed 14) and now considering 43/60 (removed 17) transitions.
// Phase 1: matrix 43 rows 26 cols
[2023-03-20 22:16:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 22:16:54] [INFO ] Invariant cache hit.
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/5156 places, 43/5183 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 26/5156 places, 43/5183 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-08 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:(AND (EQ s9 1) (EQ s11 1)), p1:(EQ s21 1)], 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 22 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-08 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Graph (complete) has 3080 edges and 5156 vertex of which 32 are kept as prefixes of interest. Removing 5124 places using SCC suffix rule.9 ms
Discarding 5124 places :
Also discarding 5141 output transitions
Drop transitions removed 5141 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 16 ms. Remains 31 /5156 variables (removed 5125) and now considering 41/5183 (removed 5142) transitions.
// Phase 1: matrix 41 rows 31 cols
[2023-03-20 22:16:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 22:16:54] [INFO ] Invariant cache hit.
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [0, 2, 4, 8, 10, 14, 18]
Discarding 7 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 73 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/5156 places, 34/5183 transitions.
Graph (complete) has 17 edges and 24 vertex of which 17 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 12 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 12 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 12 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 16 place count 12 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 11 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 11 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 11 transition count 15
Applied a total of 20 rules in 10 ms. Remains 11 /24 variables (removed 13) and now considering 15/34 (removed 19) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-20 22:16:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 22:16:54] [INFO ] Invariant cache hit.
[2023-03-20 22:16:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/5156 places, 15/5183 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 11/5156 places, 15/5183 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-09 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 5121 transition count 5122
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 5121 transition count 5122
Applied a total of 70 rules in 1302 ms. Remains 5121 /5156 variables (removed 35) and now considering 5122/5183 (removed 61) transitions.
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:56] [INFO ] Invariants computation overflowed in 204 ms
[2023-03-20 22:16:58] [INFO ] Implicit Places using invariants in 2239 ms returned []
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:58] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-20 22:16:59] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
// Phase 1: matrix 5122 rows 5121 cols
[2023-03-20 22:16:59] [INFO ] Invariants computation overflowed in 198 ms
[2023-03-20 22:17:02] [INFO ] Dead Transitions using invariants and state equation in 3281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5156 places, 5122/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7870 ms. Remains : 5121/5156 places, 5122/5183 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s2288 0) (EQ s2307 0)), p0:(AND (EQ s1724 1) (EQ s1726 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 801 steps with 39 reset in 26 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-10 finished in 8032 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||X((p1&&F(p2))))))&&G(p3))))'
Support contains 5 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 5123 transition count 5124
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 5123 transition count 5124
Applied a total of 66 rules in 1256 ms. Remains 5123 /5156 variables (removed 33) and now considering 5124/5183 (removed 59) transitions.
// Phase 1: matrix 5124 rows 5123 cols
[2023-03-20 22:17:04] [INFO ] Invariants computation overflowed in 208 ms
[2023-03-20 22:17:06] [INFO ] Implicit Places using invariants in 2388 ms returned []
// Phase 1: matrix 5124 rows 5123 cols
[2023-03-20 22:17:06] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-20 22:17:07] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 3462 ms to find 0 implicit places.
// Phase 1: matrix 5124 rows 5123 cols
[2023-03-20 22:17:07] [INFO ] Invariants computation overflowed in 194 ms
[2023-03-20 22:17:10] [INFO ] Dead Transitions using invariants and state equation in 3382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5123/5156 places, 5124/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8100 ms. Remains : 5123/5156 places, 5124/5183 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 6}], [{ cond=(AND p3 p0), acceptance={} source=1 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p3 p0) (AND p3 p1 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(NOT p3), acceptance={0} source=2 dest: 6}], [{ cond=(OR (AND p3 p0) (AND p3 p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 6}], [{ cond=p3, acceptance={} source=4 dest: 1}, { cond=(NOT p3), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p3:(AND (EQ s4315 1) (EQ s4318 1)), p0:(AND (EQ s4650 1) (EQ s4652 1)), p1:(OR (EQ s4315 0) (EQ s4318 0)), p2:(EQ s4871 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-11 finished in 8538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 5122 transition count 5123
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 5122 transition count 5123
Applied a total of 68 rules in 1186 ms. Remains 5122 /5156 variables (removed 34) and now considering 5123/5183 (removed 60) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:17:12] [INFO ] Invariants computation overflowed in 198 ms
[2023-03-20 22:17:14] [INFO ] Implicit Places using invariants in 2388 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:17:15] [INFO ] Invariants computation overflowed in 195 ms
[2023-03-20 22:17:15] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 3443 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:17:16] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-20 22:17:19] [INFO ] Dead Transitions using invariants and state equation in 3421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5122/5156 places, 5123/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8052 ms. Remains : 5122/5156 places, 5123/5183 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s1325 0) (EQ s1328 0)), p1:(OR (EQ s4647 0) (EQ s4649 0))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4156 ms.
Product exploration explored 100000 steps with 50000 reset in 4972 ms.
Computed a total of 5122 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5122 transition count 5123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 139 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-12 finished in 19413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((!p1&&X(p2)))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 5120 transition count 5120
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 5120 transition count 5120
Applied a total of 72 rules in 1173 ms. Remains 5120 /5156 variables (removed 36) and now considering 5120/5183 (removed 63) transitions.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:17:32] [INFO ] Invariants computation overflowed in 201 ms
[2023-03-20 22:17:34] [INFO ] Implicit Places using invariants in 2374 ms returned []
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:17:34] [INFO ] Invariants computation overflowed in 197 ms
[2023-03-20 22:17:35] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:17:35] [INFO ] Invariants computation overflowed in 194 ms
[2023-03-20 22:17:38] [INFO ] Dead Transitions using invariants and state equation in 3310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5120/5156 places, 5120/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7929 ms. Remains : 5120/5156 places, 5120/5183 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p1), true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p2:(NEQ s3401 1), p0:(AND (EQ s2962 1) (EQ s2963 1)), p1:(AND (EQ s1614 1) (EQ s3401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3934 ms.
Product exploration explored 100000 steps with 33333 reset in 4718 ms.
Computed a total of 5120 stabilizing places and 5120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 5120
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) (NOT p1))
Knowledge based reduction with 22 factoid took 814 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 finished in 19497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 4 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 5122 transition count 5123
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 5122 transition count 5123
Applied a total of 68 rules in 1188 ms. Remains 5122 /5156 variables (removed 34) and now considering 5123/5183 (removed 60) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:17:51] [INFO ] Invariants computation overflowed in 203 ms
[2023-03-20 22:17:53] [INFO ] Implicit Places using invariants in 2372 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:17:53] [INFO ] Invariants computation overflowed in 210 ms
[2023-03-20 22:17:54] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 3454 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2023-03-20 22:17:55] [INFO ] Invariants computation overflowed in 192 ms
[2023-03-20 22:17:58] [INFO ] Dead Transitions using invariants and state equation in 3326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5122/5156 places, 5123/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7970 ms. Remains : 5122/5156 places, 5123/5183 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s3743 0) (EQ s3748 0)), p1:(OR (NEQ s1562 1) (NEQ s1565 1))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 4194 reset in 3128 ms.
Product exploration explored 100000 steps with 4076 reset in 4145 ms.
Computed a total of 5122 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5122 transition count 5123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-14 finished in 17462 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((X(((p1 U p2)||G(p3)))&&p0))))'
Support contains 10 out of 5156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5156/5156 places, 5183/5183 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 5125 transition count 5129
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 5125 transition count 5129
Applied a total of 62 rules in 1157 ms. Remains 5125 /5156 variables (removed 31) and now considering 5129/5183 (removed 54) transitions.
// Phase 1: matrix 5129 rows 5125 cols
[2023-03-20 22:18:09] [INFO ] Invariants computation overflowed in 200 ms
[2023-03-20 22:18:11] [INFO ] Implicit Places using invariants in 2325 ms returned []
// Phase 1: matrix 5129 rows 5125 cols
[2023-03-20 22:18:11] [INFO ] Invariants computation overflowed in 192 ms
[2023-03-20 22:18:12] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 3375 ms to find 0 implicit places.
// Phase 1: matrix 5129 rows 5125 cols
[2023-03-20 22:18:12] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-20 22:18:15] [INFO ] Dead Transitions using invariants and state equation in 3347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5125/5156 places, 5129/5183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7881 ms. Remains : 5125/5156 places, 5129/5183 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2) p3) (AND (NOT p2) p1 p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s4707 1) (EQ s4708 1)), p2:(AND (EQ s1069 1) (EQ s1076 1)), p1:(AND (EQ s2436 1) (EQ s2441 1) (EQ s3029 1) (EQ s3034 1)), p3:(AND (EQ s1942 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-15 finished in 8141 ms.
All properties solved by simple procedures.
Total runtime 175203 ms.
ITS solved all properties within timeout
BK_STOP 1679350697040
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="ViralEpidemic-PT-S02D1C1A10"
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 ViralEpidemic-PT-S02D1C1A10, 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 r489-tall-167912707901244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S02D1C1A10.tgz
mv ViralEpidemic-PT-S02D1C1A10 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 ;