About the Execution of LTSMin+red for ShieldPPPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2594.388 | 1581113.00 | 1923610.00 | 227.10 | ?FT?FF??FF?FFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717100516.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100516
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K Feb 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 02:04 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 907K 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 ShieldPPPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679457829467
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=ShieldPPPs-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:03:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:03:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:03:52] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-22 04:03:52] [INFO ] Transformed 3103 places.
[2023-03-22 04:03:52] [INFO ] Transformed 2603 transitions.
[2023-03-22 04:03:52] [INFO ] Found NUPN structural information;
[2023-03-22 04:03:52] [INFO ] Parsed PT model containing 3103 places and 2603 transitions and 10006 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-100A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 455 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:03:53] [INFO ] Computed 1101 place invariants in 56 ms
[2023-03-22 04:03:56] [INFO ] Implicit Places using invariants in 3045 ms returned []
[2023-03-22 04:03:56] [INFO ] Invariant cache hit.
[2023-03-22 04:03:59] [INFO ] Implicit Places using invariants and state equation in 2934 ms returned []
Implicit Place search using SMT with State Equation took 6022 ms to find 0 implicit places.
[2023-03-22 04:03:59] [INFO ] Invariant cache hit.
[2023-03-22 04:04:02] [INFO ] Dead Transitions using invariants and state equation in 2661 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9156 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 52 out of 3103 places after structural reductions.
[2023-03-22 04:04:03] [INFO ] Flatten gal took : 312 ms
[2023-03-22 04:04:03] [INFO ] Flatten gal took : 237 ms
[2023-03-22 04:04:03] [INFO ] Input system was already deterministic with 2603 transitions.
Support contains 50 out of 3103 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-22 04:04:07] [INFO ] Invariant cache hit.
[2023-03-22 04:04:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 370 ms returned sat
[2023-03-22 04:04:10] [INFO ] After 2979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 04:04:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 397 ms returned sat
[2023-03-22 04:04:35] [INFO ] After 22180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 04:04:35] [INFO ] After 22192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 04:04:35] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 448 ms.
Support contains 27 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 876 times.
Drop transitions removed 876 transitions
Iterating global reduction 0 with 876 rules applied. Total rules applied 880 place count 3101 transition count 2601
Applied a total of 880 rules in 1010 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1010 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 93726 steps, run timeout after 6003 ms. (steps per millisecond=15 ) properties seen :{0=1, 1=1, 2=1, 3=1, 7=1, 9=1}
Probabilistic random walk after 93726 steps, saw 90545 distinct states, run finished after 6005 ms. (steps per millisecond=15 ) properties seen :6
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:04:45] [INFO ] Computed 1101 place invariants in 137 ms
[2023-03-22 04:04:46] [INFO ] [Real]Absence check using 1043 positive place invariants in 378 ms returned sat
[2023-03-22 04:04:46] [INFO ] [Real]Absence check using 1043 positive and 58 generalized place invariants in 34 ms returned sat
[2023-03-22 04:04:50] [INFO ] After 4924ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:04:52] [INFO ] [Nat]Absence check using 1043 positive place invariants in 382 ms returned sat
[2023-03-22 04:04:52] [INFO ] [Nat]Absence check using 1043 positive and 58 generalized place invariants in 34 ms returned sat
[2023-03-22 04:05:15] [INFO ] After 22973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:05:15] [INFO ] After 22979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-22 04:05:15] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 10 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 3101 transition count 2601
Applied a total of 15 rules in 350 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 80774 steps, run timeout after 6001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 80774 steps, saw 77793 distinct states, run finished after 6002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:05:26] [INFO ] Computed 1101 place invariants in 59 ms
[2023-03-22 04:05:27] [INFO ] [Real]Absence check using 1044 positive place invariants in 240 ms returned sat
[2023-03-22 04:05:27] [INFO ] [Real]Absence check using 1044 positive and 57 generalized place invariants in 25 ms returned sat
[2023-03-22 04:05:31] [INFO ] After 5413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:05:32] [INFO ] [Nat]Absence check using 1044 positive place invariants in 266 ms returned sat
[2023-03-22 04:05:32] [INFO ] [Nat]Absence check using 1044 positive and 57 generalized place invariants in 94 ms returned sat
[2023-03-22 04:05:56] [INFO ] After 23505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:05:56] [INFO ] After 23511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 04:05:56] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 181 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 175 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:05:57] [INFO ] Invariant cache hit.
[2023-03-22 04:05:59] [INFO ] Implicit Places using invariants in 2769 ms returned []
[2023-03-22 04:05:59] [INFO ] Invariant cache hit.
[2023-03-22 04:06:06] [INFO ] Implicit Places using invariants and state equation in 7052 ms returned []
Implicit Place search using SMT with State Equation took 9850 ms to find 0 implicit places.
[2023-03-22 04:06:07] [INFO ] Redundant transitions in 240 ms returned []
[2023-03-22 04:06:07] [INFO ] Invariant cache hit.
[2023-03-22 04:06:11] [INFO ] Dead Transitions using invariants and state equation in 4220 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14500 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 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' '!((F(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 749 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:06:12] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-22 04:06:15] [INFO ] Implicit Places using invariants in 2811 ms returned []
[2023-03-22 04:06:15] [INFO ] Invariant cache hit.
[2023-03-22 04:06:18] [INFO ] Implicit Places using invariants and state equation in 2890 ms returned []
Implicit Place search using SMT with State Equation took 5709 ms to find 0 implicit places.
[2023-03-22 04:06:18] [INFO ] Redundant transitions in 139 ms returned []
[2023-03-22 04:06:18] [INFO ] Invariant cache hit.
[2023-03-22 04:06:20] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8458 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NEQ s2749 1) (NOT (AND (EQ s2175 1) (EQ s2191 1)))), p1:(AND (EQ s2175 1) (EQ s2191 1)), p0:(AND (EQ s1835 1) (EQ s1837 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 39 reset in 1995 ms.
Product exploration explored 100000 steps with 39 reset in 2703 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 863 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2583 steps, including 0 resets, run visited all 1 properties in 50 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 817 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
[2023-03-22 04:06:27] [INFO ] Invariant cache hit.
[2023-03-22 04:06:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 2574 ms returned sat
[2023-03-22 04:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:42] [INFO ] [Real]Absence check using state equation in 7573 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3100 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 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 240 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-22 04:06:42] [INFO ] Invariant cache hit.
[2023-03-22 04:06:45] [INFO ] Implicit Places using invariants in 2301 ms returned []
[2023-03-22 04:06:45] [INFO ] Invariant cache hit.
[2023-03-22 04:06:47] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
[2023-03-22 04:06:47] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-22 04:06:47] [INFO ] Invariant cache hit.
[2023-03-22 04:06:49] [INFO ] Dead Transitions using invariants and state equation in 2565 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7100 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 232 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 42 ms :[(NOT p0)]
Finished random walk after 2650 steps, including 0 resets, run visited all 1 properties in 88 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 227 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 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-22 04:06:50] [INFO ] Invariant cache hit.
[2023-03-22 04:07:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 2626 ms returned sat
[2023-03-22 04:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:07:05] [INFO ] [Real]Absence check using state equation in 4733 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
Product exploration explored 100000 steps with 38 reset in 1946 ms.
Product exploration explored 100000 steps with 38 reset in 2259 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 174 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-22 04:07:10] [INFO ] Invariant cache hit.
[2023-03-22 04:07:12] [INFO ] Implicit Places using invariants in 2009 ms returned []
[2023-03-22 04:07:12] [INFO ] Invariant cache hit.
[2023-03-22 04:07:14] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 4405 ms to find 0 implicit places.
[2023-03-22 04:07:14] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 04:07:14] [INFO ] Invariant cache hit.
[2023-03-22 04:07:16] [INFO ] Dead Transitions using invariants and state equation in 1651 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6318 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-00 finished in 64863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(!p1&&F(!p0))))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 155 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:07:16] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-22 04:07:19] [INFO ] Implicit Places using invariants in 2650 ms returned []
[2023-03-22 04:07:19] [INFO ] Invariant cache hit.
[2023-03-22 04:07:21] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 4988 ms to find 0 implicit places.
[2023-03-22 04:07:21] [INFO ] Invariant cache hit.
[2023-03-22 04:07:23] [INFO ] Dead Transitions using invariants and state equation in 2055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7199 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1568 1) (EQ s1579 1)), p0:(AND (EQ s2066 1) (EQ s2087 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6899 ms.
Product exploration explored 100000 steps with 50000 reset in 6858 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLFireability-02 finished in 21425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 135 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:07:38] [INFO ] Invariant cache hit.
[2023-03-22 04:07:40] [INFO ] Implicit Places using invariants in 1809 ms returned []
[2023-03-22 04:07:40] [INFO ] Invariant cache hit.
[2023-03-22 04:07:42] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 4020 ms to find 0 implicit places.
[2023-03-22 04:07:42] [INFO ] Invariant cache hit.
[2023-03-22 04:07:44] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6043 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1023 1) (AND (EQ s313 1) (EQ s340 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 22 reset in 2019 ms.
Product exploration explored 100000 steps with 21 reset in 2294 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92461 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92461 steps, saw 83342 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:07:52] [INFO ] Invariant cache hit.
[2023-03-22 04:07:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 545 ms returned sat
[2023-03-22 04:07:54] [INFO ] After 1595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:07:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 437 ms returned sat
[2023-03-22 04:08:07] [INFO ] After 13092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 507 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1498 ms. (steps per millisecond=44 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1502 ms. (steps per millisecond=44 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 04:08:10] [INFO ] Invariant cache hit.
[2023-03-22 04:08:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 2763 ms returned sat
[2023-03-22 04:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:08:25] [INFO ] [Real]Absence check using state equation in 7505 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 159 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:08:25] [INFO ] Invariant cache hit.
[2023-03-22 04:08:27] [INFO ] Implicit Places using invariants in 2242 ms returned []
[2023-03-22 04:08:27] [INFO ] Invariant cache hit.
[2023-03-22 04:08:32] [INFO ] Implicit Places using invariants and state equation in 4662 ms returned []
Implicit Place search using SMT with State Equation took 6919 ms to find 0 implicit places.
[2023-03-22 04:08:32] [INFO ] Invariant cache hit.
[2023-03-22 04:08:35] [INFO ] Dead Transitions using invariants and state equation in 3163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10252 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 90826 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90826 steps, saw 81875 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:08:39] [INFO ] Invariant cache hit.
[2023-03-22 04:08:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 368 ms returned sat
[2023-03-22 04:08:40] [INFO ] After 1173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:08:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 410 ms returned sat
[2023-03-22 04:08:52] [INFO ] After 12347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 479 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1509 ms. (steps per millisecond=44 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1513 ms. (steps per millisecond=44 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 04:08:55] [INFO ] Invariant cache hit.
[2023-03-22 04:09:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 2574 ms returned sat
[2023-03-22 04:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:09:10] [INFO ] [Real]Absence check using state equation in 7933 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 2140 ms.
Product exploration explored 100000 steps with 21 reset in 2634 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 15 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 22 ms
Applied a total of 2 rules in 709 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:09:17] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:09:17] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-22 04:09:19] [INFO ] Dead Transitions using invariants and state equation in 2316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3135 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 157 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:09:20] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-22 04:09:21] [INFO ] Implicit Places using invariants in 1873 ms returned []
[2023-03-22 04:09:22] [INFO ] Invariant cache hit.
[2023-03-22 04:09:24] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 3878 ms to find 0 implicit places.
[2023-03-22 04:09:24] [INFO ] Invariant cache hit.
[2023-03-22 04:09:26] [INFO ] Dead Transitions using invariants and state equation in 2263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6325 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 108445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 180 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:09:26] [INFO ] Invariant cache hit.
[2023-03-22 04:09:29] [INFO ] Implicit Places using invariants in 2523 ms returned []
[2023-03-22 04:09:29] [INFO ] Invariant cache hit.
[2023-03-22 04:09:36] [INFO ] Implicit Places using invariants and state equation in 7652 ms returned []
Implicit Place search using SMT with State Equation took 10205 ms to find 0 implicit places.
[2023-03-22 04:09:36] [INFO ] Invariant cache hit.
[2023-03-22 04:09:39] [INFO ] Dead Transitions using invariants and state equation in 2060 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12460 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2374 1) (EQ s2383 1) (EQ s2774 1) (EQ s2816 1)), p0:(OR (EQ s919 0) (EQ s940 0))], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 6739 steps with 2 reset in 168 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-05 finished in 12820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)||X(p1)) U X((F(p1)&&p2))))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 143 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:09:39] [INFO ] Invariant cache hit.
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 3161 ms returned []
[2023-03-22 04:09:42] [INFO ] Invariant cache hit.
[2023-03-22 04:09:45] [INFO ] Implicit Places using invariants and state equation in 2499 ms returned []
Implicit Place search using SMT with State Equation took 5691 ms to find 0 implicit places.
[2023-03-22 04:09:45] [INFO ] Invariant cache hit.
[2023-03-22 04:09:48] [INFO ] Dead Transitions using invariants and state equation in 3452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9304 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s809 1) (EQ s836 1)), p2:(AND (EQ s1410 1) (EQ s1452 1)), p1:(AND (EQ s697 1) (EQ s739 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 1878 ms.
Product exploration explored 100000 steps with 20 reset in 2610 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 767 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=12 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 04:09:57] [INFO ] Invariant cache hit.
[2023-03-22 04:09:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 271 ms returned sat
[2023-03-22 04:10:01] [INFO ] After 3961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:10:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 355 ms returned sat
[2023-03-22 04:10:26] [INFO ] After 23419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:10:26] [INFO ] After 23436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 04:10:26] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 551 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=9 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 93345 steps, run timeout after 6017 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 93345 steps, saw 92359 distinct states, run finished after 6018 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:10:36] [INFO ] Computed 1101 place invariants in 63 ms
[2023-03-22 04:10:37] [INFO ] [Real]Absence check using 1045 positive place invariants in 659 ms returned sat
[2023-03-22 04:10:37] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 21 ms returned sat
[2023-03-22 04:10:41] [INFO ] After 5434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:10:43] [INFO ] [Nat]Absence check using 1045 positive place invariants in 388 ms returned sat
[2023-03-22 04:10:43] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 77 ms returned sat
[2023-03-22 04:11:06] [INFO ] After 22843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:11:06] [INFO ] After 22849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 04:11:06] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 143 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 145 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:11:06] [INFO ] Invariant cache hit.
[2023-03-22 04:11:09] [INFO ] Implicit Places using invariants in 2217 ms returned []
[2023-03-22 04:11:09] [INFO ] Invariant cache hit.
[2023-03-22 04:11:11] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 4401 ms to find 0 implicit places.
[2023-03-22 04:11:11] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-22 04:11:11] [INFO ] Invariant cache hit.
[2023-03-22 04:11:14] [INFO ] Dead Transitions using invariants and state equation in 2717 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7345 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 142 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-22 04:11:14] [INFO ] Invariant cache hit.
[2023-03-22 04:11:16] [INFO ] [Real]Absence check using 1045 positive place invariants in 973 ms returned sat
[2023-03-22 04:11:16] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 170 ms returned sat
[2023-03-22 04:11:19] [INFO ] After 5669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:11:21] [INFO ] [Nat]Absence check using 1045 positive place invariants in 424 ms returned sat
[2023-03-22 04:11:21] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 17 ms returned sat
[2023-03-22 04:12:19] [INFO ] After 58527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:12:47] [INFO ] After 85809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 04:12:47] [INFO ] After 87359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2))]
Knowledge based reduction with 14 factoid took 1195 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:12:49] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-22 04:12:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 2427 ms returned sat
[2023-03-22 04:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:04] [INFO ] [Real]Absence check using state equation in 8763 ms returned unknown
Could not prove EG (NOT p2)
[2023-03-22 04:13:04] [INFO ] Invariant cache hit.
[2023-03-22 04:13:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 2073 ms returned sat
[2023-03-22 04:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:19] [INFO ] [Real]Absence check using state equation in 7362 ms returned unknown
Could not prove EG (NOT p1)
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 171 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:13:19] [INFO ] Invariant cache hit.
[2023-03-22 04:13:22] [INFO ] Implicit Places using invariants in 2387 ms returned []
[2023-03-22 04:13:22] [INFO ] Invariant cache hit.
[2023-03-22 04:13:24] [INFO ] Implicit Places using invariants and state equation in 2711 ms returned []
Implicit Place search using SMT with State Equation took 5113 ms to find 0 implicit places.
[2023-03-22 04:13:24] [INFO ] Invariant cache hit.
[2023-03-22 04:13:27] [INFO ] Dead Transitions using invariants and state equation in 2762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8049 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 612 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 04:13:30] [INFO ] Invariant cache hit.
[2023-03-22 04:13:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 213 ms returned sat
[2023-03-22 04:13:34] [INFO ] After 4095ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:13:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 607 ms returned sat
[2023-03-22 04:13:59] [INFO ] After 23231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:13:59] [INFO ] After 23241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 04:13:59] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 644 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 47088 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47088 steps, saw 46418 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:14:04] [INFO ] Computed 1101 place invariants in 40 ms
[2023-03-22 04:14:06] [INFO ] [Real]Absence check using 1045 positive place invariants in 566 ms returned sat
[2023-03-22 04:14:06] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 18 ms returned sat
[2023-03-22 04:14:09] [INFO ] After 4714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:14:10] [INFO ] [Nat]Absence check using 1045 positive place invariants in 402 ms returned sat
[2023-03-22 04:14:11] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 271 ms returned sat
[2023-03-22 04:14:34] [INFO ] After 23016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:14:34] [INFO ] After 23038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 04:14:34] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2004 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:14:36] [INFO ] Invariant cache hit.
[2023-03-22 04:14:39] [INFO ] Implicit Places using invariants in 2770 ms returned []
[2023-03-22 04:14:39] [INFO ] Invariant cache hit.
[2023-03-22 04:14:43] [INFO ] Implicit Places using invariants and state equation in 3823 ms returned []
Implicit Place search using SMT with State Equation took 6607 ms to find 0 implicit places.
[2023-03-22 04:14:43] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-22 04:14:43] [INFO ] Invariant cache hit.
[2023-03-22 04:14:45] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8749 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 172 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-22 04:14:45] [INFO ] Invariant cache hit.
[2023-03-22 04:14:47] [INFO ] [Real]Absence check using 1045 positive place invariants in 678 ms returned sat
[2023-03-22 04:14:47] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 18 ms returned sat
[2023-03-22 04:14:51] [INFO ] After 5560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:14:53] [INFO ] [Nat]Absence check using 1045 positive place invariants in 833 ms returned sat
[2023-03-22 04:14:53] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 323 ms returned sat
[2023-03-22 04:16:05] [INFO ] After 71594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:16:15] [INFO ] After 80719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 04:16:15] [INFO ] After 83886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 858 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 547 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:16:17] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-22 04:16:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 5866 ms returned sat
[2023-03-22 04:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:32] [INFO ] [Real]Absence check using state equation in 3671 ms returned unknown
Could not prove EG (NOT p2)
[2023-03-22 04:16:32] [INFO ] Invariant cache hit.
[2023-03-22 04:16:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 1973 ms returned sat
[2023-03-22 04:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:16:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 20 reset in 1994 ms.
Product exploration explored 100000 steps with 20 reset in 2457 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 11 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 11 ms
Applied a total of 2 rules in 408 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:16:53] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:16:53] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-22 04:16:55] [INFO ] Dead Transitions using invariants and state equation in 1957 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2472 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 136 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:16:55] [INFO ] Computed 1101 place invariants in 7 ms
[2023-03-22 04:16:57] [INFO ] Implicit Places using invariants in 2207 ms returned []
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
[2023-03-22 04:16:59] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 4301 ms to find 0 implicit places.
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
[2023-03-22 04:17:01] [INFO ] Dead Transitions using invariants and state equation in 1949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6400 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-06 finished in 442426 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 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 487 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:17:02] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-22 04:17:05] [INFO ] Implicit Places using invariants in 3517 ms returned []
[2023-03-22 04:17:05] [INFO ] Invariant cache hit.
[2023-03-22 04:17:13] [INFO ] Implicit Places using invariants and state equation in 8072 ms returned []
Implicit Place search using SMT with State Equation took 11604 ms to find 0 implicit places.
[2023-03-22 04:17:13] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 04:17:13] [INFO ] Invariant cache hit.
[2023-03-22 04:17:16] [INFO ] Dead Transitions using invariants and state equation in 2666 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14841 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-07 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 s620 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15 reset in 2043 ms.
Product exploration explored 100000 steps with 14 reset in 2552 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99326 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99326 steps, saw 90236 distinct states, run finished after 3013 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:17:24] [INFO ] Invariant cache hit.
[2023-03-22 04:17:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 401 ms returned sat
[2023-03-22 04:17:29] [INFO ] After 4084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:17:32] [INFO ] [Nat]Absence check using 1101 positive place invariants in 3142 ms returned sat
[2023-03-22 04:17:34] [INFO ] After 1962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:17:35] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 6 ms to minimize.
[2023-03-22 04:17:37] [INFO ] Deduced a trap composed of 22 places in 2125 ms of which 14 ms to minimize.
[2023-03-22 04:17:38] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 27 ms to minimize.
[2023-03-22 04:17:38] [INFO ] Deduced a trap composed of 19 places in 541 ms of which 16 ms to minimize.
[2023-03-22 04:17:39] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 2 ms to minimize.
[2023-03-22 04:17:39] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-22 04:17:40] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 13 ms to minimize.
[2023-03-22 04:17:40] [INFO ] Deduced a trap composed of 25 places in 560 ms of which 0 ms to minimize.
[2023-03-22 04:17:41] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 1 ms to minimize.
[2023-03-22 04:17:41] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-22 04:17:41] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 26 ms to minimize.
[2023-03-22 04:17:42] [INFO ] Deduced a trap composed of 17 places in 834 ms of which 1 ms to minimize.
[2023-03-22 04:17:43] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2023-03-22 04:17:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 8296 ms
[2023-03-22 04:17:43] [INFO ] After 10340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-22 04:17:43] [INFO ] After 14288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 332 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 126467 steps, run timeout after 3003 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126467 steps, saw 125514 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:17:47] [INFO ] Computed 1101 place invariants in 61 ms
[2023-03-22 04:17:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 272 ms returned sat
[2023-03-22 04:17:50] [INFO ] After 2820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:17:51] [INFO ] [Nat]Absence check using 1101 positive place invariants in 361 ms returned sat
[2023-03-22 04:17:56] [INFO ] After 5289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:17:58] [INFO ] Deduced a trap composed of 17 places in 1389 ms of which 2 ms to minimize.
[2023-03-22 04:17:58] [INFO ] Deduced a trap composed of 17 places in 803 ms of which 1 ms to minimize.
[2023-03-22 04:17:59] [INFO ] Deduced a trap composed of 19 places in 711 ms of which 1 ms to minimize.
[2023-03-22 04:18:00] [INFO ] Deduced a trap composed of 17 places in 636 ms of which 6 ms to minimize.
[2023-03-22 04:18:01] [INFO ] Deduced a trap composed of 17 places in 939 ms of which 11 ms to minimize.
[2023-03-22 04:18:02] [INFO ] Deduced a trap composed of 17 places in 468 ms of which 1 ms to minimize.
[2023-03-22 04:18:02] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2023-03-22 04:18:03] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 1 ms to minimize.
[2023-03-22 04:18:03] [INFO ] Deduced a trap composed of 17 places in 417 ms of which 1 ms to minimize.
[2023-03-22 04:18:04] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 1 ms to minimize.
[2023-03-22 04:18:04] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 0 ms to minimize.
[2023-03-22 04:18:05] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2023-03-22 04:18:05] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 0 ms to minimize.
[2023-03-22 04:18:06] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2023-03-22 04:18:06] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 0 ms to minimize.
[2023-03-22 04:18:06] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2023-03-22 04:18:07] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 0 ms to minimize.
[2023-03-22 04:18:07] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-22 04:18:07] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 0 ms to minimize.
[2023-03-22 04:18:08] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 26 ms to minimize.
[2023-03-22 04:18:08] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 25 ms to minimize.
[2023-03-22 04:18:08] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 0 ms to minimize.
[2023-03-22 04:18:09] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 0 ms to minimize.
[2023-03-22 04:18:09] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-22 04:18:09] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13249 ms
[2023-03-22 04:18:09] [INFO ] After 18668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-22 04:18:10] [INFO ] After 20018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 167 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 142 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-22 04:18:10] [INFO ] Invariant cache hit.
[2023-03-22 04:18:15] [INFO ] Implicit Places using invariants in 5032 ms returned []
[2023-03-22 04:18:15] [INFO ] Invariant cache hit.
[2023-03-22 04:18:18] [INFO ] Implicit Places using invariants and state equation in 2729 ms returned []
Implicit Place search using SMT with State Equation took 7765 ms to find 0 implicit places.
[2023-03-22 04:18:18] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 04:18:18] [INFO ] Invariant cache hit.
[2023-03-22 04:18:21] [INFO ] Dead Transitions using invariants and state equation in 3412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11421 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 160 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 04:18:21] [INFO ] Invariant cache hit.
[2023-03-22 04:18:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 421 ms returned sat
[2023-03-22 04:18:24] [INFO ] After 2816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:18:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 758 ms returned sat
[2023-03-22 04:18:28] [INFO ] After 1924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:18:28] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 24 ms to minimize.
[2023-03-22 04:18:28] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 1 ms to minimize.
[2023-03-22 04:18:29] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2023-03-22 04:18:29] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
[2023-03-22 04:18:29] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 1 ms to minimize.
[2023-03-22 04:18:30] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 1 ms to minimize.
[2023-03-22 04:18:30] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-22 04:18:31] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 1 ms to minimize.
[2023-03-22 04:18:31] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 1 ms to minimize.
[2023-03-22 04:18:32] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 0 ms to minimize.
[2023-03-22 04:18:32] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-22 04:18:33] [INFO ] Deduced a trap composed of 17 places in 1174 ms of which 7 ms to minimize.
[2023-03-22 04:18:33] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2023-03-22 04:18:34] [INFO ] Deduced a trap composed of 17 places in 576 ms of which 0 ms to minimize.
[2023-03-22 04:18:34] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2023-03-22 04:18:35] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2023-03-22 04:18:35] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2023-03-22 04:18:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7499 ms
[2023-03-22 04:18:35] [INFO ] After 9505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-22 04:18:35] [INFO ] After 11213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 186 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:18:36] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 04:18:39] [INFO ] Implicit Places using invariants in 2879 ms returned []
[2023-03-22 04:18:39] [INFO ] Invariant cache hit.
[2023-03-22 04:18:41] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 4740 ms to find 0 implicit places.
[2023-03-22 04:18:41] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-22 04:18:41] [INFO ] Invariant cache hit.
[2023-03-22 04:18:43] [INFO ] Dead Transitions using invariants and state equation in 2038 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7072 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82331 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82331 steps, saw 74722 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:18:47] [INFO ] Invariant cache hit.
[2023-03-22 04:18:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 542 ms returned sat
[2023-03-22 04:18:51] [INFO ] After 4787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:18:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 385 ms returned sat
[2023-03-22 04:18:57] [INFO ] After 4186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:18:58] [INFO ] Deduced a trap composed of 17 places in 1496 ms of which 1 ms to minimize.
[2023-03-22 04:18:59] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2023-03-22 04:18:59] [INFO ] Deduced a trap composed of 17 places in 413 ms of which 2 ms to minimize.
[2023-03-22 04:19:00] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 1 ms to minimize.
[2023-03-22 04:19:00] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 1 ms to minimize.
[2023-03-22 04:19:00] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-22 04:19:01] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 17 ms to minimize.
[2023-03-22 04:19:01] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 1 ms to minimize.
[2023-03-22 04:19:01] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 4 ms to minimize.
[2023-03-22 04:19:02] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-22 04:19:02] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2023-03-22 04:19:02] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 10 ms to minimize.
[2023-03-22 04:19:03] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 14 ms to minimize.
[2023-03-22 04:19:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5992 ms
[2023-03-22 04:19:03] [INFO ] After 10270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-22 04:19:03] [INFO ] After 11501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 349 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117099 steps, run timeout after 3025 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 117099 steps, saw 116210 distinct states, run finished after 3025 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:19:07] [INFO ] Computed 1101 place invariants in 50 ms
[2023-03-22 04:19:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 5316 ms returned sat
[2023-03-22 04:19:16] [INFO ] After 8890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:19:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 256 ms returned sat
[2023-03-22 04:19:21] [INFO ] After 4876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:19:22] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2023-03-22 04:19:23] [INFO ] Deduced a trap composed of 17 places in 417 ms of which 1 ms to minimize.
[2023-03-22 04:19:23] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 1 ms to minimize.
[2023-03-22 04:19:24] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 1 ms to minimize.
[2023-03-22 04:19:24] [INFO ] Deduced a trap composed of 17 places in 416 ms of which 1 ms to minimize.
[2023-03-22 04:19:25] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 1 ms to minimize.
[2023-03-22 04:19:25] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 1 ms to minimize.
[2023-03-22 04:19:26] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 1 ms to minimize.
[2023-03-22 04:19:27] [INFO ] Deduced a trap composed of 17 places in 1131 ms of which 2 ms to minimize.
[2023-03-22 04:19:28] [INFO ] Deduced a trap composed of 17 places in 500 ms of which 1 ms to minimize.
[2023-03-22 04:19:28] [INFO ] Deduced a trap composed of 17 places in 546 ms of which 1 ms to minimize.
[2023-03-22 04:19:29] [INFO ] Deduced a trap composed of 17 places in 832 ms of which 1 ms to minimize.
[2023-03-22 04:19:30] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 0 ms to minimize.
[2023-03-22 04:19:30] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 0 ms to minimize.
[2023-03-22 04:19:31] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 1 ms to minimize.
[2023-03-22 04:19:31] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2023-03-22 04:19:32] [INFO ] Deduced a trap composed of 17 places in 692 ms of which 0 ms to minimize.
[2023-03-22 04:19:32] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 0 ms to minimize.
[2023-03-22 04:19:32] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
[2023-03-22 04:19:33] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-22 04:19:33] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2023-03-22 04:19:33] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 1 ms to minimize.
[2023-03-22 04:19:34] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 1 ms to minimize.
[2023-03-22 04:19:34] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 0 ms to minimize.
[2023-03-22 04:19:34] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 12604 ms
[2023-03-22 04:19:34] [INFO ] After 17601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-22 04:19:34] [INFO ] After 18671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 199 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 193 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-22 04:19:35] [INFO ] Invariant cache hit.
[2023-03-22 04:19:38] [INFO ] Implicit Places using invariants in 2740 ms returned []
[2023-03-22 04:19:38] [INFO ] Invariant cache hit.
[2023-03-22 04:19:40] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 5611 ms to find 0 implicit places.
[2023-03-22 04:19:41] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-22 04:19:41] [INFO ] Invariant cache hit.
[2023-03-22 04:19:49] [INFO ] Dead Transitions using invariants and state equation in 8755 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14684 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 285 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 04:19:50] [INFO ] Invariant cache hit.
[2023-03-22 04:19:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 311 ms returned sat
[2023-03-22 04:19:53] [INFO ] After 3553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:19:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 310 ms returned sat
[2023-03-22 04:19:56] [INFO ] After 1734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:19:56] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 0 ms to minimize.
[2023-03-22 04:19:57] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 0 ms to minimize.
[2023-03-22 04:19:57] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 0 ms to minimize.
[2023-03-22 04:19:58] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2023-03-22 04:19:58] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-22 04:19:58] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 0 ms to minimize.
[2023-03-22 04:19:59] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 0 ms to minimize.
[2023-03-22 04:19:59] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 0 ms to minimize.
[2023-03-22 04:19:59] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 1 ms to minimize.
[2023-03-22 04:20:00] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 0 ms to minimize.
[2023-03-22 04:20:00] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 0 ms to minimize.
[2023-03-22 04:20:00] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-22 04:20:01] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-22 04:20:01] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 0 ms to minimize.
[2023-03-22 04:20:01] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2023-03-22 04:20:02] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-22 04:20:02] [INFO ] Deduced a trap composed of 57 places in 303 ms of which 1 ms to minimize.
[2023-03-22 04:20:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6100 ms
[2023-03-22 04:20:02] [INFO ] After 7952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-22 04:20:02] [INFO ] After 9216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14 reset in 2609 ms.
Product exploration explored 100000 steps with 15 reset in 2765 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 204 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:20:08] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-22 04:20:10] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2023-03-22 04:20:11] [INFO ] Invariant cache hit.
[2023-03-22 04:20:13] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 4061 ms to find 0 implicit places.
[2023-03-22 04:20:13] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 04:20:13] [INFO ] Invariant cache hit.
[2023-03-22 04:20:14] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6156 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-07 finished in 193338 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)))&&G(p2)))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 291 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:20:15] [INFO ] Computed 1101 place invariants in 15 ms
[2023-03-22 04:20:18] [INFO ] Implicit Places using invariants in 2696 ms returned []
[2023-03-22 04:20:18] [INFO ] Invariant cache hit.
[2023-03-22 04:20:20] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 5267 ms to find 0 implicit places.
[2023-03-22 04:20:20] [INFO ] Invariant cache hit.
[2023-03-22 04:20:24] [INFO ] Dead Transitions using invariants and state equation in 3450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9021 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s517 0), p0:(OR (EQ s1964 0) (EQ s1976 0)), p1:(OR (EQ s2855 0) (EQ s2882 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2376 steps with 0 reset in 52 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-08 finished in 9355 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 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 33 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 390 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:20:24] [INFO ] Computed 1101 place invariants in 7 ms
[2023-03-22 04:20:29] [INFO ] Implicit Places using invariants in 4514 ms returned []
[2023-03-22 04:20:29] [INFO ] Invariant cache hit.
[2023-03-22 04:20:31] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 6415 ms to find 0 implicit places.
[2023-03-22 04:20:31] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-22 04:20:31] [INFO ] Invariant cache hit.
[2023-03-22 04:20:33] [INFO ] Dead Transitions using invariants and state equation in 2506 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9398 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-09 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:(OR (EQ s2553 0) (EQ s2563 0)), p1:(AND (EQ s2 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6674 steps with 0 reset in 163 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-09 finished in 9787 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(!p0)&&F(G(p1)))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 361 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2023-03-22 04:20:34] [INFO ] Invariant cache hit.
[2023-03-22 04:20:38] [INFO ] Implicit Places using invariants in 4093 ms returned []
[2023-03-22 04:20:38] [INFO ] Invariant cache hit.
[2023-03-22 04:20:43] [INFO ] Implicit Places using invariants and state equation in 4338 ms returned []
Implicit Place search using SMT with State Equation took 8462 ms to find 0 implicit places.
[2023-03-22 04:20:43] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 04:20:43] [INFO ] Invariant cache hit.
[2023-03-22 04:20:45] [INFO ] Dead Transitions using invariants and state equation in 2721 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11658 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 208 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1258 1) (EQ s1269 1)), p1:(NEQ s2192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 15 reset in 2047 ms.
Product exploration explored 100000 steps with 15 reset in 2549 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 551 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68643 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68643 steps, saw 62221 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 04:20:55] [INFO ] Invariant cache hit.
[2023-03-22 04:20:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 270 ms returned sat
[2023-03-22 04:20:59] [INFO ] After 4222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 04:21:00] [INFO ] [Nat]Absence check using 1101 positive place invariants in 299 ms returned sat
[2023-03-22 04:21:21] [INFO ] After 21894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 596 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52044 steps, run visited all 2 properties in 1868 ms. (steps per millisecond=27 )
Probabilistic random walk after 52044 steps, saw 51347 distinct states, run finished after 1871 ms. (steps per millisecond=27 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 284 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:21:25] [INFO ] Invariant cache hit.
[2023-03-22 04:21:28] [INFO ] Implicit Places using invariants in 2484 ms returned []
[2023-03-22 04:21:28] [INFO ] Invariant cache hit.
[2023-03-22 04:21:30] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 4690 ms to find 0 implicit places.
[2023-03-22 04:21:30] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-22 04:21:30] [INFO ] Invariant cache hit.
[2023-03-22 04:21:35] [INFO ] Dead Transitions using invariants and state equation in 5212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10303 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 63280 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63280 steps, saw 57322 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 04:21:40] [INFO ] Invariant cache hit.
[2023-03-22 04:21:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 313 ms returned sat
[2023-03-22 04:21:43] [INFO ] After 3541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 04:21:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 296 ms returned sat
[2023-03-22 04:22:05] [INFO ] After 21649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 368 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52044 steps, run visited all 2 properties in 1897 ms. (steps per millisecond=27 )
Probabilistic random walk after 52044 steps, saw 51347 distinct states, run finished after 1943 ms. (steps per millisecond=26 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 431 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 238 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15 reset in 2946 ms.
Product exploration explored 100000 steps with 15 reset in 2822 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 213 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:22:15] [INFO ] Invariant cache hit.
[2023-03-22 04:22:17] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2023-03-22 04:22:17] [INFO ] Invariant cache hit.
[2023-03-22 04:22:20] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 4962 ms to find 0 implicit places.
[2023-03-22 04:22:20] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-22 04:22:20] [INFO ] Invariant cache hit.
[2023-03-22 04:22:22] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7165 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-10 finished in 108382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(!p0)) U p0)))))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 226 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:22:22] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 04:22:25] [INFO ] Implicit Places using invariants in 2263 ms returned []
[2023-03-22 04:22:25] [INFO ] Invariant cache hit.
[2023-03-22 04:22:27] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 4337 ms to find 0 implicit places.
[2023-03-22 04:22:27] [INFO ] Invariant cache hit.
[2023-03-22 04:22:29] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6832 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s1494 1) (EQ s1511 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-12 finished in 7019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 212 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:22:29] [INFO ] Invariant cache hit.
[2023-03-22 04:22:32] [INFO ] Implicit Places using invariants in 2350 ms returned []
[2023-03-22 04:22:32] [INFO ] Invariant cache hit.
[2023-03-22 04:22:34] [INFO ] Implicit Places using invariants and state equation in 2265 ms returned []
Implicit Place search using SMT with State Equation took 4625 ms to find 0 implicit places.
[2023-03-22 04:22:34] [INFO ] Invariant cache hit.
[2023-03-22 04:22:36] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6890 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1214 1) (EQ s1233 1)), p0:(OR (EQ s287 0) (EQ s307 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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 ShieldPPPs-PT-100A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-13 finished in 7206 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||G(!p0))) U G(p0))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 161 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:22:37] [INFO ] Invariant cache hit.
[2023-03-22 04:22:40] [INFO ] Implicit Places using invariants in 3019 ms returned []
[2023-03-22 04:22:40] [INFO ] Invariant cache hit.
[2023-03-22 04:22:42] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 5746 ms to find 0 implicit places.
[2023-03-22 04:22:42] [INFO ] Invariant cache hit.
[2023-03-22 04:22:44] [INFO ] Dead Transitions using invariants and state equation in 2020 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7969 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s601 1) (EQ s603 1)), p1:(AND (EQ s44 1) (EQ s64 1) (NOT (AND (EQ s601 1) (EQ s603 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]]
Product exploration explored 100000 steps with 25024 reset in 4562 ms.
Product exploration explored 100000 steps with 24984 reset in 4917 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 693 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 49606 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49606 steps, saw 44535 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:22:59] [INFO ] Invariant cache hit.
[2023-03-22 04:23:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 343 ms returned sat
[2023-03-22 04:23:03] [INFO ] After 2265ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2023-03-22 04:23:03] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2023-03-22 04:23:04] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2023-03-22 04:23:04] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2023-03-22 04:23:04] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2023-03-22 04:23:04] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 0 ms to minimize.
[2023-03-22 04:23:05] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-22 04:23:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1793 ms
[2023-03-22 04:23:05] [INFO ] After 4320ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-22 04:23:05] [INFO ] After 5562ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-22 04:23:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 481 ms returned sat
[2023-03-22 04:23:18] [INFO ] After 11401ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 04:23:19] [INFO ] After 12469ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-22 04:23:19] [INFO ] After 14413ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Applied a total of 900 rules in 507 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81368 steps, run timeout after 3010 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81368 steps, saw 80525 distinct states, run finished after 3010 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:23:24] [INFO ] Computed 1101 place invariants in 23 ms
[2023-03-22 04:23:25] [INFO ] [Real]Absence check using 1048 positive place invariants in 319 ms returned sat
[2023-03-22 04:23:25] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 22 ms returned sat
[2023-03-22 04:23:28] [INFO ] After 3929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 04:23:29] [INFO ] [Nat]Absence check using 1048 positive place invariants in 349 ms returned sat
[2023-03-22 04:23:29] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 31 ms returned sat
[2023-03-22 04:23:53] [INFO ] After 23668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:23:53] [INFO ] After 23675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 04:23:53] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 218 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 204 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:23:54] [INFO ] Invariant cache hit.
[2023-03-22 04:23:56] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2023-03-22 04:23:56] [INFO ] Invariant cache hit.
[2023-03-22 04:23:59] [INFO ] Implicit Places using invariants and state equation in 3262 ms returned []
Implicit Place search using SMT with State Equation took 5689 ms to find 0 implicit places.
[2023-03-22 04:23:59] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 04:23:59] [INFO ] Invariant cache hit.
[2023-03-22 04:24:00] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7040 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 212 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 04:24:01] [INFO ] Invariant cache hit.
[2023-03-22 04:24:02] [INFO ] [Real]Absence check using 1048 positive place invariants in 347 ms returned sat
[2023-03-22 04:24:02] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 58 ms returned sat
[2023-03-22 04:24:04] [INFO ] After 3511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 04:24:07] [INFO ] [Nat]Absence check using 1048 positive place invariants in 1927 ms returned sat
[2023-03-22 04:24:07] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 24 ms returned sat
[2023-03-22 04:24:27] [INFO ] After 20482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:24:36] [INFO ] After 29510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 04:24:36] [INFO ] After 32318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 662 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:24:38] [INFO ] Computed 1101 place invariants in 6 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [true]
Knowledge based reduction with 10 factoid took 889 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 163 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:24:44] [INFO ] Invariant cache hit.
[2023-03-22 04:24:46] [INFO ] Implicit Places using invariants in 2315 ms returned []
[2023-03-22 04:24:46] [INFO ] Invariant cache hit.
[2023-03-22 04:24:48] [INFO ] Implicit Places using invariants and state equation in 2157 ms returned []
Implicit Place search using SMT with State Equation took 4493 ms to find 0 implicit places.
[2023-03-22 04:24:48] [INFO ] Invariant cache hit.
[2023-03-22 04:24:51] [INFO ] Dead Transitions using invariants and state equation in 2525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7195 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 726 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 43217 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43217 steps, saw 38743 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:24:56] [INFO ] Invariant cache hit.
[2023-03-22 04:24:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 1139 ms returned sat
[2023-03-22 04:25:01] [INFO ] After 4551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:25:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 311 ms returned sat
[2023-03-22 04:25:26] [INFO ] After 23523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:25:26] [INFO ] After 23530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 04:25:26] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 197 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Applied a total of 900 rules in 511 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 62272 steps, run timeout after 3005 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62272 steps, saw 61519 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:25:31] [INFO ] Computed 1101 place invariants in 26 ms
[2023-03-22 04:25:31] [INFO ] [Real]Absence check using 1048 positive place invariants in 383 ms returned sat
[2023-03-22 04:25:32] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 49 ms returned sat
[2023-03-22 04:25:34] [INFO ] After 2229ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-22 04:25:34] [INFO ] After 2598ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:25:34] [INFO ] After 3800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:25:36] [INFO ] [Nat]Absence check using 1048 positive place invariants in 280 ms returned sat
[2023-03-22 04:25:36] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 29 ms returned sat
[2023-03-22 04:25:59] [INFO ] After 23374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 04:25:59] [INFO ] After 23391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 04:25:59] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 258 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 167 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:26:00] [INFO ] Invariant cache hit.
[2023-03-22 04:26:02] [INFO ] Implicit Places using invariants in 2422 ms returned []
[2023-03-22 04:26:02] [INFO ] Invariant cache hit.
[2023-03-22 04:26:05] [INFO ] Implicit Places using invariants and state equation in 2452 ms returned []
Implicit Place search using SMT with State Equation took 4892 ms to find 0 implicit places.
[2023-03-22 04:26:05] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 04:26:05] [INFO ] Invariant cache hit.
[2023-03-22 04:26:07] [INFO ] Dead Transitions using invariants and state equation in 2532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7694 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 197 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:26:08] [INFO ] Invariant cache hit.
[2023-03-22 04:26:09] [INFO ] [Real]Absence check using 1048 positive place invariants in 402 ms returned sat
[2023-03-22 04:26:09] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 30 ms returned sat
[2023-03-22 04:26:12] [INFO ] After 4024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:26:13] [INFO ] [Nat]Absence check using 1048 positive place invariants in 357 ms returned sat
[2023-03-22 04:26:13] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 45 ms returned sat
[2023-03-22 04:26:42] [INFO ] After 29387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:26:52] [INFO ] After 38628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 04:26:52] [INFO ] After 39991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 589 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:26:53] [INFO ] Computed 1101 place invariants in 8 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [true]
Knowledge based reduction with 9 factoid took 504 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Entered a terminal (fully accepting) state of product in 5270 steps with 0 reset in 134 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-14 finished in 263619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 486 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:27:01] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-22 04:27:03] [INFO ] Implicit Places using invariants in 2596 ms returned []
[2023-03-22 04:27:03] [INFO ] Invariant cache hit.
[2023-03-22 04:27:05] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 4840 ms to find 0 implicit places.
[2023-03-22 04:27:05] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 04:27:05] [INFO ] Invariant cache hit.
[2023-03-22 04:27:08] [INFO ] Dead Transitions using invariants and state equation in 2375 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7800 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s2267 1) (EQ s2288 1)) (AND (EQ s657 1) (EQ s673 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 65 reset in 1835 ms.
Product exploration explored 100000 steps with 64 reset in 2231 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1576 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=58 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
[2023-03-22 04:27:13] [INFO ] Invariant cache hit.
[2023-03-22 04:27:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 1818 ms returned sat
[2023-03-22 04:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:27:28] [INFO ] [Real]Absence check using state equation in 8313 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 204 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:27:28] [INFO ] Invariant cache hit.
[2023-03-22 04:27:31] [INFO ] Implicit Places using invariants in 2786 ms returned []
[2023-03-22 04:27:31] [INFO ] Invariant cache hit.
[2023-03-22 04:27:34] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 5529 ms to find 0 implicit places.
[2023-03-22 04:27:34] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 04:27:34] [INFO ] Invariant cache hit.
[2023-03-22 04:27:36] [INFO ] Dead Transitions using invariants and state equation in 2371 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8214 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1595 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=56 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
[2023-03-22 04:27:37] [INFO ] Invariant cache hit.
[2023-03-22 04:27:44] [INFO ] [Real]Absence check using 1101 positive place invariants in 2086 ms returned sat
[2023-03-22 04:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:27:52] [INFO ] [Real]Absence check using state equation in 8637 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 66 reset in 1947 ms.
Product exploration explored 100000 steps with 66 reset in 2218 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 175 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:27:57] [INFO ] Invariant cache hit.
[2023-03-22 04:28:09] [INFO ] Implicit Places using invariants in 12013 ms returned []
[2023-03-22 04:28:09] [INFO ] Invariant cache hit.
[2023-03-22 04:28:12] [INFO ] Implicit Places using invariants and state equation in 3150 ms returned []
Implicit Place search using SMT with State Equation took 15186 ms to find 0 implicit places.
[2023-03-22 04:28:12] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-22 04:28:12] [INFO ] Invariant cache hit.
[2023-03-22 04:28:15] [INFO ] Dead Transitions using invariants and state equation in 2610 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18095 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-15 finished in 74798 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)&&(!p1 U (p2||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' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100A-LTLFireability-03
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 338 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2023-03-22 04:28:16] [INFO ] Invariant cache hit.
[2023-03-22 04:28:18] [INFO ] Implicit Places using invariants in 2521 ms returned []
[2023-03-22 04:28:18] [INFO ] Invariant cache hit.
[2023-03-22 04:28:20] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 4756 ms to find 0 implicit places.
[2023-03-22 04:28:21] [INFO ] Invariant cache hit.
[2023-03-22 04:28:23] [INFO ] Dead Transitions using invariants and state equation in 2629 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7725 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1023 1) (AND (EQ s313 1) (EQ s340 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 1911 ms.
Product exploration explored 100000 steps with 21 reset in 2386 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94343 steps, run timeout after 3093 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 94343 steps, saw 85721 distinct states, run finished after 3093 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:28:31] [INFO ] Invariant cache hit.
[2023-03-22 04:28:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 291 ms returned sat
[2023-03-22 04:28:32] [INFO ] After 948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:28:33] [INFO ] [Nat]Absence check using 1101 positive place invariants in 309 ms returned sat
[2023-03-22 04:28:44] [INFO ] After 11629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 894 place count 3101 transition count 2601
Applied a total of 894 rules in 471 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1549 ms. (steps per millisecond=43 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1553 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 04:28:47] [INFO ] Invariant cache hit.
[2023-03-22 04:28:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 2459 ms returned sat
[2023-03-22 04:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:29:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 182 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:29:02] [INFO ] Invariant cache hit.
[2023-03-22 04:29:05] [INFO ] Implicit Places using invariants in 2540 ms returned []
[2023-03-22 04:29:05] [INFO ] Invariant cache hit.
[2023-03-22 04:29:07] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 4544 ms to find 0 implicit places.
[2023-03-22 04:29:07] [INFO ] Invariant cache hit.
[2023-03-22 04:29:09] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6740 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95784 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95784 steps, saw 87019 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:29:13] [INFO ] Invariant cache hit.
[2023-03-22 04:29:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 298 ms returned sat
[2023-03-22 04:29:14] [INFO ] After 1152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:29:15] [INFO ] [Nat]Absence check using 1101 positive place invariants in 308 ms returned sat
[2023-03-22 04:29:26] [INFO ] After 11790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 894 place count 3101 transition count 2601
Applied a total of 894 rules in 436 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1588 ms. (steps per millisecond=42 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1592 ms. (steps per millisecond=42 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 04:29:29] [INFO ] Invariant cache hit.
[2023-03-22 04:29:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 2239 ms returned sat
[2023-03-22 04:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:29:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 2306 ms.
Product exploration explored 100000 steps with 22 reset in 2694 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 241 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:29:49] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 04:29:49] [INFO ] Invariant cache hit.
[2023-03-22 04:29:52] [INFO ] Dead Transitions using invariants and state equation in 2179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2498 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 173 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:29:52] [INFO ] Invariant cache hit.
[2023-03-22 04:29:54] [INFO ] Implicit Places using invariants in 1883 ms returned []
[2023-03-22 04:29:54] [INFO ] Invariant cache hit.
[2023-03-22 04:29:57] [INFO ] Implicit Places using invariants and state equation in 3610 ms returned []
Implicit Place search using SMT with State Equation took 5507 ms to find 0 implicit places.
[2023-03-22 04:29:57] [INFO ] Invariant cache hit.
[2023-03-22 04:29:59] [INFO ] Dead Transitions using invariants and state equation in 2033 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7720 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 104600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)||X(p1)) U X((F(p1)&&p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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(!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' '!(G(F(p0)))'
[2023-03-22 04:30:00] [INFO ] Flatten gal took : 278 ms
[2023-03-22 04:30:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 04:30:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3103 places, 2603 transitions and 10006 arcs took 33 ms.
Total runtime 1568535 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3347/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3347/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3347/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3347/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3347/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3347/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLFireability-00
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLFireability-06
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLFireability-07
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLFireability-10
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLFireability-15
BK_STOP 1679459410580
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-100A-LTLFireability-00
ltl formula formula --ltl=/tmp/3347/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 3103 places, 2603 transitions and 10006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3347/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.180 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3347/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3347/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3347/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
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-100A-LTLFireability-03
ltl formula formula --ltl=/tmp/3347/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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 3103 places, 2603 transitions and 10006 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.510 real 0.160 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3347/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3347/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3347/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3347/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
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)
ltl formula name ShieldPPPs-PT-100A-LTLFireability-06
ltl formula formula --ltl=/tmp/3347/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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3103 places, 2603 transitions and 10006 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.470 real 0.170 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3347/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3347/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3347/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3347/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 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 ShieldPPPs-PT-100A-LTLFireability-07
ltl formula formula --ltl=/tmp/3347/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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3103 places, 2603 transitions and 10006 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.820 real 0.150 user 0.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3347/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3347/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3347/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3347/ltl_3_
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:
0: pnml2lts-mc(+0xa23f4) [0x559014ec93f4]
1: pnml2lts-mc(+0xa2496) [0x559014ec9496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7febf7215140]
3: pnml2lts-mc(+0x405be5) [0x55901522cbe5]
4: pnml2lts-mc(+0x16b3f9) [0x559014f923f9]
5: pnml2lts-mc(+0x164ac4) [0x559014f8bac4]
6: pnml2lts-mc(+0x272e0a) [0x559015099e0a]
7: pnml2lts-mc(+0xb61f0) [0x559014edd1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7febf70684d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7febf706867a]
10: pnml2lts-mc(+0xa1581) [0x559014ec8581]
11: pnml2lts-mc(+0xa1910) [0x559014ec8910]
12: pnml2lts-mc(+0xa32a2) [0x559014eca2a2]
13: pnml2lts-mc(+0xa50f4) [0x559014ecc0f4]
14: pnml2lts-mc(+0xa516b) [0x559014ecc16b]
15: pnml2lts-mc(+0x3f34b3) [0x55901521a4b3]
16: pnml2lts-mc(+0x7c63d) [0x559014ea363d]
17: pnml2lts-mc(+0x67d86) [0x559014e8ed86]
18: pnml2lts-mc(+0x60a8a) [0x559014e87a8a]
19: pnml2lts-mc(+0x5eb15) [0x559014e85b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7febf7050d0a]
21: pnml2lts-mc(+0x6075e) [0x559014e8775e]
ltl formula name ShieldPPPs-PT-100A-LTLFireability-10
ltl formula formula --ltl=/tmp/3347/ltl_4_
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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3103 places, 2603 transitions and 10006 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.660 real 0.170 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3347/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3347/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3347/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3347/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-100A-LTLFireability-15
ltl formula formula --ltl=/tmp/3347/ltl_5_
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 3103 places, 2603 transitions and 10006 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.490 real 0.160 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3347/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3347/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3347/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3347/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
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="ShieldPPPs-PT-100A"
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 ShieldPPPs-PT-100A, 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 r393-oct2-167903717100516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100A.tgz
mv ShieldPPPs-PT-100A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;