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.r519-tall-167987244700060.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 lolaxred
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 r519-tall-167987244700060
=====================================================================

--------------------
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 1680832679858

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 01:58:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 01:58:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:58:01] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-04-07 01:58:01] [INFO ] Transformed 749 places.
[2023-04-07 01:58:01] [INFO ] Transformed 3245 transitions.
[2023-04-07 01:58:01] [INFO ] Found NUPN structural information;
[2023-04-07 01:58:01] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 111 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 01:58:01] [INFO ] Computed 25 invariants in 71 ms
[2023-04-07 01:58:02] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-04-07 01:58:02] [INFO ] Invariant cache hit.
[2023-04-07 01:58:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:04] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
[2023-04-07 01:58:04] [INFO ] Invariant cache hit.
[2023-04-07 01:58:05] [INFO ] Dead Transitions using invariants and state equation in 830 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 4016 ms. Remains : 556/749 places, 1372/3245 transitions.
Support contains 50 out of 556 places after structural reductions.
[2023-04-07 01:58:05] [INFO ] Flatten gal took : 137 ms
[2023-04-07 01:58:06] [INFO ] Flatten gal took : 81 ms
[2023-04-07 01:58:06] [INFO ] Input system was already deterministic with 1372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 35) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) 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 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :1
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 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-04-07 01:58:06] [INFO ] Invariant cache hit.
[2023-04-07 01:58:07] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 01:58:07] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 19 ms returned sat
[2023-04-07 01:58:08] [INFO ] After 1191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-04-07 01:58:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-04-07 01:58:08] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 17 ms returned sat
[2023-04-07 01:58:11] [INFO ] After 2851ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2023-04-07 01:58:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:14] [INFO ] After 3009ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :2 sat :19
[2023-04-07 01:58:18] [INFO ] After 7123ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 2661 ms.
[2023-04-07 01:58:21] [INFO ] After 13144ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 206 ms.
Support contains 28 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 556 transition count 1263
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 447 transition count 1263
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 227 place count 438 transition count 1074
Iterating global reduction 0 with 9 rules applied. Total rules applied 236 place count 438 transition count 1074
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 238 place count 437 transition count 1073
Applied a total of 238 rules in 111 ms. Remains 437 /556 variables (removed 119) and now considering 1073/1372 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 437/556 places, 1073/1372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1073 rows 437 cols
[2023-04-07 01:58:22] [INFO ] Computed 25 invariants in 18 ms
[2023-04-07 01:58:22] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 01:58:22] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 01:58:24] [INFO ] After 1997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-04-07 01:58:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-04-07 01:58:24] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 01:58:26] [INFO ] After 1774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-04-07 01:58:26] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:27] [INFO ] After 1558ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-04-07 01:58:29] [INFO ] After 3328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1520 ms.
[2023-04-07 01:58:31] [INFO ] After 6923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 4 properties in 68 ms.
Support contains 18 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1073/1073 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 430 transition count 926
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 430 transition count 926
Applied a total of 14 rules in 34 ms. Remains 430 /437 variables (removed 7) and now considering 926/1073 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 430/437 places, 926/1073 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) 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 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 926 rows 430 cols
[2023-04-07 01:58:32] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:58:32] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:58:32] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 01:58:32] [INFO ] After 895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 01:58:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 01:58:33] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 01:58:34] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 01:58:34] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:34] [INFO ] After 690ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 01:58:35] [INFO ] After 1394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 557 ms.
[2023-04-07 01:58:36] [INFO ] After 3080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 2 properties in 55 ms.
Support contains 10 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 926/926 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 425 transition count 821
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 425 transition count 821
Applied a total of 10 rules in 28 ms. Remains 425 /430 variables (removed 5) and now considering 821/926 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 425/430 places, 821/926 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 821 rows 425 cols
[2023-04-07 01:58:36] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 01:58:36] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 01:58:36] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 16 ms returned sat
[2023-04-07 01:58:37] [INFO ] After 566ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-04-07 01:58:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:37] [INFO ] After 133ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 01:58:37] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 01:58:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:58:37] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 01:58:38] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 01:58:38] [INFO ] After 609ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 01:58:39] [INFO ] After 1219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-04-07 01:58:39] [INFO ] After 2363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 821/821 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 424 transition count 820
Applied a total of 2 rules in 24 ms. Remains 424 /425 variables (removed 1) and now considering 820/821 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 424/425 places, 820/821 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 336641 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 336641 steps, saw 252520 distinct states, run finished after 3003 ms. (steps per millisecond=112 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 820 rows 424 cols
[2023-04-07 01:58:43] [INFO ] Computed 25 invariants in 14 ms
[2023-04-07 01:58:43] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 01:58:43] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 01:58:43] [INFO ] After 408ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 01:58:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:43] [INFO ] After 130ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 01:58:43] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 01:58:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 01:58:44] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 01:58:44] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 01:58:44] [INFO ] After 331ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 01:58:44] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-04-07 01:58:44] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 820/820 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 421 transition count 757
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 421 transition count 757
Applied a total of 6 rules in 25 ms. Remains 421 /424 variables (removed 3) and now considering 757/820 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 421/424 places, 757/820 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 834003 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{1=1}
Probabilistic random walk after 834003 steps, saw 635082 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 421 cols
[2023-04-07 01:58:48] [INFO ] Computed 25 invariants in 15 ms
[2023-04-07 01:58:48] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 01:58:48] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 01:58:48] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:58:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 01:58:48] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 01:58:48] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:58:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:49] [INFO ] After 163ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:58:49] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 01:58:49] [INFO ] After 614ms 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 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 420 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 736
Applied a total of 2 rules in 30 ms. Remains 420 /421 variables (removed 1) and now considering 736/757 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 420/421 places, 736/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1001520 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1001520 steps, saw 763953 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 01:58:52] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:58:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 01:58:52] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 01:58:52] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 01:58:52] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:52] [INFO ] After 130ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:58:52] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:58:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 01:58:52] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 01:58:52] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:58:53] [INFO ] After 141ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:58:53] [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 32 ms.
[2023-04-07 01:58:53] [INFO ] After 498ms 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 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 32 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 32 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 13 ms. Remains 420 /420 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2023-04-07 01:58:53] [INFO ] Invariant cache hit.
[2023-04-07 01:58:53] [INFO ] Implicit Places using invariants in 433 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 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 27 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 01:58:53] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 01:58:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-04-07 01:58:53] [INFO ] Invariant cache hit.
[2023-04-07 01:58:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:54] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1010 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 1486 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 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1079762 steps, run timeout after 3030 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1079762 steps, saw 804424 distinct states, run finished after 3031 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:58:57] [INFO ] Invariant cache hit.
[2023-04-07 01:58:57] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 01:58:57] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 15 ms returned sat
[2023-04-07 01:58:57] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 01:58:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:57] [INFO ] After 63ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:58:57] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:58:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 01:58:58] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 13 ms returned sat
[2023-04-07 01:58:58] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:58:58] [INFO ] After 89ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:58:58] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-07 01:58:58] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 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 16 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 16 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 01:58:58] [INFO ] Invariant cache hit.
[2023-04-07 01:58:58] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-04-07 01:58:58] [INFO ] Invariant cache hit.
[2023-04-07 01:58:58] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:58:59] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2023-04-07 01:58:59] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:58:59] [INFO ] Invariant cache hit.
[2023-04-07 01:58:59] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1446 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 13 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 01:58:59] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 01:58:59] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 01:58:59] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 01:59:00] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 01:59:00] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 01:59:00] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:00] [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 16 ms.
[2023-04-07 01:59:00] [INFO ] After 211ms SMT Verify possible using all constraints in natural 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 48 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 01:59:00] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 01:59:01] [INFO ] Implicit Places using invariants in 441 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 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 13 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 01:59:01] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 01:59:01] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-04-07 01:59:01] [INFO ] Invariant cache hit.
[2023-04-07 01:59:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:02] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1008 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 1514 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 150 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 2 reset in 269 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-00 finished in 2009 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 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 01:59:02] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 01:59:03] [INFO ] Implicit Places using invariants in 461 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 462 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 9 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 492 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 217 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 1 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 729 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 01:59:03] [INFO ] Computed 25 invariants in 14 ms
[2023-04-07 01:59:03] [INFO ] Implicit Places using invariants in 461 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 463 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 498 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 368 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 177 ms.
Product exploration explored 100000 steps with 0 reset in 220 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 183 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 134 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 232968 steps, run visited all 1 properties in 650 ms. (steps per millisecond=358 )
Probabilistic random walk after 232968 steps, saw 182967 distinct states, run finished after 650 ms. (steps per millisecond=358 ) 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 225 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 118 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 114 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 12 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 01:59:06] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 01:59:06] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-04-07 01:59:06] [INFO ] Invariant cache hit.
[2023-04-07 01:59:06] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:07] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2023-04-07 01:59:07] [INFO ] Invariant cache hit.
[2023-04-07 01:59:08] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2143 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 66 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 105 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 232968 steps, run visited all 1 properties in 603 ms. (steps per millisecond=386 )
Probabilistic random walk after 232968 steps, saw 182967 distinct states, run finished after 603 ms. (steps per millisecond=386 ) properties seen :1
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 95 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 113 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 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 0 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 52 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
[2023-04-07 01:59:10] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 867 rows 530 cols
[2023-04-07 01:59:10] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 01:59:10] [INFO ] Dead Transitions using invariants and state equation in 656 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 744 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 27 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 01:59:10] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 01:59:11] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-04-07 01:59:11] [INFO ] Invariant cache hit.
[2023-04-07 01:59:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:13] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
[2023-04-07 01:59:13] [INFO ] Invariant cache hit.
[2023-04-07 01:59:13] [INFO ] Dead Transitions using invariants and state equation in 647 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 2953 ms. Remains : 530/531 places, 867/888 transitions.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 10656 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 15 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 01:59:14] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 01:59:14] [INFO ] Implicit Places using invariants in 425 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 427 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 7 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 450 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 100 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 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-06 finished in 576 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 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 01:59:14] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 01:59:14] [INFO ] Implicit Places using invariants in 424 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 427 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 7 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 455 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 145 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 535 ms.
Product exploration explored 100000 steps with 50000 reset in 482 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 19 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 1665 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 01:59:16] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 01:59:16] [INFO ] Implicit Places using invariants in 446 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 449 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 7 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 476 ms. Remains : 529/556 places, 846/1372 transitions.
Stuttering acceptance computed with spot in 125 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 140 ms.
Product exploration explored 100000 steps with 0 reset in 150 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 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 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 5093 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1018 )
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 106 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 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 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 13 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 01:59:17] [INFO ] Computed 24 invariants in 12 ms
[2023-04-07 01:59:18] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-04-07 01:59:18] [INFO ] Invariant cache hit.
[2023-04-07 01:59:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:19] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2023-04-07 01:59:19] [INFO ] Invariant cache hit.
[2023-04-07 01:59:20] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2566 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 64 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 103 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 900852 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 900852 steps, saw 686808 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:59:23] [INFO ] Invariant cache hit.
[2023-04-07 01:59:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:59:23] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 01:59:24] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:59:24] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 01:59:24] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:24] [INFO ] After 162ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:24] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 01:59:24] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 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 26 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 26 ms. Remains : 298/529 places, 615/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 2678 ms. (steps per millisecond=348 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2679 ms. (steps per millisecond=348 ) 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 105 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 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 121 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 23 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-04-07 01:59:28] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 01:59:28] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 01:59:29] [INFO ] Dead Transitions using invariants and state equation in 728 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 773 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 7 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 01:59:29] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 01:59:29] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-04-07 01:59:29] [INFO ] Invariant cache hit.
[2023-04-07 01:59:30] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:31] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1619 ms to find 0 implicit places.
[2023-04-07 01:59:31] [INFO ] Invariant cache hit.
[2023-04-07 01:59:31] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2244 ms. Remains : 529/529 places, 846/846 transitions.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 15601 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 15 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 01:59:31] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 01:59:32] [INFO ] Implicit Places using invariants in 427 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 429 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 6 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 450 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 263 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 33381 reset in 419 ms.
Product exploration explored 100000 steps with 33144 reset in 429 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 84 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 110 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 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 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 01:59:33] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 01:59:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:59:33] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 19 ms returned sat
[2023-04-07 01:59:34] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:59:34] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 01:59:34] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:34] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:34] [INFO ] After 169ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:34] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-04-07 01:59:35] [INFO ] After 937ms 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 26 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 27 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 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1063492 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1063492 steps, saw 789171 distinct states, run finished after 3002 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 01:59:38] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 01:59:38] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:38] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 01:59:38] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:38] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 18 ms returned sat
[2023-04-07 01:59:38] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:38] [INFO ] After 81ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:38] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 01:59:38] [INFO ] After 460ms 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 7 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 8 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 01:59:38] [INFO ] Invariant cache hit.
[2023-04-07 01:59:38] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-04-07 01:59:38] [INFO ] Invariant cache hit.
[2023-04-07 01:59:39] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:39] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-04-07 01:59:39] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 01:59:39] [INFO ] Invariant cache hit.
[2023-04-07 01:59:40] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1335 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 7 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 01:59:40] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 01:59:40] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 01:59:40] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 01:59:40] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 01:59:40] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 01:59:40] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:40] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 01:59:40] [INFO ] After 250ms 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 176 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 115 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 112 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 15 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 01:59:40] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 01:59:41] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-04-07 01:59:41] [INFO ] Invariant cache hit.
[2023-04-07 01:59:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:42] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2023-04-07 01:59:42] [INFO ] Invariant cache hit.
[2023-04-07 01:59:43] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2405 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 83 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 125 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 83 ms. (steps per millisecond=120 ) properties (out of 4) 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 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 01:59:43] [INFO ] Invariant cache hit.
[2023-04-07 01:59:43] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 01:59:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:59:43] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 19 ms returned sat
[2023-04-07 01:59:44] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 01:59:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:44] [INFO ] After 255ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 01:59:45] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-04-07 01:59:45] [INFO ] After 1588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 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 531 transition count 770
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 413 transition count 770
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 236 place count 413 transition count 660
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 456 place count 303 transition count 660
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 459 place count 303 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 462 place count 300 transition count 657
Applied a total of 462 rules in 22 ms. Remains 300 /531 variables (removed 231) and now considering 657/888 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 300/531 places, 657/888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) 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 657 rows 300 cols
[2023-04-07 01:59:45] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 01:59:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 01:59:45] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 01:59:45] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:45] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 01:59:45] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:45] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:46] [INFO ] After 82ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:46] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 01:59:46] [INFO ] After 477ms 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 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 657/657 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 299 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 299 transition count 636
Applied a total of 2 rules in 12 ms. Remains 299 /300 variables (removed 1) and now considering 636/657 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 299/300 places, 636/657 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
Interrupted probabilistic random walk after 1050115 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1050115 steps, saw 779621 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 01:59:49] [INFO ] Computed 24 invariants in 10 ms
[2023-04-07 01:59:49] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:49] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 01:59:49] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:49] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 17 ms returned sat
[2023-04-07 01:59:49] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:49] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:49] [INFO ] After 81ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:49] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 01:59:49] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 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 7 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 7 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 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 01:59:49] [INFO ] Invariant cache hit.
[2023-04-07 01:59:49] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-07 01:59:49] [INFO ] Invariant cache hit.
[2023-04-07 01:59:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:50] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-04-07 01:59:50] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 01:59:50] [INFO ] Invariant cache hit.
[2023-04-07 01:59:51] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 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 1 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 14 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 01:59:51] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 01:59:51] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-04-07 01:59:51] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 01:59:51] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 01:59:51] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 01:59:51] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:51] [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 32 ms.
[2023-04-07 01:59:51] [INFO ] After 248ms 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 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 112 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 127 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 113 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 33277 reset in 460 ms.
Product exploration explored 100000 steps with 33222 reset in 447 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 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 1 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 1 ms
Applied a total of 228 rules in 25 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2023-04-07 01:59:53] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 01:59:53] [INFO ] Computed 24 invariants in 8 ms
[2023-04-07 01:59:54] [INFO ] Dead Transitions using invariants and state equation in 744 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 796 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 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 01:59:54] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 01:59:54] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-04-07 01:59:54] [INFO ] Invariant cache hit.
[2023-04-07 01:59:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:55] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2023-04-07 01:59:55] [INFO ] Invariant cache hit.
[2023-04-07 01:59:56] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2490 ms. Remains : 531/531 places, 888/888 transitions.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 24738 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 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 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 23 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 01:59:56] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:59:57] [INFO ] Implicit Places using invariants in 434 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 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 10 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 01:59:57] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 01:59:57] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-04-07 01:59:57] [INFO ] Invariant cache hit.
[2023-04-07 01:59:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:58] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1019 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 1488 ms. Remains : 301/556 places, 638/1372 transitions.
Stuttering acceptance computed with spot in 65 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 165 ms.
Product exploration explored 100000 steps with 0 reset in 167 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 72 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 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-04-07 01:59:58] [INFO ] Invariant cache hit.
[2023-04-07 01:59:58] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:58] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 01:59:58] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:59:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 01:59:58] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 01:59:59] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:59] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:59] [INFO ] After 100ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:59:59] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 01:59:59] [INFO ] After 434ms 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 19 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 19 ms. Remains : 298/301 places, 615/638 transitions.
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 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21893 steps, run visited all 1 properties in 49 ms. (steps per millisecond=446 )
Probabilistic random walk after 21893 steps, saw 18041 distinct states, run finished after 50 ms. (steps per millisecond=437 ) 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 110 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 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 67 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 12 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 01:59:59] [INFO ] Invariant cache hit.
[2023-04-07 01:59:59] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-04-07 01:59:59] [INFO ] Invariant cache hit.
[2023-04-07 02:00:00] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:00] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2023-04-07 02:00:00] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 02:00:00] [INFO ] Invariant cache hit.
[2023-04-07 02:00:01] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1370 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 76 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 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) 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 02:00:01] [INFO ] Invariant cache hit.
[2023-04-07 02:00:01] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:01] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 02:00:01] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:01] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 02:00:01] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:01] [INFO ] After 104ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:01] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 02:00:01] [INFO ] After 443ms 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 21 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 22 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21893 steps, run visited all 1 properties in 50 ms. (steps per millisecond=437 )
Probabilistic random walk after 21893 steps, saw 18041 distinct states, run finished after 50 ms. (steps per millisecond=437 ) 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 132 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 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 161 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 02:00:02] [INFO ] Invariant cache hit.
[2023-04-07 02:00:02] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-07 02:00:02] [INFO ] Invariant cache hit.
[2023-04-07 02:00:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:03] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-04-07 02:00:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 02:00:03] [INFO ] Invariant cache hit.
[2023-04-07 02:00:04] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1369 ms. Remains : 301/301 places, 638/638 transitions.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 7571 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 18 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 02:00:04] [INFO ] Computed 25 invariants in 9 ms
[2023-04-07 02:00:04] [INFO ] Implicit Places using invariants in 457 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 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 6 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 484 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 225 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 159 ms.
Product exploration explored 100000 steps with 0 reset in 156 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 202 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 44 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2532 steps, run visited all 1 properties in 9 ms. (steps per millisecond=281 )
Probabilistic random walk after 2532 steps, saw 2212 distinct states, run finished after 9 ms. (steps per millisecond=281 ) properties seen :1
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 271 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 1608 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 14 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 02:00:05] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 02:00:06] [INFO ] Implicit Places using invariants in 446 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 447 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 6 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 468 ms. Remains : 531/556 places, 868/1372 transitions.
Stuttering acceptance computed with spot in 233 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 725 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 19 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 02:00:06] [INFO ] Computed 25 invariants in 11 ms
[2023-04-07 02:00:06] [INFO ] Implicit Places using invariants in 468 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 469 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 7 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 495 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 185 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 697 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 25 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 02:00:07] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 02:00:07] [INFO ] Implicit Places using invariants in 431 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 432 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 02:00:07] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 02:00:07] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-04-07 02:00:07] [INFO ] Invariant cache hit.
[2023-04-07 02:00:08] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:08] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1071 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 1539 ms. Remains : 301/556 places, 638/1372 transitions.
Stuttering acceptance computed with spot in 77 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 18 reset in 159 ms.
Product exploration explored 100000 steps with 23 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 : [(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 76 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 81 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) 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 02:00:09] [INFO ] Invariant cache hit.
[2023-04-07 02:00:09] [INFO ] After 44ms 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 107 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 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 50 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 6 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 02:00:09] [INFO ] Invariant cache hit.
[2023-04-07 02:00:09] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-04-07 02:00:09] [INFO ] Invariant cache hit.
[2023-04-07 02:00:10] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:10] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-04-07 02:00:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 02:00:10] [INFO ] Invariant cache hit.
[2023-04-07 02:00:11] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1404 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 62 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 71 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2435 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=487 )
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 102 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 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 26 reset in 159 ms.
Product exploration explored 100000 steps with 19 reset in 164 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 6 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 02:00:11] [INFO ] Invariant cache hit.
[2023-04-07 02:00:12] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-04-07 02:00:12] [INFO ] Invariant cache hit.
[2023-04-07 02:00:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:12] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2023-04-07 02:00:12] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 02:00:12] [INFO ] Invariant cache hit.
[2023-04-07 02:00:13] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 301/301 places, 638/638 transitions.
Treatment of property Anderson-PT-11-LTLFireability-15 finished in 6123 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 273 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 36 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 02:00:13] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 02:00:14] [INFO ] Implicit Places using invariants in 435 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 437 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 8 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 02:00:14] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 02:00:14] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-04-07 02:00:14] [INFO ] Invariant cache hit.
[2023-04-07 02:00:14] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:15] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1353 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 1837 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 156 ms.
Product exploration explored 100000 steps with 0 reset in 182 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 186 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 240 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 3007 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1002 )
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 221 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 117 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 95 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 7 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 02:00:16] [INFO ] Invariant cache hit.
[2023-04-07 02:00:16] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-04-07 02:00:16] [INFO ] Invariant cache hit.
[2023-04-07 02:00:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:18] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-04-07 02:00:18] [INFO ] Invariant cache hit.
[2023-04-07 02:00:18] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1847 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 62 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 84 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 165 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
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 91 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 105 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 102 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 0 ms
Applied a total of 3 rules in 18 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
[2023-04-07 02:00:19] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 639 rows 302 cols
[2023-04-07 02:00:19] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 02:00:20] [INFO ] Dead Transitions using invariants and state equation in 324 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 355 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 5 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 02:00:20] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 02:00:20] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-04-07 02:00:20] [INFO ] Invariant cache hit.
[2023-04-07 02:00:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:21] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2023-04-07 02:00:21] [INFO ] Invariant cache hit.
[2023-04-07 02:00:21] [INFO ] Dead Transitions using invariants and state equation in 314 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 1631 ms. Remains : 302/303 places, 639/660 transitions.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 8465 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 97 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 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 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 25 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 02:00:21] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 02:00:22] [INFO ] Implicit Places using invariants in 428 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 432 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 8 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 02:00:22] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 02:00:22] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-07 02:00:22] [INFO ] Invariant cache hit.
[2023-04-07 02:00:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:23] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1080 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 1546 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 152 ms.
Product exploration explored 100000 steps with 0 reset in 212 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 81 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 114 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
Finished Best-First random walk after 1896 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=948 )
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 95 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 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 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 6 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 02:00:24] [INFO ] Invariant cache hit.
[2023-04-07 02:00:24] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-04-07 02:00:24] [INFO ] Invariant cache hit.
[2023-04-07 02:00:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:25] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2023-04-07 02:00:25] [INFO ] Invariant cache hit.
[2023-04-07 02:00:25] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1327 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 74 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 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1076217 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1076217 steps, saw 804579 distinct states, run finished after 3002 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:00:28] [INFO ] Invariant cache hit.
[2023-04-07 02:00:28] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:28] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 02:00:29] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 02:00:29] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 02:00:29] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:29] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:29] [INFO ] After 169ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:29] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-04-07 02:00:29] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 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 13 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 14 ms. Remains : 298/299 places, 615/616 transitions.
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 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 2628 ms. (steps per millisecond=355 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2629 ms. (steps per millisecond=354 ) 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 100 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 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Product exploration explored 100000 steps with 0 reset in 225 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 96 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 6 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 02:00:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 02:00:33] [INFO ] Invariant cache hit.
[2023-04-07 02:00:33] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 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 02:00:33] [INFO ] Invariant cache hit.
[2023-04-07 02:00:33] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-04-07 02:00:33] [INFO ] Invariant cache hit.
[2023-04-07 02:00:34] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:34] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
[2023-04-07 02:00:34] [INFO ] Invariant cache hit.
[2023-04-07 02:00:35] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1389 ms. Remains : 299/299 places, 616/616 transitions.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 13417 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 105 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 26 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 02:00:35] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 02:00:35] [INFO ] Implicit Places using invariants in 421 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 422 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 8 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 02:00:35] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 02:00:36] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-04-07 02:00:36] [INFO ] Invariant cache hit.
[2023-04-07 02:00:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:36] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1198 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 1657 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 33353 reset in 311 ms.
Product exploration explored 100000 steps with 33309 reset in 316 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 93 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 103 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 91 ms. (steps per millisecond=109 ) properties (out of 4) 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 3) 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 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 02:00:37] [INFO ] Invariant cache hit.
[2023-04-07 02:00:38] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:38] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 02:00:38] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:38] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 15 ms returned sat
[2023-04-07 02:00:38] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:38] [INFO ] After 85ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:38] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-04-07 02:00:38] [INFO ] After 532ms 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 18 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 18 ms. Remains : 299/303 places, 636/660 transitions.
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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1080075 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1080075 steps, saw 801197 distinct states, run finished after 3002 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 02:00:41] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 02:00:41] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:41] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 02:00:41] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:41] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 17 ms returned sat
[2023-04-07 02:00:42] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:42] [INFO ] After 81ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:42] [INFO ] After 140ms 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 02:00:42] [INFO ] After 440ms 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 9 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 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 02:00:42] [INFO ] Invariant cache hit.
[2023-04-07 02:00:42] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-04-07 02:00:42] [INFO ] Invariant cache hit.
[2023-04-07 02:00:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:43] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2023-04-07 02:00:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 02:00:43] [INFO ] Invariant cache hit.
[2023-04-07 02:00:43] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1306 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 1 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 02:00:43] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 02:00:43] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-04-07 02:00:43] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:00:43] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 02:00:43] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 02:00:44] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:44] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 02:00:44] [INFO ] After 267ms 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 173 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 122 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 108 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 6 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 02:00:44] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 02:00:44] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-04-07 02:00:44] [INFO ] Invariant cache hit.
[2023-04-07 02:00:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:45] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2023-04-07 02:00:45] [INFO ] Invariant cache hit.
[2023-04-07 02:00:46] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1559 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 91 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 111 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 76 ms. (steps per millisecond=131 ) properties (out of 4) 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 3) 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 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 02:00:46] [INFO ] Invariant cache hit.
[2023-04-07 02:00:46] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:46] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 02:00:46] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:46] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 02:00:46] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:47] [INFO ] After 86ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:47] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-04-07 02:00:47] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 19 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 19 ms. Remains : 299/303 places, 636/660 transitions.
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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1066789 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066789 steps, saw 791543 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 02:00:50] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 02:00:50] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:50] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 02:00:50] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:50] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 17 ms returned sat
[2023-04-07 02:00:50] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:50] [INFO ] After 80ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:50] [INFO ] After 137ms 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 02:00:50] [INFO ] After 443ms 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 9 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 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 02:00:50] [INFO ] Invariant cache hit.
[2023-04-07 02:00:50] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-04-07 02:00:50] [INFO ] Invariant cache hit.
[2023-04-07 02:00:51] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:51] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-04-07 02:00:51] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 02:00:51] [INFO ] Invariant cache hit.
[2023-04-07 02:00:52] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1287 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 02:00:52] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 02:00:52] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 02:00:52] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 02:00:52] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:00:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 02:00:52] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:00:52] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:00:52] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 02:00:52] [INFO ] After 256ms 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 167 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 130 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 110 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 123 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 33482 reset in 309 ms.
Product exploration explored 100000 steps with 33415 reset in 335 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 198 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 11 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 02:00:53] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 02:00:54] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 02:00:54] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 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 3 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 02:00:54] [INFO ] Invariant cache hit.
[2023-04-07 02:00:54] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-04-07 02:00:54] [INFO ] Invariant cache hit.
[2023-04-07 02:00:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:55] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-04-07 02:00:55] [INFO ] Invariant cache hit.
[2023-04-07 02:00:56] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1659 ms. Remains : 303/303 places, 660/660 transitions.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 20932 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 02:00:56] [INFO ] Flatten gal took : 53 ms
[2023-04-07 02:00:56] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 02:00:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 556 places, 1372 transitions and 5266 arcs took 7 ms.
Total runtime 175053 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-11
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1680833107802

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Anderson-PT-11-LTLFireability-03
lola: time limit : 720 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 10/32 Anderson-PT-11-LTLFireability-03 654583 m, 130916 m/sec, 1001683 t fired, .

Time elapsed: 5 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 20/32 Anderson-PT-11-LTLFireability-03 1310157 m, 131114 m/sec, 2005570 t fired, .

Time elapsed: 10 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/720 29/32 Anderson-PT-11-LTLFireability-03 1956545 m, 129277 m/sec, 2999908 t fired, .

Time elapsed: 15 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for Anderson-PT-11-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 Anderson-PT-11-LTLFireability-10
lola: time limit : 895 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/895 10/32 Anderson-PT-11-LTLFireability-10 661466 m, 132293 m/sec, 1030086 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/895 20/32 Anderson-PT-11-LTLFireability-10 1306761 m, 129059 m/sec, 2025721 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/895 29/32 Anderson-PT-11-LTLFireability-10 1946530 m, 127953 m/sec, 3000331 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for Anderson-PT-11-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 Anderson-PT-11-LTLFireability-09
lola: time limit : 1186 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1186 11/32 Anderson-PT-11-LTLFireability-09 700053 m, 140010 m/sec, 1069781 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1186 21/32 Anderson-PT-11-LTLFireability-09 1368470 m, 133683 m/sec, 2093440 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1186 30/32 Anderson-PT-11-LTLFireability-09 2024061 m, 131118 m/sec, 3103744 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for Anderson-PT-11-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 Anderson-PT-11-LTLFireability-15
lola: time limit : 1770 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/1770 2/32 Anderson-PT-11-LTLFireability-15 134358 m, 26871 m/sec, 148420 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/1770 4/32 Anderson-PT-11-LTLFireability-15 268777 m, 26883 m/sec, 296617 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/1770 6/32 Anderson-PT-11-LTLFireability-15 401471 m, 26538 m/sec, 443007 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/1770 8/32 Anderson-PT-11-LTLFireability-15 534400 m, 26585 m/sec, 589827 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/1770 10/32 Anderson-PT-11-LTLFireability-15 667941 m, 26708 m/sec, 735963 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/1770 11/32 Anderson-PT-11-LTLFireability-15 798887 m, 26189 m/sec, 880466 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 35/1770 13/32 Anderson-PT-11-LTLFireability-15 928042 m, 25831 m/sec, 1024143 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 40/1770 15/32 Anderson-PT-11-LTLFireability-15 1059557 m, 26303 m/sec, 1169091 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 45/1770 17/32 Anderson-PT-11-LTLFireability-15 1190383 m, 26165 m/sec, 1313243 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 50/1770 19/32 Anderson-PT-11-LTLFireability-15 1322259 m, 26375 m/sec, 1458097 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 55/1770 20/32 Anderson-PT-11-LTLFireability-15 1453197 m, 26187 m/sec, 1602738 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 60/1770 22/32 Anderson-PT-11-LTLFireability-15 1584246 m, 26209 m/sec, 1747478 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 65/1770 24/32 Anderson-PT-11-LTLFireability-15 1716522 m, 26455 m/sec, 1892874 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 70/1770 26/32 Anderson-PT-11-LTLFireability-15 1847166 m, 26128 m/sec, 2037299 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 75/1770 27/32 Anderson-PT-11-LTLFireability-15 1977998 m, 26166 m/sec, 2181255 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 80/1770 29/32 Anderson-PT-11-LTLFireability-15 2109179 m, 26236 m/sec, 2326413 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 85/1770 31/32 Anderson-PT-11-LTLFireability-15 2239877 m, 26139 m/sec, 2470865 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for Anderson-PT-11-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 10 (type EXCL) for 9 Anderson-PT-11-LTLFireability-11
lola: time limit : 3450 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/3450 2/32 Anderson-PT-11-LTLFireability-11 126541 m, 25308 m/sec, 138258 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/3450 4/32 Anderson-PT-11-LTLFireability-11 250180 m, 24727 m/sec, 273099 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/3450 6/32 Anderson-PT-11-LTLFireability-11 373878 m, 24739 m/sec, 408647 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/3450 7/32 Anderson-PT-11-LTLFireability-11 499359 m, 25096 m/sec, 545760 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/3450 9/32 Anderson-PT-11-LTLFireability-11 625296 m, 25187 m/sec, 683402 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/3450 11/32 Anderson-PT-11-LTLFireability-11 749954 m, 24931 m/sec, 819645 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/3450 12/32 Anderson-PT-11-LTLFireability-11 877049 m, 25419 m/sec, 958882 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/3450 14/32 Anderson-PT-11-LTLFireability-11 1001422 m, 24874 m/sec, 1094721 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/3450 16/32 Anderson-PT-11-LTLFireability-11 1126041 m, 24923 m/sec, 1231025 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/3450 17/32 Anderson-PT-11-LTLFireability-11 1248515 m, 24494 m/sec, 1365258 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 55/3450 19/32 Anderson-PT-11-LTLFireability-11 1372345 m, 24766 m/sec, 1500852 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 60/3450 21/32 Anderson-PT-11-LTLFireability-11 1496018 m, 24734 m/sec, 1636472 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 65/3450 22/32 Anderson-PT-11-LTLFireability-11 1620337 m, 24863 m/sec, 1773061 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 70/3450 24/32 Anderson-PT-11-LTLFireability-11 1744881 m, 24908 m/sec, 1909656 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 75/3450 26/32 Anderson-PT-11-LTLFireability-11 1868861 m, 24796 m/sec, 2045532 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 80/3450 27/32 Anderson-PT-11-LTLFireability-11 1992680 m, 24763 m/sec, 2181053 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 85/3450 29/32 Anderson-PT-11-LTLFireability-11 2116857 m, 24835 m/sec, 2317299 t fired, .

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 90/3450 31/32 Anderson-PT-11-LTLFireability-11 2241734 m, 24975 m/sec, 2454526 t fired, .

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 95/3450 32/32 Anderson-PT-11-LTLFireability-11 2365316 m, 24716 m/sec, 2589942 t fired, .

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for Anderson-PT-11-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-11-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
Anderson-PT-11-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-11-LTLFireability-03: LTL unknown AGGR
Anderson-PT-11-LTLFireability-09: LTL unknown AGGR
Anderson-PT-11-LTLFireability-10: LTL unknown AGGR
Anderson-PT-11-LTLFireability-11: LTL unknown AGGR
Anderson-PT-11-LTLFireability-15: LTL unknown AGGR


Time elapsed: 250 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r519-tall-167987244700060"
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 ;