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.r521-tall-167987246100060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Anderson-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 31 16:48 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 Anderson-PT-11-LTLFireability-00
FORMULA_NAME Anderson-PT-11-LTLFireability-01
FORMULA_NAME Anderson-PT-11-LTLFireability-02
FORMULA_NAME Anderson-PT-11-LTLFireability-03
FORMULA_NAME Anderson-PT-11-LTLFireability-04
FORMULA_NAME Anderson-PT-11-LTLFireability-05
FORMULA_NAME Anderson-PT-11-LTLFireability-06
FORMULA_NAME Anderson-PT-11-LTLFireability-07
FORMULA_NAME Anderson-PT-11-LTLFireability-08
FORMULA_NAME Anderson-PT-11-LTLFireability-09
FORMULA_NAME Anderson-PT-11-LTLFireability-10
FORMULA_NAME Anderson-PT-11-LTLFireability-11
FORMULA_NAME Anderson-PT-11-LTLFireability-12
FORMULA_NAME Anderson-PT-11-LTLFireability-13
FORMULA_NAME Anderson-PT-11-LTLFireability-14
FORMULA_NAME Anderson-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680867799555

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=Anderson-PT-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 11:43:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 11:43:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 11:43:21] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-04-07 11:43:21] [INFO ] Transformed 749 places.
[2023-04-07 11:43:21] [INFO ] Transformed 3245 transitions.
[2023-04-07 11:43:21] [INFO ] Found NUPN structural information;
[2023-04-07 11:43:22] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 193 places :
Symmetric choice reduction at 0 with 193 rule applications. Total rules 193 place count 556 transition count 1372
Iterating global reduction 0 with 193 rules applied. Total rules applied 386 place count 556 transition count 1372
Applied a total of 386 rules in 173 ms. Remains 556 /749 variables (removed 193) and now considering 1372/3245 (removed 1873) transitions.
// Phase 1: matrix 1372 rows 556 cols
[2023-04-07 11:43:22] [INFO ] Computed 25 invariants in 56 ms
[2023-04-07 11:43:23] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2023-04-07 11:43:23] [INFO ] Invariant cache hit.
[2023-04-07 11:43:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:26] [INFO ] Implicit Places using invariants and state equation in 2837 ms returned []
Implicit Place search using SMT with State Equation took 3919 ms to find 0 implicit places.
[2023-04-07 11:43:26] [INFO ] Invariant cache hit.
[2023-04-07 11:43:27] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 556/749 places, 1372/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4995 ms. Remains : 556/749 places, 1372/3245 transitions.
Support contains 50 out of 556 places after structural reductions.
[2023-04-07 11:43:27] [INFO ] Flatten gal took : 210 ms
[2023-04-07 11:43:27] [INFO ] Flatten gal took : 106 ms
[2023-04-07 11:43:28] [INFO ] Input system was already deterministic with 1372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 35) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-04-07 11:43:28] [INFO ] Invariant cache hit.
[2023-04-07 11:43:29] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 11:43:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 74 ms returned sat
[2023-04-07 11:43:29] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 16 ms returned sat
[2023-04-07 11:43:32] [INFO ] After 2730ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-04-07 11:43:32] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:35] [INFO ] After 2815ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :2 sat :16
[2023-04-07 11:43:39] [INFO ] After 6857ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 2176 ms.
[2023-04-07 11:43:41] [INFO ] After 12431ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 24 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 12 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 232 place count 434 transition count 1030
Iterating global reduction 0 with 12 rules applied. Total rules applied 244 place count 434 transition count 1030
Applied a total of 244 rules in 184 ms. Remains 434 /556 variables (removed 122) and now considering 1030/1372 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 434/556 places, 1030/1372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1030 rows 434 cols
[2023-04-07 11:43:42] [INFO ] Computed 25 invariants in 16 ms
[2023-04-07 11:43:42] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 11:43:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-04-07 11:43:43] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 16 ms returned sat
[2023-04-07 11:43:44] [INFO ] After 1263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 11:43:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:45] [INFO ] After 944ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 11:43:46] [INFO ] After 1942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 831 ms.
[2023-04-07 11:43:47] [INFO ] After 4452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 2 properties in 31 ms.
Support contains 15 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1030/1030 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 427 transition count 883
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 427 transition count 883
Applied a total of 14 rules in 36 ms. Remains 427 /434 variables (removed 7) and now considering 883/1030 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 427/434 places, 883/1030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 883 rows 427 cols
[2023-04-07 11:43:47] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 11:43:47] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-04-07 11:43:47] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 25 ms returned sat
[2023-04-07 11:43:48] [INFO ] After 1069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 11:43:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 11:43:48] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 11:43:49] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 11:43:49] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:50] [INFO ] After 525ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 11:43:50] [INFO ] After 921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-04-07 11:43:50] [INFO ] After 2160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 7 ms.
Support contains 9 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 883/883 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 424 transition count 820
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 424 transition count 820
Applied a total of 6 rules in 29 ms. Remains 424 /427 variables (removed 3) and now considering 820/883 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 424/427 places, 820/883 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 423941 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{0=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 423941 steps, saw 318767 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 820 rows 424 cols
[2023-04-07 11:43:54] [INFO ] Computed 25 invariants in 14 ms
[2023-04-07 11:43:54] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 11:43:54] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 24 ms returned sat
[2023-04-07 11:43:55] [INFO ] After 282ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 11:43:55] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:43:55] [INFO ] After 171ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:43:55] [INFO ] After 673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:43:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 11:43:55] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 11:43:55] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:56] [INFO ] After 153ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:43:56] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 11:43:56] [INFO ] After 832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 820/820 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 420 transition count 736
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 420 transition count 736
Applied a total of 8 rules in 30 ms. Remains 420 /424 variables (removed 4) and now considering 736/820 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 420/424 places, 736/820 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 917689 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 917689 steps, saw 702200 distinct states, run finished after 3003 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 11:43:59] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 11:43:59] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 11:43:59] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 59 ms returned sat
[2023-04-07 11:43:59] [INFO ] After 265ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 11:43:59] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:00] [INFO ] After 103ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:44:00] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:44:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 11:44:00] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 11:44:00] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:00] [INFO ] After 161ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:00] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 11:44:00] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 736/736 transitions.
Applied a total of 0 rules in 23 ms. Remains 420 /420 variables (removed 0) and now considering 736/736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 420/420 places, 736/736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 736/736 transitions.
Applied a total of 0 rules in 25 ms. Remains 420 /420 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2023-04-07 11:44:00] [INFO ] Invariant cache hit.
[2023-04-07 11:44:01] [INFO ] Implicit Places using invariants in 627 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 419/420 places, 736/736 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 298 transition count 615
Applied a total of 242 rules in 55 ms. Remains 298 /419 variables (removed 121) and now considering 615/736 (removed 121) transitions.
// Phase 1: matrix 615 rows 298 cols
[2023-04-07 11:44:01] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:44:01] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-04-07 11:44:01] [INFO ] Invariant cache hit.
[2023-04-07 11:44:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:02] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 298/420 places, 615/736 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2014 ms. Remains : 298/420 places, 615/736 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1069873 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1069873 steps, saw 797168 distinct states, run finished after 3009 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:44:05] [INFO ] Invariant cache hit.
[2023-04-07 11:44:05] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 11:44:05] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 11:44:05] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 11:44:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:06] [INFO ] After 77ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:44:06] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:44:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 11:44:06] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 70 ms returned sat
[2023-04-07 11:44:06] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:06] [INFO ] After 117ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:06] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 11:44:06] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 8 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 298/298 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2023-04-07 11:44:06] [INFO ] Invariant cache hit.
[2023-04-07 11:44:07] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-04-07 11:44:07] [INFO ] Invariant cache hit.
[2023-04-07 11:44:07] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:08] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2023-04-07 11:44:08] [INFO ] Redundant transitions in 34 ms returned []
[2023-04-07 11:44:08] [INFO ] Invariant cache hit.
[2023-04-07 11:44:08] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1830 ms. Remains : 298/298 places, 615/615 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 494
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 494
Applied a total of 242 rules in 11 ms. Remains 177 /298 variables (removed 121) and now considering 494/615 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 177 cols
[2023-04-07 11:44:08] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:44:08] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 11:44:08] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 11:44:08] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 11:44:08] [INFO ] After 127ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 11:44:08] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
FORMULA Anderson-PT-11-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 246 place count 420 transition count 736
Iterating global reduction 0 with 26 rules applied. Total rules applied 272 place count 420 transition count 736
Applied a total of 272 rules in 95 ms. Remains 420 /556 variables (removed 136) and now considering 736/1372 (removed 636) transitions.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 11:44:09] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:44:09] [INFO ] Implicit Places using invariants in 572 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 579 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/556 places, 736/1372 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 17 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2023-04-07 11:44:09] [INFO ] Computed 24 invariants in 11 ms
[2023-04-07 11:44:10] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-04-07 11:44:10] [INFO ] Invariant cache hit.
[2023-04-07 11:44:10] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:11] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/556 places, 616/1372 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1954 ms. Remains : 299/556 places, 616/1372 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8 reset in 267 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-00 finished in 2432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&F(p2)))&&p0)))'
Support contains 4 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 531 transition count 867
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 531 transition count 867
Applied a total of 50 rules in 20 ms. Remains 531 /556 variables (removed 25) and now considering 867/1372 (removed 505) transitions.
// Phase 1: matrix 867 rows 531 cols
[2023-04-07 11:44:11] [INFO ] Computed 25 invariants in 11 ms
[2023-04-07 11:44:12] [INFO ] Implicit Places using invariants in 591 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 604 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/556 places, 867/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (EQ s12 0) (EQ s37 0)), p1:(OR (NEQ s11 1) (NEQ s41 1)), p0:(AND (EQ s11 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p0&&X(X(G(p2))))))'
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 27 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 11:44:12] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 11:44:12] [INFO ] Implicit Places using invariants in 470 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 521 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={0} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s34 1)), p1:(AND (EQ s24 1) (EQ s44 1)), p2:(OR (AND (EQ s24 1) (EQ s40 1)) (NOT (AND (EQ s24 1) (EQ s44 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Product exploration explored 100000 steps with 0 reset in 315 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 (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 244 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 232968 steps, run visited all 1 properties in 665 ms. (steps per millisecond=350 )
Probabilistic random walk after 232968 steps, saw 182967 distinct states, run finished after 665 ms. (steps per millisecond=350 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 229 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 531 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 9 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 11:44:15] [INFO ] Computed 24 invariants in 10 ms
[2023-04-07 11:44:15] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-04-07 11:44:15] [INFO ] Invariant cache hit.
[2023-04-07 11:44:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:17] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
[2023-04-07 11:44:17] [INFO ] Invariant cache hit.
[2023-04-07 11:44:18] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3073 ms. Remains : 531/531 places, 888/888 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 : [p2, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 9333 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1166 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 119 place count 531 transition count 888
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 229 place count 531 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 530 transition count 867
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 530 transition count 867
Deduced a syphon composed of 229 places in 1 ms
Applied a total of 231 rules in 51 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
[2023-04-07 11:44:20] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 867 rows 530 cols
[2023-04-07 11:44:20] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 11:44:21] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/531 places, 867/888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1166 ms. Remains : 530/531 places, 867/888 transitions.
Support contains 3 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 530 transition count 867
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 530 transition count 867
Applied a total of 2 rules in 53 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
// Phase 1: matrix 867 rows 530 cols
[2023-04-07 11:44:21] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 11:44:22] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-04-07 11:44:22] [INFO ] Invariant cache hit.
[2023-04-07 11:44:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:24] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2692 ms to find 0 implicit places.
[2023-04-07 11:44:24] [INFO ] Invariant cache hit.
[2023-04-07 11:44:24] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/531 places, 867/888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3408 ms. Remains : 530/531 places, 867/888 transitions.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 12502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0)||p0)))&&(X(X(G(p0))) U p1)))'
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 531 transition count 867
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 531 transition count 867
Applied a total of 50 rules in 18 ms. Remains 531 /556 variables (removed 25) and now considering 867/1372 (removed 505) transitions.
// Phase 1: matrix 867 rows 531 cols
[2023-04-07 11:44:25] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 11:44:25] [INFO ] Implicit Places using invariants in 801 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 815 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/556 places, 867/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 856 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s38 1)), p0:(AND (EQ s12 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-06 finished in 1093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 6 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 531 transition count 867
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 531 transition count 867
Applied a total of 50 rules in 33 ms. Remains 531 /556 variables (removed 25) and now considering 867/1372 (removed 505) transitions.
// Phase 1: matrix 867 rows 531 cols
[2023-04-07 11:44:26] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:44:26] [INFO ] Implicit Places using invariants in 732 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 735 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/556 places, 867/1372 transitions.
Applied a total of 0 rules in 45 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 830 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s19 1) (EQ s41 1)), p0:(OR (EQ s3 0) (EQ s339 0) (AND (OR (EQ s17 0) (EQ s44 0)) (OR (EQ s3 0) (EQ s339 0))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 721 ms.
Product exploration explored 100000 steps with 50000 reset in 677 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 (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 2526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 530 transition count 846
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 530 transition count 846
Applied a total of 52 rules in 20 ms. Remains 530 /556 variables (removed 26) and now considering 846/1372 (removed 526) transitions.
// Phase 1: matrix 846 rows 530 cols
[2023-04-07 11:44:28] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:44:29] [INFO ] Implicit Places using invariants in 470 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 481 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/556 places, 846/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 509 ms. Remains : 529/556 places, 846/1372 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s26 1) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 193 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 923820 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923820 steps, saw 704047 distinct states, run finished after 3002 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 11:44:32] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 11:44:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 11:44:33] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 11:44:33] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:44:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 11:44:33] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 18 ms returned sat
[2023-04-07 11:44:33] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:33] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:34] [INFO ] After 246ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:34] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 11:44:34] [INFO ] After 873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 846/846 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 726
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 409 transition count 726
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 409 transition count 616
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 298 transition count 615
Applied a total of 462 rules in 39 ms. Remains 298 /529 variables (removed 231) and now considering 615/846 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 298/529 places, 615/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 933125 steps, run visited all 1 properties in 2804 ms. (steps per millisecond=332 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2806 ms. (steps per millisecond=332 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Applied a total of 0 rules in 11 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-04-07 11:44:37] [INFO ] Invariant cache hit.
[2023-04-07 11:44:38] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-04-07 11:44:38] [INFO ] Invariant cache hit.
[2023-04-07 11:44:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:39] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-04-07 11:44:39] [INFO ] Invariant cache hit.
[2023-04-07 11:44:40] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2934 ms. Remains : 529/529 places, 846/846 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 899509 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899509 steps, saw 685762 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:44:43] [INFO ] Invariant cache hit.
[2023-04-07 11:44:44] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 11:44:44] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 29 ms returned sat
[2023-04-07 11:44:44] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:44:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 11:44:45] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 11:44:45] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:45] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:45] [INFO ] After 190ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:44:46] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-04-07 11:44:46] [INFO ] After 1344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 846/846 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 726
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 409 transition count 726
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 409 transition count 616
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 298 transition count 615
Applied a total of 462 rules in 38 ms. Remains 298 /529 variables (removed 231) and now considering 615/846 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 298/529 places, 615/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 933125 steps, run visited all 1 properties in 2909 ms. (steps per millisecond=320 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2923 ms. (steps per millisecond=319 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 846
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 120 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 230 place count 529 transition count 846
Deduced a syphon composed of 230 places in 1 ms
Applied a total of 230 rules in 45 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-04-07 11:44:51] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 11:44:51] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 11:44:59] [INFO ] Dead Transitions using invariants and state equation in 8145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 529/529 places, 846/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8273 ms. Remains : 529/529 places, 846/846 transitions.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Applied a total of 0 rules in 22 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 11:44:59] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 11:44:59] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-04-07 11:44:59] [INFO ] Invariant cache hit.
[2023-04-07 11:45:00] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:05] [INFO ] Implicit Places using invariants and state equation in 5146 ms returned []
Implicit Place search using SMT with State Equation took 5846 ms to find 0 implicit places.
[2023-04-07 11:45:05] [INFO ] Invariant cache hit.
[2023-04-07 11:45:09] [INFO ] Dead Transitions using invariants and state equation in 4098 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10005 ms. Remains : 529/529 places, 846/846 transitions.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 40969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)||X(p2)))||X(G(p3)))))'
Support contains 8 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 25 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 11:45:09] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:45:10] [INFO ] Implicit Places using invariants in 823 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 845 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 883 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s39 1)), p2:(AND (EQ s22 1) (EQ s134 1)), p3:(OR (EQ s12 0) (EQ s34 0)), p1:(AND (EQ s31 1) (EQ s44 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 33323 reset in 442 ms.
Product exploration explored 100000 steps with 33220 reset in 629 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 (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 11:45:12] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 11:45:12] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-04-07 11:45:12] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 19 ms returned sat
[2023-04-07 11:45:13] [INFO ] After 776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-04-07 11:45:13] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 25 ms returned sat
[2023-04-07 11:45:13] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:14] [INFO ] After 217ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:14] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-04-07 11:45:14] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 769
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 412 transition count 769
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 238 place count 412 transition count 659
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 458 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 459 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 460 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 636
Applied a total of 464 rules in 93 ms. Remains 299 /531 variables (removed 232) and now considering 636/888 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 299/531 places, 636/888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 892661 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 892661 steps, saw 665396 distinct states, run finished after 3010 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 11:45:17] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:45:17] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-04-07 11:45:17] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 23 ms returned sat
[2023-04-07 11:45:17] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 11:45:18] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 80 ms returned sat
[2023-04-07 11:45:19] [INFO ] After 1172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:19] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:19] [INFO ] After 207ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:19] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 11:45:19] [INFO ] After 1841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 23 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 11:45:19] [INFO ] Invariant cache hit.
[2023-04-07 11:45:20] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-04-07 11:45:20] [INFO ] Invariant cache hit.
[2023-04-07 11:45:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:21] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2023-04-07 11:45:21] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 11:45:21] [INFO ] Invariant cache hit.
[2023-04-07 11:45:22] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2891 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 9 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 11:45:22] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 11:45:22] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 11:45:22] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 24 ms returned sat
[2023-04-07 11:45:24] [INFO ] After 1581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 11:45:24] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 11:45:24] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:24] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 11:45:24] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 358 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 7 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 11:45:25] [INFO ] Computed 24 invariants in 13 ms
[2023-04-07 11:45:26] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-04-07 11:45:26] [INFO ] Invariant cache hit.
[2023-04-07 11:45:26] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:28] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2993 ms to find 0 implicit places.
[2023-04-07 11:45:28] [INFO ] Invariant cache hit.
[2023-04-07 11:45:30] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4428 ms. Remains : 531/531 places, 888/888 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 : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:45:30] [INFO ] Invariant cache hit.
[2023-04-07 11:45:31] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 11:45:31] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 30 ms returned sat
[2023-04-07 11:45:31] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 11:45:31] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 45 ms returned sat
[2023-04-07 11:45:31] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:32] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:32] [INFO ] After 274ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:32] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-04-07 11:45:32] [INFO ] After 1664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 769
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 412 transition count 769
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 238 place count 412 transition count 659
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 458 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 459 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 460 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 636
Applied a total of 464 rules in 31 ms. Remains 299 /531 variables (removed 232) and now considering 636/888 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 299/531 places, 636/888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 950460 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 950460 steps, saw 707004 distinct states, run finished after 3002 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 11:45:35] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:45:35] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-04-07 11:45:35] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 40 ms returned sat
[2023-04-07 11:45:36] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 11:45:36] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 68 ms returned sat
[2023-04-07 11:45:36] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:36] [INFO ] After 103ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:36] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-04-07 11:45:36] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 11:45:36] [INFO ] Invariant cache hit.
[2023-04-07 11:45:37] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-04-07 11:45:37] [INFO ] Invariant cache hit.
[2023-04-07 11:45:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:38] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2023-04-07 11:45:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 11:45:39] [INFO ] Invariant cache hit.
[2023-04-07 11:45:39] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2779 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 24 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 11:45:39] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 11:45:39] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-04-07 11:45:39] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 27 ms returned sat
[2023-04-07 11:45:40] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 11:45:40] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 20 ms returned sat
[2023-04-07 11:45:40] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:40] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 11:45:40] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 711 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33388 reset in 496 ms.
Product exploration explored 100000 steps with 33348 reset in 478 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 118 place count 531 transition count 888
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 228 place count 531 transition count 888
Deduced a syphon composed of 228 places in 7 ms
Applied a total of 228 rules in 38 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2023-04-07 11:45:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 11:45:43] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 11:45:45] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 531/531 places, 888/888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1521 ms. Remains : 531/531 places, 888/888 transitions.
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 7 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 11:45:45] [INFO ] Computed 24 invariants in 12 ms
[2023-04-07 11:45:45] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-04-07 11:45:45] [INFO ] Invariant cache hit.
[2023-04-07 11:45:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:47] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
[2023-04-07 11:45:47] [INFO ] Invariant cache hit.
[2023-04-07 11:45:49] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4132 ms. Remains : 531/531 places, 888/888 transitions.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 39759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 245 place count 421 transition count 757
Iterating global reduction 0 with 25 rules applied. Total rules applied 270 place count 421 transition count 757
Applied a total of 270 rules in 47 ms. Remains 421 /556 variables (removed 135) and now considering 757/1372 (removed 615) transitions.
// Phase 1: matrix 757 rows 421 cols
[2023-04-07 11:45:49] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 11:45:50] [INFO ] Implicit Places using invariants in 905 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 906 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/556 places, 757/1372 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 9 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2023-04-07 11:45:50] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:45:50] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-04-07 11:45:50] [INFO ] Invariant cache hit.
[2023-04-07 11:45:51] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:52] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/556 places, 638/1372 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2997 ms. Remains : 301/556 places, 638/1372 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s17 1) (EQ s45 1))) (NOT (AND (EQ s28 1) (EQ s34 1)))), p0:(AND (EQ s28 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 180 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:45:53] [INFO ] Invariant cache hit.
[2023-04-07 11:45:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 11:45:53] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 11:45:54] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:45:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-04-07 11:45:54] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 11:45:54] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:54] [INFO ] After 117ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:45:54] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-07 11:45:54] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 638/638 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 301 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 300 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 299 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 298 transition count 615
Applied a total of 6 rules in 26 ms. Remains 298 /301 variables (removed 3) and now considering 615/638 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 298/301 places, 615/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21893 steps, run visited all 1 properties in 56 ms. (steps per millisecond=390 )
Probabilistic random walk after 21893 steps, saw 18041 distinct states, run finished after 57 ms. (steps per millisecond=384 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 269 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 11:45:55] [INFO ] Invariant cache hit.
[2023-04-07 11:45:56] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-04-07 11:45:56] [INFO ] Invariant cache hit.
[2023-04-07 11:45:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:45:57] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2023-04-07 11:45:57] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 11:45:57] [INFO ] Invariant cache hit.
[2023-04-07 11:45:58] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2555 ms. Remains : 301/301 places, 638/638 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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:45:58] [INFO ] Invariant cache hit.
[2023-04-07 11:45:59] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 11:45:59] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 64 ms returned sat
[2023-04-07 11:46:00] [INFO ] After 1484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:46:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 11:46:00] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 45 ms returned sat
[2023-04-07 11:46:00] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:46:00] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:00] [INFO ] After 118ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:46:01] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 11:46:01] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 638/638 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 301 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 300 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 299 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 298 transition count 615
Applied a total of 6 rules in 57 ms. Remains 298 /301 variables (removed 3) and now considering 615/638 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 298/301 places, 615/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21893 steps, run visited all 1 properties in 123 ms. (steps per millisecond=177 )
Probabilistic random walk after 21893 steps, saw 18041 distinct states, run finished after 133 ms. (steps per millisecond=164 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 430 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 0 reset in 302 ms.
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 11:46:02] [INFO ] Invariant cache hit.
[2023-04-07 11:46:03] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-04-07 11:46:03] [INFO ] Invariant cache hit.
[2023-04-07 11:46:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:04] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2023-04-07 11:46:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 11:46:04] [INFO ] Invariant cache hit.
[2023-04-07 11:46:05] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2814 ms. Remains : 301/301 places, 638/638 transitions.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 16451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G(p2)))'
Support contains 6 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 25 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 11:46:05] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:46:06] [INFO ] Implicit Places using invariants in 1031 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1039 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 18 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1083 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 597 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(OR (AND (EQ s31 1) (EQ s38 1)) (AND (EQ s19 1) (EQ s44 1))), p2:(OR (NEQ s12 1) (NEQ s42 1)), p1:(AND (EQ s19 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 183 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 (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 451 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished Best-First random walk after 865 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=432 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 21 factoid took 493 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-12 finished in 3149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (p1||X((p2||(X(p4)&&p3))))))'
Support contains 7 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 868
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 868
Applied a total of 48 rules in 20 ms. Remains 532 /556 variables (removed 24) and now considering 868/1372 (removed 504) transitions.
// Phase 1: matrix 868 rows 532 cols
[2023-04-07 11:46:08] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:46:09] [INFO ] Implicit Places using invariants in 980 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 998 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 868/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1041 ms. Remains : 531/556 places, 868/1372 transitions.
Stuttering acceptance computed with spot in 477 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p4)), true, (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4)))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s68 1), p2:(AND (EQ s16 1) (EQ s40 1)), p3:(AND (EQ s24 1) (EQ s90 1)), p0:(AND (EQ s12 1) (EQ s35 1)), p4:(AND (EQ s24 1) (EQ s90 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-13 finished in 1558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(G(p1)||F(p2)))))'
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 17 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 11:46:10] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:46:13] [INFO ] Implicit Places using invariants in 3275 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3308 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3340 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=2, aps=[p2:(OR (EQ s25 0) (EQ s36 0)), p1:(AND (EQ s25 1) (EQ s40 1)), p0:(AND (EQ s27 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-14 finished in 3734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 245 place count 421 transition count 757
Iterating global reduction 0 with 25 rules applied. Total rules applied 270 place count 421 transition count 757
Applied a total of 270 rules in 33 ms. Remains 421 /556 variables (removed 135) and now considering 757/1372 (removed 615) transitions.
// Phase 1: matrix 757 rows 421 cols
[2023-04-07 11:46:14] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 11:46:15] [INFO ] Implicit Places using invariants in 890 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 905 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/556 places, 757/1372 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 16 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2023-04-07 11:46:15] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:46:15] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-04-07 11:46:15] [INFO ] Invariant cache hit.
[2023-04-07 11:46:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:17] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/556 places, 638/1372 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3141 ms. Remains : 301/556 places, 638/1372 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s22 1) (EQ s44 1) (EQ s22 1) (EQ s37 1))) (NOT (AND (EQ s22 1) (EQ s37 1)))), p0:(AND (EQ s22 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22 reset in 213 ms.
Product exploration explored 100000 steps with 23 reset in 176 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:46:18] [INFO ] Invariant cache hit.
[2023-04-07 11:46:18] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 11:46:19] [INFO ] Invariant cache hit.
[2023-04-07 11:46:19] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-04-07 11:46:19] [INFO ] Invariant cache hit.
[2023-04-07 11:46:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:21] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-04-07 11:46:21] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 11:46:21] [INFO ] Invariant cache hit.
[2023-04-07 11:46:21] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2763 ms. Remains : 301/301 places, 638/638 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 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 132 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2021 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=505 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 246 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 170 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21 reset in 165 ms.
Product exploration explored 100000 steps with 30 reset in 171 ms.
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 11:46:23] [INFO ] Invariant cache hit.
[2023-04-07 11:46:23] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-04-07 11:46:23] [INFO ] Invariant cache hit.
[2023-04-07 11:46:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:25] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2023-04-07 11:46:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 11:46:25] [INFO ] Invariant cache hit.
[2023-04-07 11:46:26] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2948 ms. Remains : 301/301 places, 638/638 transitions.
Treatment of property Anderson-PT-11-LTLFireability-15 finished in 12265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p0&&X(X(G(p2))))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-03
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 244 place count 422 transition count 778
Iterating global reduction 0 with 24 rules applied. Total rules applied 268 place count 422 transition count 778
Applied a total of 268 rules in 24 ms. Remains 422 /556 variables (removed 134) and now considering 778/1372 (removed 594) transitions.
// Phase 1: matrix 778 rows 422 cols
[2023-04-07 11:46:27] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 11:46:27] [INFO ] Implicit Places using invariants in 438 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 467 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/556 places, 778/1372 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 9 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 11:46:27] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:46:27] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-04-07 11:46:27] [INFO ] Invariant cache hit.
[2023-04-07 11:46:28] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:29] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2048 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/556 places, 660/1372 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2548 ms. Remains : 303/556 places, 660/1372 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={0} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s34 1)), p1:(AND (EQ s24 1) (EQ s44 1)), p2:(OR (AND (EQ s24 1) (EQ s40 1)) (NOT (AND (EQ s24 1) (EQ s44 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 191 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 (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 477 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 4935 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=987 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 368 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 11:46:31] [INFO ] Invariant cache hit.
[2023-04-07 11:46:31] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-04-07 11:46:31] [INFO ] Invariant cache hit.
[2023-04-07 11:46:32] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:33] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
[2023-04-07 11:46:33] [INFO ] Invariant cache hit.
[2023-04-07 11:46:34] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2956 ms. Remains : 303/303 places, 660/660 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 : [p2, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 7576 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1082 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 288 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 660
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 302 transition count 639
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 302 transition count 639
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 3 rules in 31 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
[2023-04-07 11:46:36] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 639 rows 302 cols
[2023-04-07 11:46:36] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 11:46:37] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/303 places, 639/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 770 ms. Remains : 302/303 places, 639/660 transitions.
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 302 transition count 639
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 302 transition count 639
Applied a total of 2 rules in 9 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
// Phase 1: matrix 639 rows 302 cols
[2023-04-07 11:46:37] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 11:46:37] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-04-07 11:46:37] [INFO ] Invariant cache hit.
[2023-04-07 11:46:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:39] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
[2023-04-07 11:46:39] [INFO ] Invariant cache hit.
[2023-04-07 11:46:44] [INFO ] Dead Transitions using invariants and state equation in 4889 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 302/303 places, 639/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7197 ms. Remains : 302/303 places, 639/660 transitions.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 18082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-09
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 246 place count 420 transition count 736
Iterating global reduction 0 with 26 rules applied. Total rules applied 272 place count 420 transition count 736
Applied a total of 272 rules in 26 ms. Remains 420 /556 variables (removed 136) and now considering 736/1372 (removed 636) transitions.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 11:46:44] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 11:46:45] [INFO ] Implicit Places using invariants in 941 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 973 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 419/556 places, 736/1372 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 7 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2023-04-07 11:46:45] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:46:46] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-04-07 11:46:46] [INFO ] Invariant cache hit.
[2023-04-07 11:46:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:47] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 299/556 places, 616/1372 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2775 ms. Remains : 299/556 places, 616/1372 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s26 1) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 174 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished Best-First random walk after 1552 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=776 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 3 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 11:46:49] [INFO ] Invariant cache hit.
[2023-04-07 11:46:49] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-04-07 11:46:49] [INFO ] Invariant cache hit.
[2023-04-07 11:46:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:51] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
[2023-04-07 11:46:51] [INFO ] Invariant cache hit.
[2023-04-07 11:46:51] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2786 ms. Remains : 299/299 places, 616/616 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969155 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 969155 steps, saw 727529 distinct states, run finished after 3016 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:46:55] [INFO ] Invariant cache hit.
[2023-04-07 11:46:55] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 11:46:55] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 69 ms returned sat
[2023-04-07 11:46:55] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:46:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 11:46:55] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 17 ms returned sat
[2023-04-07 11:46:56] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:46:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:46:56] [INFO ] After 173ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:46:56] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-04-07 11:46:56] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 616/616 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 615
Applied a total of 2 rules in 24 ms. Remains 298 /299 variables (removed 1) and now considering 615/616 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 298/299 places, 615/616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 933125 steps, run visited all 1 properties in 2815 ms. (steps per millisecond=331 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2821 ms. (steps per millisecond=330 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 5 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 11:47:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 11:47:00] [INFO ] Invariant cache hit.
[2023-04-07 11:47:01] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 299/299 places, 616/616 transitions.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 3 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 11:47:01] [INFO ] Invariant cache hit.
[2023-04-07 11:47:02] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-04-07 11:47:02] [INFO ] Invariant cache hit.
[2023-04-07 11:47:02] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:03] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
[2023-04-07 11:47:03] [INFO ] Invariant cache hit.
[2023-04-07 11:47:04] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2915 ms. Remains : 299/299 places, 616/616 transitions.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 20011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)||X(p2)))||X(G(p3)))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-10
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 556 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 244 place count 422 transition count 778
Iterating global reduction 0 with 24 rules applied. Total rules applied 268 place count 422 transition count 778
Applied a total of 268 rules in 28 ms. Remains 422 /556 variables (removed 134) and now considering 778/1372 (removed 594) transitions.
// Phase 1: matrix 778 rows 422 cols
[2023-04-07 11:47:04] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 11:47:05] [INFO ] Implicit Places using invariants in 854 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 874 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/556 places, 778/1372 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 21 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 11:47:05] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:47:06] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-04-07 11:47:06] [INFO ] Invariant cache hit.
[2023-04-07 11:47:06] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:15] [INFO ] Implicit Places using invariants and state equation in 9264 ms returned []
Implicit Place search using SMT with State Equation took 9821 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/556 places, 660/1372 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10753 ms. Remains : 303/556 places, 660/1372 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s39 1)), p2:(AND (EQ s22 1) (EQ s134 1)), p3:(OR (EQ s12 0) (EQ s34 0)), p1:(AND (EQ s31 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33236 reset in 367 ms.
Product exploration explored 100000 steps with 33227 reset in 638 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 (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:47:17] [INFO ] Invariant cache hit.
[2023-04-07 11:47:17] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 11:47:17] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 11:47:18] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:47:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 11:47:18] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 11:47:18] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:18] [INFO ] After 111ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:18] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-04-07 11:47:19] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 660/660 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 299 transition count 636
Applied a total of 8 rules in 48 ms. Remains 299 /303 variables (removed 4) and now considering 636/660 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 299/303 places, 636/660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 946609 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946609 steps, saw 704358 distinct states, run finished after 3010 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 11:47:22] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:47:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 11:47:22] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 20 ms returned sat
[2023-04-07 11:47:22] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:47:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 11:47:22] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 39 ms returned sat
[2023-04-07 11:47:24] [INFO ] After 2263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:24] [INFO ] After 129ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:25] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-04-07 11:47:25] [INFO ] After 2839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 11 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 11:47:25] [INFO ] Invariant cache hit.
[2023-04-07 11:47:25] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-04-07 11:47:25] [INFO ] Invariant cache hit.
[2023-04-07 11:47:26] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:27] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2023-04-07 11:47:27] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 11:47:27] [INFO ] Invariant cache hit.
[2023-04-07 11:47:27] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2744 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 8 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 11:47:27] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 11:47:28] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 11:47:28] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 22 ms returned sat
[2023-04-07 11:47:28] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:47:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 11:47:28] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 24 ms returned sat
[2023-04-07 11:47:28] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:28] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 11:47:28] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 11:47:29] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:47:30] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-04-07 11:47:30] [INFO ] Invariant cache hit.
[2023-04-07 11:47:30] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:32] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2651 ms to find 0 implicit places.
[2023-04-07 11:47:32] [INFO ] Invariant cache hit.
[2023-04-07 11:47:33] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3474 ms. Remains : 303/303 places, 660/660 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 : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 11:47:34] [INFO ] Invariant cache hit.
[2023-04-07 11:47:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 11:47:34] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 17 ms returned sat
[2023-04-07 11:47:34] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:47:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 93 ms returned sat
[2023-04-07 11:47:34] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 80 ms returned sat
[2023-04-07 11:47:35] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:35] [INFO ] After 114ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:35] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-04-07 11:47:35] [INFO ] After 1043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 660/660 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 299 transition count 636
Applied a total of 8 rules in 33 ms. Remains 299 /303 variables (removed 4) and now considering 636/660 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 299/303 places, 636/660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 927214 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 927214 steps, saw 690549 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 11:47:38] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:47:38] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 11:47:38] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 22 ms returned sat
[2023-04-07 11:47:38] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:47:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 11:47:38] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 39 ms returned sat
[2023-04-07 11:47:39] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:39] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:39] [INFO ] After 90ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:39] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 11:47:39] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 24 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 11:47:39] [INFO ] Invariant cache hit.
[2023-04-07 11:47:39] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-04-07 11:47:40] [INFO ] Invariant cache hit.
[2023-04-07 11:47:40] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:41] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-04-07 11:47:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 11:47:41] [INFO ] Invariant cache hit.
[2023-04-07 11:47:42] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2582 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 9 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 11:47:42] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:47:42] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 11:47:42] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 24 ms returned sat
[2023-04-07 11:47:42] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 11:47:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 11:47:42] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 22 ms returned sat
[2023-04-07 11:47:42] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 11:47:42] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 11:47:42] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 394 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33180 reset in 359 ms.
Product exploration explored 100000 steps with 33450 reset in 477 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 11:47:45] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 11:47:45] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 11:47:46] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 775 ms. Remains : 303/303 places, 660/660 transitions.
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 11:47:46] [INFO ] Invariant cache hit.
[2023-04-07 11:47:46] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-04-07 11:47:46] [INFO ] Invariant cache hit.
[2023-04-07 11:47:47] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:47:48] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2023-04-07 11:47:48] [INFO ] Invariant cache hit.
[2023-04-07 11:47:49] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3266 ms. Remains : 303/303 places, 660/660 transitions.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 45119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
[2023-04-07 11:47:50] [INFO ] Flatten gal took : 208 ms
[2023-04-07 11:47:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2023-04-07 11:47:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 556 places, 1372 transitions and 5266 arcs took 29 ms.
Total runtime 268647 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2395/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2395/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2395/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2395/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2395/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-11-LTLFireability-03
Could not compute solution for formula : Anderson-PT-11-LTLFireability-09
Could not compute solution for formula : Anderson-PT-11-LTLFireability-10
Could not compute solution for formula : Anderson-PT-11-LTLFireability-11
Could not compute solution for formula : Anderson-PT-11-LTLFireability-15

BK_STOP 1680868075418

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-11-LTLFireability-03
ltl formula formula --ltl=/tmp/2395/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 556 places, 1372 transitions and 5266 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2395/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2395/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2395/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2395/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Anderson-PT-11-LTLFireability-09
ltl formula formula --ltl=/tmp/2395/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
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 556 places, 1372 transitions and 5266 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.420 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2395/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2395/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2395/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2395/ltl_1_
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 Anderson-PT-11-LTLFireability-10
ltl formula formula --ltl=/tmp/2395/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
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 556 places, 1372 transitions and 5266 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2395/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2395/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.020 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2395/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2395/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name Anderson-PT-11-LTLFireability-11
ltl formula formula --ltl=/tmp/2395/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 556 places, 1372 transitions and 5266 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2395/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2395/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2395/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2395/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Anderson-PT-11-LTLFireability-15
ltl formula formula --ltl=/tmp/2395/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: =============================================================================
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 556 places, 1372 transitions and 5266 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.020 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2395/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2395/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2395/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2395/ltl_4_
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
*** 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) [0x558a8d1c93f4]
1: pnml2lts-mc(+0xa2496) [0x558a8d1c9496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ffb86a81140]
3: pnml2lts-mc(+0x405be5) [0x558a8d52cbe5]
4: pnml2lts-mc(+0x16b3f9) [0x558a8d2923f9]
5: pnml2lts-mc(+0x164ac4) [0x558a8d28bac4]
6: pnml2lts-mc(+0x272e0a) [0x558a8d399e0a]
7: pnml2lts-mc(+0xb61f0) [0x558a8d1dd1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ffb868d44d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ffb868d467a]
10: pnml2lts-mc(+0xa1581) [0x558a8d1c8581]
11: pnml2lts-mc(+0xa1910) [0x558a8d1c8910]
12: pnml2lts-mc(+0xa32a2) [0x558a8d1ca2a2]
13: pnml2lts-mc(+0xa50f4) [0x558a8d1cc0f4]
14: pnml2lts-mc(+0xa516b) [0x558a8d1cc16b]
15: pnml2lts-mc(+0x3f34b3) [0x558a8d51a4b3]
16: pnml2lts-mc(+0x7c63d) [0x558a8d1a363d]
17: pnml2lts-mc(+0x67d86) [0x558a8d18ed86]
18: pnml2lts-mc(+0x60a8a) [0x558a8d187a8a]
19: pnml2lts-mc(+0x5eb15) [0x558a8d185b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ffb868bcd0a]
21: pnml2lts-mc(+0x6075e) [0x558a8d18775e]

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="Anderson-PT-11"
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 Anderson-PT-11, 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 r521-tall-167987246100060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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