fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905977700076
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldRVs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
537.623 60990.00 94346.00 207.70 F?F?F??FFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977700076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K Feb 26 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 61K 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 ShieldRVs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679295210932

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=ShieldRVs-PT-005B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 06:53:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 06:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 06:53:33] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-20 06:53:33] [INFO ] Transformed 203 places.
[2023-03-20 06:53:33] [INFO ] Transformed 228 transitions.
[2023-03-20 06:53:33] [INFO ] Found NUPN structural information;
[2023-03-20 06:53:33] [INFO ] Parsed PT model containing 203 places and 228 transitions and 720 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-005B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 228/228 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 177 transition count 202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 177 transition count 202
Applied a total of 52 rules in 27 ms. Remains 177 /203 variables (removed 26) and now considering 202/228 (removed 26) transitions.
// Phase 1: matrix 202 rows 177 cols
[2023-03-20 06:53:33] [INFO ] Computed 21 place invariants in 8 ms
[2023-03-20 06:53:33] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-20 06:53:33] [INFO ] Invariant cache hit.
[2023-03-20 06:53:33] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-20 06:53:33] [INFO ] Invariant cache hit.
[2023-03-20 06:53:34] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 177/203 places, 202/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 177/203 places, 202/228 transitions.
Support contains 41 out of 177 places after structural reductions.
[2023-03-20 06:53:34] [INFO ] Flatten gal took : 38 ms
[2023-03-20 06:53:34] [INFO ] Flatten gal took : 16 ms
[2023-03-20 06:53:34] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 37 out of 177 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 29) seen :28
Finished Best-First random walk after 888 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=296 )
FORMULA ShieldRVs-PT-005B-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (F(!p0)&&p1))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 26 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:53:34] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-20 06:53:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 06:53:35] [INFO ] Invariant cache hit.
[2023-03-20 06:53:35] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-20 06:53:35] [INFO ] Invariant cache hit.
[2023-03-20 06:53:35] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 333 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true, true]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s124 1), p1:(AND (EQ s72 1) (EQ s124 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-00 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&X(F(((p1&&X(F(!p2)))||G(F(!p2)))))))))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 168 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 167 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 167 transition count 192
Applied a total of 20 rules in 13 ms. Remains 167 /177 variables (removed 10) and now considering 192/202 (removed 10) transitions.
// Phase 1: matrix 192 rows 167 cols
[2023-03-20 06:53:35] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:53:35] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-20 06:53:35] [INFO ] Invariant cache hit.
[2023-03-20 06:53:35] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-20 06:53:35] [INFO ] Invariant cache hit.
[2023-03-20 06:53:35] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/177 places, 192/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 167/177 places, 192/202 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s101 1), p1:(NEQ s95 1), p2:(AND (EQ s54 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 916 reset in 262 ms.
Product exploration explored 100000 steps with 914 reset in 214 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/167 stabilizing places and 39/192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (OR p2 p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 117 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (OR p2 p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-20 06:53:37] [INFO ] Invariant cache hit.
[2023-03-20 06:53:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 06:53:37] [INFO ] Invariant cache hit.
[2023-03-20 06:53:37] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-20 06:53:37] [INFO ] Invariant cache hit.
[2023-03-20 06:53:37] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 167/167 places, 192/192 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/167 stabilizing places and 39/192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (OR p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 114 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (OR p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 913 reset in 155 ms.
Product exploration explored 100000 steps with 911 reset in 162 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 192/192 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 167 transition count 192
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 19 place count 167 transition count 196
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 29 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 166 transition count 195
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 166 transition count 195
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 93 place count 166 transition count 195
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 126 place count 133 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 159 place count 133 transition count 162
Deduced a syphon composed of 57 places in 2 ms
Applied a total of 159 rules in 61 ms. Remains 133 /167 variables (removed 34) and now considering 162/192 (removed 30) transitions.
[2023-03-20 06:53:39] [INFO ] Redundant transitions in 35 ms returned [161]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 161 rows 133 cols
[2023-03-20 06:53:40] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/167 places, 161/192 transitions.
Deduced a syphon composed of 57 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 133/167 places, 161/192 transitions.
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 167 cols
[2023-03-20 06:53:40] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-20 06:53:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 06:53:40] [INFO ] Invariant cache hit.
[2023-03-20 06:53:40] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-20 06:53:40] [INFO ] Invariant cache hit.
[2023-03-20 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 167/167 places, 192/192 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-01 finished in 4831 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((G(!p0) U (G(F(p2))&&p1)))))'
Support contains 7 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 176 transition count 183
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 158 transition count 183
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 36 place count 158 transition count 158
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 86 place count 133 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 95 place count 124 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 124 transition count 149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 104 place count 124 transition count 145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 120 transition count 145
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 198 place count 77 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 75 transition count 100
Applied a total of 200 rules in 27 ms. Remains 75 /177 variables (removed 102) and now considering 100/202 (removed 102) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-20 06:53:40] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:53:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 06:53:40] [INFO ] Invariant cache hit.
[2023-03-20 06:53:40] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-20 06:53:40] [INFO ] Redundant transitions in 24 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 99 rows 75 cols
[2023-03-20 06:53:40] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/177 places, 99/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 75/177 places, 99/202 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s21 1) (EQ s31 1)), p0:(AND (EQ s50 1) (EQ s52 1) (EQ s57 1)), p2:(EQ s20 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 16700 steps with 200 reset in 113 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-02 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 176 transition count 182
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 157 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 156 transition count 181
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 40 place count 156 transition count 155
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 92 place count 130 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 122 transition count 147
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 122 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 108 place count 122 transition count 144
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 119 transition count 144
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 202 place count 75 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 73 transition count 98
Applied a total of 204 rules in 26 ms. Remains 73 /177 variables (removed 104) and now considering 98/202 (removed 104) transitions.
// Phase 1: matrix 98 rows 73 cols
[2023-03-20 06:53:41] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:53:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 06:53:41] [INFO ] Invariant cache hit.
[2023-03-20 06:53:41] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-20 06:53:41] [INFO ] Redundant transitions in 31 ms returned [97]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 97 rows 73 cols
[2023-03-20 06:53:41] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:53:41] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/177 places, 97/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 73/177 places, 97/202 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 0) (EQ s27 0)), p1:(OR (EQ s67 0) (EQ s71 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5681 reset in 204 ms.
Product exploration explored 100000 steps with 5741 reset in 216 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 178 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-20 06:53:43] [INFO ] Invariant cache hit.
[2023-03-20 06:53:43] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-20 06:53:43] [INFO ] Invariant cache hit.
[2023-03-20 06:53:43] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-20 06:53:43] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-20 06:53:43] [INFO ] Invariant cache hit.
[2023-03-20 06:53:43] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 73/73 places, 97/97 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 667 steps, including 8 resets, run visited all 2 properties in 4 ms. (steps per millisecond=166 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5879 reset in 201 ms.
Product exploration explored 100000 steps with 5719 reset in 218 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-20 06:53:45] [INFO ] Invariant cache hit.
[2023-03-20 06:53:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 06:53:45] [INFO ] Invariant cache hit.
[2023-03-20 06:53:45] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-20 06:53:45] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-20 06:53:45] [INFO ] Invariant cache hit.
[2023-03-20 06:53:45] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 73/73 places, 97/97 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-03 finished in 4569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 10 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:53:45] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:53:45] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-20 06:53:45] [INFO ] Invariant cache hit.
[2023-03-20 06:53:46] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-20 06:53:46] [INFO ] Invariant cache hit.
[2023-03-20 06:53:46] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s43 1), p1:(EQ s117 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-04 finished in 764 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(F(p1))&&(G(!p0) U G(p2)))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 9 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:53:46] [INFO ] Computed 21 place invariants in 6 ms
[2023-03-20 06:53:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 06:53:46] [INFO ] Invariant cache hit.
[2023-03-20 06:53:46] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-20 06:53:46] [INFO ] Invariant cache hit.
[2023-03-20 06:53:46] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p2 p0), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s28 1), p0:(EQ s85 1), p1:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7943 reset in 164 ms.
Product exploration explored 100000 steps with 7944 reset in 209 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/168 stabilizing places and 40/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1221 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Finished random walk after 1524 steps, including 6 resets, run visited all 6 properties in 10 ms. (steps per millisecond=152 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F p1), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1395 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
[2023-03-20 06:53:51] [INFO ] Invariant cache hit.
[2023-03-20 06:53:51] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:53:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-20 06:53:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:53:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 57 ms returned sat
[2023-03-20 06:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:53:51] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-20 06:53:52] [INFO ] Deduced a trap composed of 26 places in 721 ms of which 18 ms to minimize.
[2023-03-20 06:53:52] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2023-03-20 06:53:53] [INFO ] Deduced a trap composed of 23 places in 1261 ms of which 31 ms to minimize.
[2023-03-20 06:53:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2147 ms
[2023-03-20 06:53:53] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-20 06:53:54] [INFO ] Added : 184 causal constraints over 39 iterations in 1049 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-20 06:53:54] [INFO ] Invariant cache hit.
[2023-03-20 06:53:54] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 06:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:53:55] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-20 06:53:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:53:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:53:55] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-20 06:53:55] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-20 06:53:55] [INFO ] Added : 190 causal constraints over 39 iterations in 642 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2023-03-20 06:53:55] [INFO ] Invariant cache hit.
[2023-03-20 06:53:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 06:53:55] [INFO ] Invariant cache hit.
[2023-03-20 06:53:56] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-20 06:53:56] [INFO ] Invariant cache hit.
[2023-03-20 06:53:56] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 168/168 places, 193/193 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/168 stabilizing places and 40/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 694 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Finished random walk after 598 steps, including 2 resets, run visited all 6 properties in 6 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 726 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
[2023-03-20 06:53:58] [INFO ] Invariant cache hit.
[2023-03-20 06:53:58] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 06:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:53:58] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-20 06:53:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:53:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 06:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:53:58] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-20 06:53:58] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2023-03-20 06:53:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2023-03-20 06:53:59] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2023-03-20 06:53:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2023-03-20 06:53:59] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-20 06:54:00] [INFO ] Added : 184 causal constraints over 39 iterations in 962 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-20 06:54:00] [INFO ] Invariant cache hit.
[2023-03-20 06:54:00] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:00] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-20 06:54:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 06:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:00] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-20 06:54:00] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 06:54:01] [INFO ] Added : 190 causal constraints over 39 iterations in 692 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 7956 reset in 164 ms.
Product exploration explored 100000 steps with 8140 reset in 156 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 168 transition count 193
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 20 place count 168 transition count 197
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 168 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 167 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 167 transition count 196
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 95 place count 167 transition count 196
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 130 place count 132 transition count 161
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 165 place count 132 transition count 161
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 165 rules in 21 ms. Remains 132 /168 variables (removed 36) and now considering 161/193 (removed 32) transitions.
[2023-03-20 06:54:02] [INFO ] Redundant transitions in 39 ms returned [160]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 160 rows 132 cols
[2023-03-20 06:54:02] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-20 06:54:02] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/168 places, 160/193 transitions.
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 132/168 places, 160/193 transitions.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:54:02] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:54:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 06:54:02] [INFO ] Invariant cache hit.
[2023-03-20 06:54:02] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-20 06:54:02] [INFO ] Invariant cache hit.
[2023-03-20 06:54:02] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 168/168 places, 193/193 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-05 finished in 16368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(F(p0) U X(G(p1)))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 6 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:54:02] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:54:02] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 06:54:02] [INFO ] Invariant cache hit.
[2023-03-20 06:54:03] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-20 06:54:03] [INFO ] Invariant cache hit.
[2023-03-20 06:54:03] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s109 1), p1:(OR (EQ s67 1) (EQ s70 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 3088 reset in 209 ms.
Product exploration explored 100000 steps with 3034 reset in 177 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/168 stabilizing places and 39/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-20 06:54:04] [INFO ] Invariant cache hit.
[2023-03-20 06:54:04] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 06:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:04] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-20 06:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 06:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:04] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-20 06:54:05] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-20 06:54:05] [INFO ] Added : 183 causal constraints over 39 iterations in 822 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 167 transition count 171
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 146 transition count 171
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 42 place count 146 transition count 146
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 121 transition count 146
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 76 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 74 transition count 99
Applied a total of 184 rules in 17 ms. Remains 74 /168 variables (removed 94) and now considering 99/193 (removed 94) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-20 06:54:05] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 06:54:05] [INFO ] Invariant cache hit.
[2023-03-20 06:54:05] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-20 06:54:05] [INFO ] Redundant transitions in 29 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 98 rows 74 cols
[2023-03-20 06:54:06] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/168 places, 98/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 74/168 places, 98/193 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/74 stabilizing places and 2/98 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-20 06:54:06] [INFO ] Invariant cache hit.
[2023-03-20 06:54:06] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:06] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-20 06:54:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 06:54:06] [INFO ] Computed and/alt/rep : 86/345/86 causal constraints (skipped 10 transitions) in 7 ms.
[2023-03-20 06:54:06] [INFO ] Added : 52 causal constraints over 11 iterations in 86 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27549 reset in 134 ms.
Product exploration explored 100000 steps with 27497 reset in 189 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 97
Applied a total of 2 rules in 6 ms. Remains 73 /74 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 73 cols
[2023-03-20 06:54:07] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:54:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 06:54:07] [INFO ] Invariant cache hit.
[2023-03-20 06:54:07] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-20 06:54:07] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-20 06:54:07] [INFO ] Invariant cache hit.
[2023-03-20 06:54:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/74 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 73/74 places, 97/98 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-06 finished in 4722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 170 transition count 195
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 169 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 169 transition count 194
Applied a total of 16 rules in 6 ms. Remains 169 /177 variables (removed 8) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 169 cols
[2023-03-20 06:54:07] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:54:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 06:54:07] [INFO ] Invariant cache hit.
[2023-03-20 06:54:07] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-20 06:54:07] [INFO ] Invariant cache hit.
[2023-03-20 06:54:07] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/177 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 169/177 places, 194/202 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s57 1) (OR (EQ s17 1) (EQ s115 1))), p0:(NEQ s57 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]]
Entered a terminal (fully accepting) state of product in 118 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-08 finished in 426 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||X(((G(p1) U p2)||X(p3))))))'
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 6 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:54:07] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 06:54:08] [INFO ] Invariant cache hit.
[2023-03-20 06:54:08] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-20 06:54:08] [INFO ] Invariant cache hit.
[2023-03-20 06:54:08] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 1}]], initial=7, aps=[p1:(EQ s113 1), p0:(AND (EQ s155 1) (EQ s164 1)), p2:(EQ s59 1), p3:(EQ s72 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-09 finished in 632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 176 transition count 180
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 155 transition count 180
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 42 place count 155 transition count 155
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 130 transition count 155
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 122 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 122 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 108 place count 122 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 118 transition count 143
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 204 place count 74 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 72 transition count 97
Applied a total of 206 rules in 31 ms. Remains 72 /177 variables (removed 105) and now considering 97/202 (removed 105) transitions.
// Phase 1: matrix 97 rows 72 cols
[2023-03-20 06:54:08] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 06:54:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 06:54:08] [INFO ] Invariant cache hit.
[2023-03-20 06:54:08] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-20 06:54:08] [INFO ] Redundant transitions in 24 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 96 rows 72 cols
[2023-03-20 06:54:08] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:08] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/177 places, 96/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 291 ms. Remains : 72/177 places, 96/202 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s66 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 81 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-13 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(G(p2))))))'
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Applied a total of 16 rules in 5 ms. Remains 169 /177 variables (removed 8) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 169 cols
[2023-03-20 06:54:08] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 06:54:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 06:54:09] [INFO ] Invariant cache hit.
[2023-03-20 06:54:09] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-20 06:54:09] [INFO ] Invariant cache hit.
[2023-03-20 06:54:09] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/177 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 169/177 places, 194/202 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s18 0) (EQ s21 0) (EQ s29 0)), p0:(EQ s48 1), p2:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 258 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-14 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 7 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-20 06:54:09] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 06:54:09] [INFO ] Invariant cache hit.
[2023-03-20 06:54:09] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-20 06:54:09] [INFO ] Invariant cache hit.
[2023-03-20 06:54:09] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-15 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&X(F(((p1&&X(F(!p2)))||G(F(!p2)))))))))))'
Found a Shortening insensitive property : ShieldRVs-PT-005B-LTLFireability-01
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 176 transition count 181
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 156 transition count 181
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 40 place count 156 transition count 157
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 88 place count 132 transition count 157
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 97 place count 123 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 106 place count 123 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 123 transition count 144
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 119 transition count 144
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 198 place count 77 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 75 transition count 100
Applied a total of 200 rules in 36 ms. Remains 75 /177 variables (removed 102) and now considering 100/202 (removed 102) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-20 06:54:10] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 06:54:10] [INFO ] Invariant cache hit.
[2023-03-20 06:54:10] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-20 06:54:10] [INFO ] Invariant cache hit.
[2023-03-20 06:54:10] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 75/177 places, 100/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 357 ms. Remains : 75/177 places, 100/202 transitions.
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s47 1), p1:(NEQ s43 1), p2:(AND (EQ s22 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3638 reset in 174 ms.
Product exploration explored 100000 steps with 3618 reset in 192 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/75 stabilizing places and 2/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 406 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 25 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1))), (X (X p1)), (F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 550 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-20 06:54:12] [INFO ] Invariant cache hit.
[2023-03-20 06:54:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 06:54:13] [INFO ] Invariant cache hit.
[2023-03-20 06:54:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-20 06:54:13] [INFO ] Invariant cache hit.
[2023-03-20 06:54:13] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 75/75 places, 100/100 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/75 stabilizing places and 2/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 368 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 28 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p1))), (X (X p1)), (F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 533 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 3603 reset in 188 ms.
Product exploration explored 100000 steps with 3600 reset in 190 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-20 06:54:15] [INFO ] Redundant transitions in 28 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 99 rows 75 cols
[2023-03-20 06:54:15] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 99/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 75/75 places, 99/100 transitions.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-20 06:54:15] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 06:54:15] [INFO ] Invariant cache hit.
[2023-03-20 06:54:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-20 06:54:15] [INFO ] Invariant cache hit.
[2023-03-20 06:54:16] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 75/75 places, 100/100 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-01 finished in 6066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(p1))&&(G(!p0) U G(p2)))))'
Found a Shortening insensitive property : ShieldRVs-PT-005B-LTLFireability-05
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p2 p0), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 176 transition count 180
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 155 transition count 180
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 42 place count 155 transition count 156
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 90 place count 131 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 98 place count 123 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 123 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 123 transition count 144
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 119 transition count 144
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 200 place count 76 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 74 transition count 99
Applied a total of 202 rules in 26 ms. Remains 74 /177 variables (removed 103) and now considering 99/202 (removed 103) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-20 06:54:16] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-20 06:54:16] [INFO ] Invariant cache hit.
[2023-03-20 06:54:17] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-20 06:54:17] [INFO ] Invariant cache hit.
[2023-03-20 06:54:17] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/177 places, 99/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 329 ms. Remains : 74/177 places, 99/202 transitions.
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s11 1), p0:(EQ s36 1), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31522 reset in 179 ms.
Product exploration explored 100000 steps with 31291 reset in 221 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/74 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1329 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Finished random walk after 512 steps, including 6 resets, run visited all 6 properties in 4 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F p1), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1085 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
[2023-03-20 06:54:20] [INFO ] Invariant cache hit.
[2023-03-20 06:54:20] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:20] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 06:54:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:21] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-20 06:54:21] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2023-03-20 06:54:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-20 06:54:21] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-20 06:54:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2023-03-20 06:54:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 181 ms
[2023-03-20 06:54:21] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 10 ms.
[2023-03-20 06:54:21] [INFO ] Added : 33 causal constraints over 7 iterations in 91 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-20 06:54:21] [INFO ] Invariant cache hit.
[2023-03-20 06:54:21] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:21] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-20 06:54:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-20 06:54:21] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 8 ms.
[2023-03-20 06:54:21] [INFO ] Added : 78 causal constraints over 16 iterations in 183 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-20 06:54:21] [INFO ] Invariant cache hit.
[2023-03-20 06:54:21] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 06:54:21] [INFO ] Invariant cache hit.
[2023-03-20 06:54:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-20 06:54:21] [INFO ] Invariant cache hit.
[2023-03-20 06:54:21] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 74/74 places, 99/99 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/74 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 704 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Finished random walk after 183 steps, including 2 resets, run visited all 6 properties in 4 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1153 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
[2023-03-20 06:54:24] [INFO ] Invariant cache hit.
[2023-03-20 06:54:25] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:25] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-20 06:54:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:25] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-20 06:54:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-20 06:54:25] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-20 06:54:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-20 06:54:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2023-03-20 06:54:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
[2023-03-20 06:54:25] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 7 ms.
[2023-03-20 06:54:25] [INFO ] Added : 33 causal constraints over 7 iterations in 70 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-20 06:54:25] [INFO ] Invariant cache hit.
[2023-03-20 06:54:25] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:25] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 06:54:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:25] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-20 06:54:25] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 8 ms.
[2023-03-20 06:54:25] [INFO ] Added : 78 causal constraints over 16 iterations in 150 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 31390 reset in 159 ms.
Product exploration explored 100000 steps with 31169 reset in 181 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-20 06:54:26] [INFO ] Redundant transitions in 41 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 98 rows 74 cols
[2023-03-20 06:54:26] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 06:54:26] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 98/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 140 ms. Remains : 74/74 places, 98/99 transitions.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 74 /74 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-20 06:54:26] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 06:54:27] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 06:54:27] [INFO ] Invariant cache hit.
[2023-03-20 06:54:27] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-20 06:54:27] [INFO ] Invariant cache hit.
[2023-03-20 06:54:27] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 74/74 places, 99/99 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-05 finished in 11062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(F(p0) U X(G(p1)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-005B-LTLFireability-06
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 176 transition count 180
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 155 transition count 180
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 42 place count 155 transition count 155
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 130 transition count 155
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 122 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 122 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 108 place count 122 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 118 transition count 143
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 200 place count 76 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 74 transition count 99
Applied a total of 202 rules in 18 ms. Remains 74 /177 variables (removed 103) and now considering 99/202 (removed 103) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-20 06:54:27] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 06:54:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 06:54:27] [INFO ] Invariant cache hit.
[2023-03-20 06:54:27] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-20 06:54:27] [INFO ] Invariant cache hit.
[2023-03-20 06:54:27] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/177 places, 99/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 251 ms. Remains : 74/177 places, 99/202 transitions.
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s46 1), p1:(OR (EQ s28 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27425 reset in 155 ms.
Product exploration explored 100000 steps with 27767 reset in 159 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/74 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-20 06:54:29] [INFO ] Invariant cache hit.
[2023-03-20 06:54:29] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 06:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:29] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 06:54:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:29] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-20 06:54:29] [INFO ] Computed and/alt/rep : 86/344/86 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-20 06:54:29] [INFO ] Added : 77 causal constraints over 16 iterations in 149 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-20 06:54:29] [INFO ] Invariant cache hit.
[2023-03-20 06:54:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 06:54:29] [INFO ] Invariant cache hit.
[2023-03-20 06:54:29] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-20 06:54:29] [INFO ] Redundant transitions in 24 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 98 rows 74 cols
[2023-03-20 06:54:29] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 06:54:29] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 98/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 74/74 places, 98/99 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/74 stabilizing places and 2/98 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-20 06:54:30] [INFO ] Invariant cache hit.
[2023-03-20 06:54:30] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 06:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:30] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:54:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-20 06:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:54:30] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:54:30] [INFO ] Computed and/alt/rep : 86/345/86 causal constraints (skipped 10 transitions) in 6 ms.
[2023-03-20 06:54:30] [INFO ] Added : 67 causal constraints over 15 iterations in 103 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27673 reset in 131 ms.
Product exploration explored 100000 steps with 27622 reset in 139 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 97
Applied a total of 2 rules in 3 ms. Remains 73 /74 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 73 cols
[2023-03-20 06:54:30] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 06:54:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 06:54:30] [INFO ] Invariant cache hit.
[2023-03-20 06:54:30] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-20 06:54:30] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-20 06:54:30] [INFO ] Invariant cache hit.
[2023-03-20 06:54:30] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/74 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 73/74 places, 97/98 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-06 finished in 3720 ms.
[2023-03-20 06:54:31] [INFO ] Flatten gal took : 11 ms
[2023-03-20 06:54:31] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 06:54:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 202 transitions and 668 arcs took 2 ms.
Total runtime 57795 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2976/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-005B-LTLFireability-01
Could not compute solution for formula : ShieldRVs-PT-005B-LTLFireability-03
Could not compute solution for formula : ShieldRVs-PT-005B-LTLFireability-05
Could not compute solution for formula : ShieldRVs-PT-005B-LTLFireability-06

BK_STOP 1679295271922

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVs-PT-005B-LTLFireability-01
ltl formula formula --ltl=/tmp/2976/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 177 places, 202 transitions and 668 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-005B-LTLFireability-03
ltl formula formula --ltl=/tmp/2976/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 177 places, 202 transitions and 668 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldRVs-PT-005B-LTLFireability-05
ltl formula formula --ltl=/tmp/2976/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 177 places, 202 transitions and 668 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-005B-LTLFireability-06
ltl formula formula --ltl=/tmp/2976/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 177 places, 202 transitions and 668 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2976/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2976/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2976/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2976/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ShieldRVs-PT-005B"
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 ShieldRVs-PT-005B, 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 r425-tajo-167905977700076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-005B.tgz
mv ShieldRVs-PT-005B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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