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-167987244700044.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-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 927K 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-09-LTLFireability-00
FORMULA_NAME Anderson-PT-09-LTLFireability-01
FORMULA_NAME Anderson-PT-09-LTLFireability-02
FORMULA_NAME Anderson-PT-09-LTLFireability-03
FORMULA_NAME Anderson-PT-09-LTLFireability-04
FORMULA_NAME Anderson-PT-09-LTLFireability-05
FORMULA_NAME Anderson-PT-09-LTLFireability-06
FORMULA_NAME Anderson-PT-09-LTLFireability-07
FORMULA_NAME Anderson-PT-09-LTLFireability-08
FORMULA_NAME Anderson-PT-09-LTLFireability-09
FORMULA_NAME Anderson-PT-09-LTLFireability-10
FORMULA_NAME Anderson-PT-09-LTLFireability-11
FORMULA_NAME Anderson-PT-09-LTLFireability-12
FORMULA_NAME Anderson-PT-09-LTLFireability-13
FORMULA_NAME Anderson-PT-09-LTLFireability-14
FORMULA_NAME Anderson-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680830819867

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-09
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 01:27:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 01:27:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:27:01] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-04-07 01:27:01] [INFO ] Transformed 505 places.
[2023-04-07 01:27:01] [INFO ] Transformed 1845 transitions.
[2023-04-07 01:27:01] [INFO ] Found NUPN structural information;
[2023-04-07 01:27:01] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 384 transition count 908
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 384 transition count 908
Applied a total of 242 rules in 79 ms. Remains 384 /505 variables (removed 121) and now considering 908/1845 (removed 937) transitions.
// Phase 1: matrix 908 rows 384 cols
[2023-04-07 01:27:01] [INFO ] Computed 21 invariants in 39 ms
[2023-04-07 01:27:02] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-04-07 01:27:02] [INFO ] Invariant cache hit.
[2023-04-07 01:27:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:03] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2023-04-07 01:27:03] [INFO ] Invariant cache hit.
[2023-04-07 01:27:04] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/505 places, 908/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2461 ms. Remains : 384/505 places, 908/1845 transitions.
Support contains 47 out of 384 places after structural reductions.
[2023-04-07 01:27:04] [INFO ] Flatten gal took : 91 ms
[2023-04-07 01:27:04] [INFO ] Flatten gal took : 60 ms
[2023-04-07 01:27:04] [INFO ] Input system was already deterministic with 908 transitions.
Support contains 46 out of 384 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 35) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 25) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) 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 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :1
Incomplete Best-First random walk after 1001 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 7 ms. (steps per millisecond=143 ) 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 1000 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 7 ms. (steps per millisecond=143 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-04-07 01:27:05] [INFO ] Invariant cache hit.
[2023-04-07 01:27:05] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:05] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 15 ms returned sat
[2023-04-07 01:27:06] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-04-07 01:27:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-04-07 01:27:06] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 13 ms returned sat
[2023-04-07 01:27:09] [INFO ] After 3083ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-04-07 01:27:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:11] [INFO ] After 1690ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :2 sat :16
[2023-04-07 01:27:12] [INFO ] After 3275ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 1205 ms.
[2023-04-07 01:27:14] [INFO ] After 7880ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 26 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 384 transition count 837
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 313 transition count 837
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 303 transition count 683
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 303 transition count 683
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 164 place count 302 transition count 682
Applied a total of 164 rules in 71 ms. Remains 302 /384 variables (removed 82) and now considering 682/908 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 302/384 places, 682/908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 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 1000 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 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) 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 15) 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 15) 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 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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 682 rows 302 cols
[2023-04-07 01:27:14] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 01:27:14] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:14] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-07 01:27:15] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 01:27:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-07 01:27:15] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 01:27:17] [INFO ] After 1419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 01:27:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:17] [INFO ] After 812ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 01:27:18] [INFO ] After 1875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 799 ms.
[2023-04-07 01:27:19] [INFO ] After 4315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 32 ms.
Support contains 22 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 682/682 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 301 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 301 transition count 665
Applied a total of 2 rules in 33 ms. Remains 301 /302 variables (removed 1) and now considering 665/682 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 301/302 places, 665/682 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 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 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 665 rows 301 cols
[2023-04-07 01:27:21] [INFO ] Computed 21 invariants in 18 ms
[2023-04-07 01:27:21] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:21] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-07 01:27:21] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-07 01:27:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:21] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 17 ms returned sat
[2023-04-07 01:27:22] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-04-07 01:27:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:23] [INFO ] After 773ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-04-07 01:27:24] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 2 ms to minimize.
[2023-04-07 01:27:24] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 1 ms to minimize.
[2023-04-07 01:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2023-04-07 01:27:24] [INFO ] After 1952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 676 ms.
[2023-04-07 01:27:25] [INFO ] After 3747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 51 ms.
Support contains 19 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 665/665 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 299 transition count 631
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 299 transition count 631
Applied a total of 4 rules in 22 ms. Remains 299 /301 variables (removed 2) and now considering 631/665 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 299/301 places, 631/665 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) 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 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 268429 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 268429 steps, saw 178522 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :3
Running SMT prover for 7 properties.
// Phase 1: matrix 631 rows 299 cols
[2023-04-07 01:27:29] [INFO ] Computed 21 invariants in 23 ms
[2023-04-07 01:27:29] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-04-07 01:27:29] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 26 ms returned sat
[2023-04-07 01:27:29] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 01:27:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:29] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 27 ms returned sat
[2023-04-07 01:27:30] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 01:27:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:30] [INFO ] After 397ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 01:27:31] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-04-07 01:27:31] [INFO ] After 1839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 17 ms.
Support contains 15 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 631/631 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 298 transition count 614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 614
Applied a total of 2 rules in 25 ms. Remains 298 /299 variables (removed 1) and now considering 614/631 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 298/299 places, 614/631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 614 rows 298 cols
[2023-04-07 01:27:32] [INFO ] Computed 21 invariants in 15 ms
[2023-04-07 01:27:32] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:32] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 01:27:32] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 01:27:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:32] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 01:27:33] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 01:27:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:33] [INFO ] After 236ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 01:27:33] [INFO ] After 557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-04-07 01:27:33] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 15 ms.
Support contains 12 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 614/614 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 296 transition count 580
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 296 transition count 580
Applied a total of 4 rules in 19 ms. Remains 296 /298 variables (removed 2) and now considering 580/614 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 296/298 places, 580/614 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 338986 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{0=1, 3=1}
Probabilistic random walk after 338986 steps, saw 238046 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 580 rows 296 cols
[2023-04-07 01:27:37] [INFO ] Computed 21 invariants in 11 ms
[2023-04-07 01:27:37] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:27:37] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-07 01:27:37] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 01:27:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 01:27:37] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 01:27:38] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 01:27:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:38] [INFO ] After 126ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 01:27:38] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-04-07 01:27:38] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 580/580 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 293 transition count 529
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 293 transition count 529
Applied a total of 6 rules in 16 ms. Remains 293 /296 variables (removed 3) and now considering 529/580 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 293/296 places, 529/580 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 529 rows 293 cols
[2023-04-07 01:27:38] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 01:27:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:27:38] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 01:27:38] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 01:27:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:27:39] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 01:27:39] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 01:27:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:39] [INFO ] After 89ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 01:27:39] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-04-07 01:27:39] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 529/529 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 292 transition count 512
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 292 transition count 512
Applied a total of 2 rules in 17 ms. Remains 292 /293 variables (removed 1) and now considering 512/529 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 292/293 places, 512/529 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 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 906686 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{1=1}
Probabilistic random walk after 906686 steps, saw 636889 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 292 cols
[2023-04-07 01:27:42] [INFO ] Computed 21 invariants in 7 ms
[2023-04-07 01:27:42] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 01:27:42] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:27:42] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:27:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 01:27:42] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 01:27:43] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:43] [INFO ] After 77ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:43] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-07 01:27:43] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 512/512 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 495
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 495
Applied a total of 2 rules in 33 ms. Remains 291 /292 variables (removed 1) and now considering 495/512 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 291/292 places, 495/512 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 1239465 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :{}
Probabilistic random walk after 1239465 steps, saw 859985 distinct states, run finished after 3003 ms. (steps per millisecond=412 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 495 rows 291 cols
[2023-04-07 01:27:46] [INFO ] Computed 21 invariants in 11 ms
[2023-04-07 01:27:46] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:46] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 01:27:46] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:27:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:27:46] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 17 ms returned sat
[2023-04-07 01:27:46] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:47] [INFO ] After 70ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:47] [INFO ] After 114ms 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 01:27:47] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 13 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 291/291 places, 495/495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 8 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2023-04-07 01:27:47] [INFO ] Invariant cache hit.
[2023-04-07 01:27:47] [INFO ] Implicit Places using invariants in 249 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 252 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/291 places, 495/495 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 290 transition count 415
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 210 transition count 415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 210 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 209 transition count 414
Applied a total of 162 rules in 14 ms. Remains 209 /290 variables (removed 81) and now considering 414/495 (removed 81) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 01:27:47] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 01:27:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-04-07 01:27:47] [INFO ] Invariant cache hit.
[2023-04-07 01:27:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:48] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/291 places, 414/495 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 923 ms. Remains : 209/291 places, 414/495 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
Interrupted probabilistic random walk after 1383520 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1383520 steps, saw 921942 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:27:51] [INFO ] Invariant cache hit.
[2023-04-07 01:27:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 01:27:51] [INFO ] [Real]Absence check using 10 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 01:27:51] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:27:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 01:27:51] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 01:27:51] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:51] [INFO ] After 51ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:51] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 01:27:51] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 12 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 209/209 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 01:27:51] [INFO ] Invariant cache hit.
[2023-04-07 01:27:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-04-07 01:27:51] [INFO ] Invariant cache hit.
[2023-04-07 01:27:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:52] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-04-07 01:27:52] [INFO ] Redundant transitions in 29 ms returned []
[2023-04-07 01:27:52] [INFO ] Invariant cache hit.
[2023-04-07 01:27:52] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 868 ms. Remains : 209/209 places, 414/414 transitions.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 209 transition count 333
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 128 transition count 333
Applied a total of 162 rules in 7 ms. Remains 128 /209 variables (removed 81) and now considering 333/414 (removed 81) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 333 rows 128 cols
[2023-04-07 01:27:52] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 01:27:52] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:27:52] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 01:27:52] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:27:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 01:27:52] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 01:27:52] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:27:52] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 01:27:52] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA Anderson-PT-09-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Anderson-PT-09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0) U (F((F(p3)&&p2))&&p1))))'
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 9 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 01:27:52] [INFO ] Computed 21 invariants in 10 ms
[2023-04-07 01:27:53] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-04-07 01:27:53] [INFO ] Invariant cache hit.
[2023-04-07 01:27:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:54] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2023-04-07 01:27:54] [INFO ] Invariant cache hit.
[2023-04-07 01:27:54] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/384 places, 583/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 363/384 places, 583/908 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 328 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s303 1)), p0:(AND (EQ s21 1) (EQ s37 1)), p2:(AND (EQ s10 1) (EQ s35 1)), p3:(AND (EQ s0 1) (EQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLFireability-00 finished in 2150 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' '!(F(G(!p0)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 166 place count 290 transition count 494
Iterating global reduction 0 with 22 rules applied. Total rules applied 188 place count 290 transition count 494
Applied a total of 188 rules in 32 ms. Remains 290 /384 variables (removed 94) and now considering 494/908 (removed 414) transitions.
// Phase 1: matrix 494 rows 290 cols
[2023-04-07 01:27:55] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 01:27:55] [INFO ] Implicit Places using invariants in 329 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 494/908 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 11 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 01:27:55] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 01:27:55] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-04-07 01:27:55] [INFO ] Invariant cache hit.
[2023-04-07 01:27:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:56] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/384 places, 414/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 958 ms. Remains : 209/384 places, 414/908 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 242 ms.
Product exploration explored 100000 steps with 0 reset in 192 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 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 16360 steps, run visited all 1 properties in 50 ms. (steps per millisecond=327 )
Probabilistic random walk after 16360 steps, saw 12736 distinct states, run finished after 51 ms. (steps per millisecond=320 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 25 ms :[p0]
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 01:27:56] [INFO ] Invariant cache hit.
[2023-04-07 01:27:57] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-04-07 01:27:57] [INFO ] Invariant cache hit.
[2023-04-07 01:27:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:57] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-04-07 01:27:57] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 01:27:57] [INFO ] Invariant cache hit.
[2023-04-07 01:27:57] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 857 ms. Remains : 209/209 places, 414/414 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16360 steps, run visited all 1 properties in 37 ms. (steps per millisecond=442 )
Probabilistic random walk after 16360 steps, saw 12736 distinct states, run finished after 37 ms. (steps per millisecond=442 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 01:27:58] [INFO ] Invariant cache hit.
[2023-04-07 01:27:58] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-04-07 01:27:58] [INFO ] Invariant cache hit.
[2023-04-07 01:27:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:27:59] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-04-07 01:27:59] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 01:27:59] [INFO ] Invariant cache hit.
[2023-04-07 01:27:59] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 830 ms. Remains : 209/209 places, 414/414 transitions.
Treatment of property Anderson-PT-09-LTLFireability-02 finished in 4385 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(p0) U X(p1)))'
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 364 transition count 600
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 364 transition count 600
Applied a total of 40 rules in 8 ms. Remains 364 /384 variables (removed 20) and now considering 600/908 (removed 308) transitions.
// Phase 1: matrix 600 rows 364 cols
[2023-04-07 01:27:59] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 01:27:59] [INFO ] Implicit Places using invariants in 331 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 333 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/384 places, 600/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 363/384 places, 600/908 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NOT (AND (EQ s24 1) (EQ s29 1))) (AND (EQ s10 1) (EQ s31 1))), p1:(AND (EQ s16 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 169 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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 89 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 600 rows 363 cols
[2023-04-07 01:28:00] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 01:28:00] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:28:00] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 18 ms returned sat
[2023-04-07 01:28:00] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:28:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:28:00] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 15 ms returned sat
[2023-04-07 01:28:01] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:28:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:01] [INFO ] After 138ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:28:01] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 01:28:01] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 600/600 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 363 transition count 521
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 284 transition count 521
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 158 place count 284 transition count 449
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 302 place count 212 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 211 transition count 432
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 211 transition count 432
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 211 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 308 place count 209 transition count 430
Applied a total of 308 rules in 20 ms. Remains 209 /363 variables (removed 154) and now considering 430/600 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 209/363 places, 430/600 transitions.
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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 40429 steps, run visited all 1 properties in 89 ms. (steps per millisecond=454 )
Probabilistic random walk after 40429 steps, saw 29758 distinct states, run finished after 89 ms. (steps per millisecond=454 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-03 finished in 2250 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' '!(F((G(p0)||(p1&&(p2 U p0)&&F(p3)))))'
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 292 transition count 528
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 292 transition count 528
Applied a total of 184 rules in 25 ms. Remains 292 /384 variables (removed 92) and now considering 528/908 (removed 380) transitions.
// Phase 1: matrix 528 rows 292 cols
[2023-04-07 01:28:01] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 01:28:02] [INFO ] Implicit Places using invariants in 267 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/384 places, 528/908 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 291 transition count 450
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 213 transition count 450
Applied a total of 156 rules in 7 ms. Remains 213 /291 variables (removed 78) and now considering 450/528 (removed 78) transitions.
// Phase 1: matrix 450 rows 213 cols
[2023-04-07 01:28:02] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 01:28:02] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-04-07 01:28:02] [INFO ] Invariant cache hit.
[2023-04-07 01:28:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:02] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 213/384 places, 450/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 973 ms. Remains : 213/384 places, 450/908 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s22 0) (EQ s30 0) (AND (EQ s11 1) (EQ s30 1))), p0:(AND (EQ s21 1) (EQ s28 1)), p2:(AND (EQ s23 1) (EQ s38 1)), p3:(AND (EQ s22 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-04 finished in 1363 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' '!((F(!p0) U X(p1)))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 362 transition count 566
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 362 transition count 566
Applied a total of 44 rules in 13 ms. Remains 362 /384 variables (removed 22) and now considering 566/908 (removed 342) transitions.
// Phase 1: matrix 566 rows 362 cols
[2023-04-07 01:28:03] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 01:28:03] [INFO ] Implicit Places using invariants in 255 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/384 places, 566/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 361/384 places, 566/908 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s143 1)), p1:(AND (EQ s15 1) (EQ s31 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 171 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-05 finished in 607 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(p0)))'
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 567
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 567
Applied a total of 42 rules in 11 ms. Remains 363 /384 variables (removed 21) and now considering 567/908 (removed 341) transitions.
// Phase 1: matrix 567 rows 363 cols
[2023-04-07 01:28:03] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 01:28:03] [INFO ] Implicit Places using invariants in 246 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 567/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 362/384 places, 567/908 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s46 1) (EQ s22 0) (EQ s29 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 129806 steps, run visited all 1 properties in 340 ms. (steps per millisecond=381 )
Probabilistic random walk after 129806 steps, saw 94362 distinct states, run finished after 340 ms. (steps per millisecond=381 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 84 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-09-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-06 finished in 1197 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' '!(F(G((X((!p0&&X(!p0))) U (p1 U p2)))))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 13 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 01:28:04] [INFO ] Computed 21 invariants in 4 ms
[2023-04-07 01:28:05] [INFO ] Implicit Places using invariants in 258 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s21 1) (EQ s28 1)), p1:(OR (AND (EQ s21 1) (EQ s28 1)) (AND (EQ s14 1) (EQ s32 1))), p0:(AND (EQ s14 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22150 reset in 296 ms.
Product exploration explored 100000 steps with 22233 reset in 307 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 181 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 583 rows 362 cols
[2023-04-07 01:28:06] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 01:28:06] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:28:06] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 17 ms returned sat
[2023-04-07 01:28:07] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-04-07 01:28:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:28:07] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 01:28:07] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-04-07 01:28:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:07] [INFO ] After 256ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-04-07 01:28:07] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-04-07 01:28:07] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 583/583 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 362 transition count 504
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 283 transition count 504
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 158 place count 283 transition count 432
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 302 place count 211 transition count 432
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 304 place count 211 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 306 place count 209 transition count 430
Applied a total of 306 rules in 15 ms. Remains 209 /362 variables (removed 153) and now considering 430/583 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 209/362 places, 430/583 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Finished Best-First random walk after 1371 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=685 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p2), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 22 factoid took 756 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2))]
[2023-04-07 01:28:09] [INFO ] Invariant cache hit.
[2023-04-07 01:28:09] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p2), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 22 factoid took 764 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-07 finished in 5355 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' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 291 transition count 511
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 291 transition count 511
Applied a total of 186 rules in 25 ms. Remains 291 /384 variables (removed 93) and now considering 511/908 (removed 397) transitions.
// Phase 1: matrix 511 rows 291 cols
[2023-04-07 01:28:10] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 01:28:10] [INFO ] Implicit Places using invariants in 246 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/384 places, 511/908 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 6 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2023-04-07 01:28:10] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 01:28:10] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-04-07 01:28:10] [INFO ] Invariant cache hit.
[2023-04-07 01:28:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:11] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/384 places, 432/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 925 ms. Remains : 211/384 places, 432/908 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s21 1) (EQ s91 1))) (NOT (AND (EQ s20 1) (EQ s100 1)))), p2:(AND (EQ s20 1) (EQ s100 1)), p0:(OR (NEQ s10 1) (NEQ s31 1)), p1:(OR (N...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 144 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 p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 73 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Finished Best-First random walk after 2020 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=505 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 118 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 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 211 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 10 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-04-07 01:28:12] [INFO ] Invariant cache hit.
[2023-04-07 01:28:12] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-04-07 01:28:12] [INFO ] Invariant cache hit.
[2023-04-07 01:28:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:12] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-04-07 01:28:12] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 01:28:12] [INFO ] Invariant cache hit.
[2023-04-07 01:28:12] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 865 ms. Remains : 211/211 places, 432/432 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 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 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Finished Best-First random walk after 1445 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=481 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND 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 (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 107 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 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-04-07 01:28:13] [INFO ] Invariant cache hit.
[2023-04-07 01:28:13] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-04-07 01:28:13] [INFO ] Invariant cache hit.
[2023-04-07 01:28:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:14] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-04-07 01:28:14] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 01:28:14] [INFO ] Invariant cache hit.
[2023-04-07 01:28:14] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 866 ms. Remains : 211/211 places, 432/432 transitions.
Treatment of property Anderson-PT-09-LTLFireability-08 finished in 4494 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)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 167 place count 289 transition count 477
Iterating global reduction 0 with 23 rules applied. Total rules applied 190 place count 289 transition count 477
Applied a total of 190 rules in 14 ms. Remains 289 /384 variables (removed 95) and now considering 477/908 (removed 431) transitions.
// Phase 1: matrix 477 rows 289 cols
[2023-04-07 01:28:14] [INFO ] Computed 21 invariants in 4 ms
[2023-04-07 01:28:14] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-04-07 01:28:14] [INFO ] Invariant cache hit.
[2023-04-07 01:28:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:15] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2023-04-07 01:28:15] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 01:28:15] [INFO ] Invariant cache hit.
[2023-04-07 01:28:15] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 477/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1234 ms. Remains : 289/384 places, 477/908 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s270 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21 reset in 153 ms.
Product exploration explored 100000 steps with 24 reset in 179 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1043 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=173 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 71 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 6 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 01:28:16] [INFO ] Invariant cache hit.
[2023-04-07 01:28:16] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-04-07 01:28:16] [INFO ] Invariant cache hit.
[2023-04-07 01:28:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:17] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-04-07 01:28:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 01:28:17] [INFO ] Invariant cache hit.
[2023-04-07 01:28:17] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 289/289 places, 477/477 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 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 165 ms :[(NOT p0), (NOT p0)]
Finished random walk after 118 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 36 reset in 160 ms.
Product exploration explored 100000 steps with 26 reset in 166 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 5 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 01:28:18] [INFO ] Invariant cache hit.
[2023-04-07 01:28:19] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-04-07 01:28:19] [INFO ] Invariant cache hit.
[2023-04-07 01:28:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:19] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2023-04-07 01:28:19] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 01:28:19] [INFO ] Invariant cache hit.
[2023-04-07 01:28:20] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1228 ms. Remains : 289/289 places, 477/477 transitions.
Treatment of property Anderson-PT-09-LTLFireability-09 finished in 5338 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' '!((F(G(p0)) U p1))'
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 384 transition count 837
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 313 transition count 837
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 163 place count 292 transition count 496
Iterating global reduction 0 with 21 rules applied. Total rules applied 184 place count 292 transition count 496
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 186 place count 291 transition count 495
Applied a total of 186 rules in 28 ms. Remains 291 /384 variables (removed 93) and now considering 495/908 (removed 413) transitions.
// Phase 1: matrix 495 rows 291 cols
[2023-04-07 01:28:20] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 01:28:20] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-04-07 01:28:20] [INFO ] Invariant cache hit.
[2023-04-07 01:28:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:21] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-04-07 01:28:21] [INFO ] Redundant transitions in 11 ms returned []
[2023-04-07 01:28:21] [INFO ] Invariant cache hit.
[2023-04-07 01:28:21] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/384 places, 495/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1328 ms. Remains : 291/384 places, 495/908 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (AND (EQ s21 1) (EQ s35 1)) (AND (EQ s0 1) (EQ s286 1)))) (EQ s91 1)), p0:(AND (EQ s21 1) (EQ s35 1) (EQ s91 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 164 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-11 finished in 1573 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(F((p0||((p1 U p0) U !p1)))))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 12 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 01:28:21] [INFO ] Computed 21 invariants in 10 ms
[2023-04-07 01:28:21] [INFO ] Implicit Places using invariants in 267 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 270 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 290 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s29 1)), p1:(AND (EQ s24 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 355 ms.
Product exploration explored 100000 steps with 50000 reset in 373 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)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 1127 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(F(p0)))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 14 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 01:28:22] [INFO ] Computed 21 invariants in 4 ms
[2023-04-07 01:28:23] [INFO ] Implicit Places using invariants in 257 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s20 1) (NEQ s31 1) (AND (EQ s25 1) (EQ s34 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-14 finished in 1186 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)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 166 place count 290 transition count 494
Iterating global reduction 0 with 22 rules applied. Total rules applied 188 place count 290 transition count 494
Applied a total of 188 rules in 14 ms. Remains 290 /384 variables (removed 94) and now considering 494/908 (removed 414) transitions.
// Phase 1: matrix 494 rows 290 cols
[2023-04-07 01:28:23] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 01:28:24] [INFO ] Implicit Places using invariants in 260 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 494/908 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 13 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 01:28:24] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 01:28:24] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-04-07 01:28:24] [INFO ] Invariant cache hit.
[2023-04-07 01:28:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:28:24] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/384 places, 414/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 849 ms. Remains : 209/384 places, 414/908 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-15 finished in 1058 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' '!(F(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' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
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)))'
[2023-04-07 01:28:25] [INFO ] Flatten gal took : 45 ms
[2023-04-07 01:28:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 01:28:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 384 places, 908 transitions and 3484 arcs took 6 ms.
Total runtime 84096 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-09
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1680831146693

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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:535
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: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Anderson-PT-09-LTLFireability-02
lola: time limit : 900 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-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/900 3/32 Anderson-PT-09-LTLFireability-02 182522 m, 36504 m/sec, 199400 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/900 5/32 Anderson-PT-09-LTLFireability-02 365860 m, 36667 m/sec, 400673 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/900 7/32 Anderson-PT-09-LTLFireability-02 548339 m, 36495 m/sec, 601014 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/900 9/32 Anderson-PT-09-LTLFireability-02 729762 m, 36284 m/sec, 800693 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/900 11/32 Anderson-PT-09-LTLFireability-02 910665 m, 36180 m/sec, 1000037 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/900 13/32 Anderson-PT-09-LTLFireability-02 1090887 m, 36044 m/sec, 1198488 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/900 15/32 Anderson-PT-09-LTLFireability-02 1270688 m, 35960 m/sec, 1397036 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/900 17/32 Anderson-PT-09-LTLFireability-02 1450635 m, 35989 m/sec, 1595573 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/900 19/32 Anderson-PT-09-LTLFireability-02 1629786 m, 35830 m/sec, 1793910 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/900 21/32 Anderson-PT-09-LTLFireability-02 1808618 m, 35766 m/sec, 1991987 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/900 23/32 Anderson-PT-09-LTLFireability-02 1986559 m, 35588 m/sec, 2189503 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/900 25/32 Anderson-PT-09-LTLFireability-02 2164464 m, 35581 m/sec, 2387023 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/900 27/32 Anderson-PT-09-LTLFireability-02 2341918 m, 35490 m/sec, 2584332 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/900 29/32 Anderson-PT-09-LTLFireability-02 2518533 m, 35323 m/sec, 2781175 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/900 31/32 Anderson-PT-09-LTLFireability-02 2693411 m, 34975 m/sec, 2975845 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 10 Anderson-PT-09-LTLFireability-09
lola: time limit : 1173 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-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1173 3/32 Anderson-PT-09-LTLFireability-09 229413 m, 45882 m/sec, 283193 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1173 6/32 Anderson-PT-09-LTLFireability-09 456335 m, 45384 m/sec, 562206 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1173 8/32 Anderson-PT-09-LTLFireability-09 681410 m, 45015 m/sec, 841370 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/1173 11/32 Anderson-PT-09-LTLFireability-09 905386 m, 44795 m/sec, 1119542 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/1173 13/32 Anderson-PT-09-LTLFireability-09 1128580 m, 44638 m/sec, 1396320 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/1173 15/32 Anderson-PT-09-LTLFireability-09 1351017 m, 44487 m/sec, 1671355 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/1173 18/32 Anderson-PT-09-LTLFireability-09 1572957 m, 44388 m/sec, 1947620 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/1173 20/32 Anderson-PT-09-LTLFireability-09 1794734 m, 44355 m/sec, 2225388 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 45/1173 23/32 Anderson-PT-09-LTLFireability-09 2016503 m, 44353 m/sec, 2500332 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 50/1173 25/32 Anderson-PT-09-LTLFireability-09 2236974 m, 44094 m/sec, 2776900 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 55/1173 28/32 Anderson-PT-09-LTLFireability-09 2457686 m, 44142 m/sec, 3053265 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 60/1173 30/32 Anderson-PT-09-LTLFireability-09 2677926 m, 44048 m/sec, 3328411 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 65/1173 32/32 Anderson-PT-09-LTLFireability-09 2897384 m, 43891 m/sec, 3603618 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for Anderson-PT-09-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-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 2 0 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: 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: 3
lola: LAUNCH task # 6 (type EXCL) for 3 Anderson-PT-09-LTLFireability-08
lola: time limit : 1725 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-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 5/1725 2/32 Anderson-PT-09-LTLFireability-08 170742 m, 34148 m/sec, 184319 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 10/1725 4/32 Anderson-PT-09-LTLFireability-08 340437 m, 33939 m/sec, 368598 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 15/1725 6/32 Anderson-PT-09-LTLFireability-08 508932 m, 33699 m/sec, 552258 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 20/1725 8/32 Anderson-PT-09-LTLFireability-08 677657 m, 33745 m/sec, 736463 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 25/1725 10/32 Anderson-PT-09-LTLFireability-08 845074 m, 33483 m/sec, 920770 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 30/1725 12/32 Anderson-PT-09-LTLFireability-08 1011131 m, 33211 m/sec, 1104267 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 35/1725 13/32 Anderson-PT-09-LTLFireability-08 1178231 m, 33420 m/sec, 1289539 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 40/1725 15/32 Anderson-PT-09-LTLFireability-08 1346208 m, 33595 m/sec, 1475500 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 45/1725 17/32 Anderson-PT-09-LTLFireability-08 1512191 m, 33196 m/sec, 1661269 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 50/1725 19/32 Anderson-PT-09-LTLFireability-08 1678128 m, 33187 m/sec, 1846826 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 55/1725 21/32 Anderson-PT-09-LTLFireability-08 1842616 m, 32897 m/sec, 2032304 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 60/1725 22/32 Anderson-PT-09-LTLFireability-08 2007136 m, 32904 m/sec, 2218938 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 65/1725 24/32 Anderson-PT-09-LTLFireability-08 2170891 m, 32751 m/sec, 2404564 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 70/1725 26/32 Anderson-PT-09-LTLFireability-08 2334482 m, 32718 m/sec, 2590473 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 75/1725 27/32 Anderson-PT-09-LTLFireability-08 2498250 m, 32753 m/sec, 2776828 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 80/1725 29/32 Anderson-PT-09-LTLFireability-08 2661834 m, 32716 m/sec, 2963074 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 1 0 2 0 0 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 85/1725 31/32 Anderson-PT-09-LTLFireability-08 2826321 m, 32897 m/sec, 3150439 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLFireability-08: CONJ 0 1 0 0 2 0 1 0
Anderson-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 3 Anderson-PT-09-LTLFireability-08
lola: time limit : 3360 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for Anderson-PT-09-LTLFireability-08
lola: result : true
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLFireability-02: LTL unknown AGGR
Anderson-PT-09-LTLFireability-08: CONJ unknown CONJ
Anderson-PT-09-LTLFireability-09: LTL unknown AGGR


Time elapsed: 240 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-09"
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-09, 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-167987244700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 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 ;