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

About the Execution of LoLa+red for Echo-PT-d02r15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1630.067 788200.00 822452.00 2368.80 TTFT?FFTFF?F?FFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838852500067.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 Echo-PT-d02r15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852500067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 917K Mar 5 18:22 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 Echo-PT-d02r15-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678436253879

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 08:17:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 08:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:17:35] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-10 08:17:35] [INFO ] Transformed 2127 places.
[2023-03-10 08:17:35] [INFO ] Transformed 1674 transitions.
[2023-03-10 08:17:35] [INFO ] Found NUPN structural information;
[2023-03-10 08:17:35] [INFO ] Parsed PT model containing 2127 places and 1674 transitions and 9700 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Echo-PT-d02r15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2127/2127 places, 1674/1674 transitions.
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 1905 transition count 1674
Applied a total of 222 rules in 216 ms. Remains 1905 /2127 variables (removed 222) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1905 cols
[2023-03-10 08:17:37] [INFO ] Invariants computation overflowed in 980 ms
[2023-03-10 08:17:38] [INFO ] Implicit Places using invariants in 2299 ms returned []
// Phase 1: matrix 1674 rows 1905 cols
[2023-03-10 08:17:39] [INFO ] Invariants computation overflowed in 1003 ms
[2023-03-10 08:17:40] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned []
Implicit Place search using SMT with State Equation took 4960 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1905 cols
[2023-03-10 08:17:41] [INFO ] Invariants computation overflowed in 958 ms
[2023-03-10 08:17:42] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1905/2127 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6977 ms. Remains : 1905/2127 places, 1674/1674 transitions.
Support contains 23 out of 1905 places after structural reductions.
[2023-03-10 08:17:43] [INFO ] Flatten gal took : 197 ms
[2023-03-10 08:17:43] [INFO ] Flatten gal took : 124 ms
[2023-03-10 08:17:43] [INFO ] Input system was already deterministic with 1674 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1674 rows 1905 cols
[2023-03-10 08:17:44] [INFO ] Invariants computation overflowed in 1001 ms
[2023-03-10 08:17:45] [INFO ] After 745ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 08:17:45] [INFO ] After 865ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-10 08:17:45] [INFO ] After 1260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Graph (complete) has 5709 edges and 1905 vertex of which 1893 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.10 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1893 transition count 1669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 1892 transition count 1668
Applied a total of 6 rules in 184 ms. Remains 1892 /1905 variables (removed 13) and now considering 1668/1674 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 1892/1905 places, 1668/1674 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 460969 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 460969 steps, saw 96097 distinct states, run finished after 3002 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1892 cols
[2023-03-10 08:17:51] [INFO ] Computed 832 place invariants in 1833 ms
[2023-03-10 08:17:53] [INFO ] [Real]Absence check using 0 positive and 832 generalized place invariants in 1839 ms returned sat
[2023-03-10 08:17:53] [INFO ] After 2300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 08:17:56] [INFO ] [Nat]Absence check using 0 positive and 832 generalized place invariants in 2366 ms returned sat
[2023-03-10 08:17:57] [INFO ] After 1578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 08:17:58] [INFO ] After 1751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-10 08:17:58] [INFO ] After 4694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1892/1892 places, 1668/1668 transitions.
Applied a total of 0 rules in 74 ms. Remains 1892 /1892 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1892/1892 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1892/1892 places, 1668/1668 transitions.
Applied a total of 0 rules in 68 ms. Remains 1892 /1892 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2023-03-10 08:17:58] [INFO ] Invariant cache hit.
[2023-03-10 08:18:03] [INFO ] Implicit Places using invariants in 5061 ms returned [2, 55, 1837, 1890]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5067 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1888/1892 places, 1668/1668 transitions.
Applied a total of 0 rules in 62 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5199 ms. Remains : 1888/1892 places, 1668/1668 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 473865 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473865 steps, saw 98260 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-10 08:18:07] [INFO ] Invariants computation overflowed in 1012 ms
[2023-03-10 08:18:08] [INFO ] After 1022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 08:18:09] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 08:18:09] [INFO ] After 792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-10 08:18:09] [INFO ] After 1158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 1668/1668 transitions.
Applied a total of 0 rules in 60 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1888/1888 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 1668/1668 transitions.
Applied a total of 0 rules in 59 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-10 08:18:10] [INFO ] Invariants computation overflowed in 1010 ms
[2023-03-10 08:18:11] [INFO ] Implicit Places using invariants in 1983 ms returned []
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-10 08:18:12] [INFO ] Invariants computation overflowed in 1007 ms
[2023-03-10 08:18:14] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 4433 ms to find 0 implicit places.
[2023-03-10 08:18:14] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-10 08:18:15] [INFO ] Invariants computation overflowed in 1012 ms
[2023-03-10 08:18:16] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6380 ms. Remains : 1888/1888 places, 1668/1668 transitions.
Applied a total of 0 rules in 55 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-10 08:18:17] [INFO ] Invariants computation overflowed in 1001 ms
[2023-03-10 08:18:18] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 08:18:19] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 08:18:19] [INFO ] After 867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-10 08:18:19] [INFO ] After 1242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1905 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1905 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1903 transition count 1674
Applied a total of 2 rules in 121 ms. Remains 1903 /1905 variables (removed 2) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1903 cols
[2023-03-10 08:18:21] [INFO ] Computed 841 place invariants in 1791 ms
[2023-03-10 08:18:26] [INFO ] Implicit Places using invariants in 6370 ms returned []
[2023-03-10 08:18:26] [INFO ] Invariant cache hit.
[2023-03-10 08:18:30] [INFO ] Implicit Places using invariants and state equation in 4602 ms returned []
Implicit Place search using SMT with State Equation took 10976 ms to find 0 implicit places.
[2023-03-10 08:18:30] [INFO ] Invariant cache hit.
[2023-03-10 08:18:34] [INFO ] Dead Transitions using invariants and state equation in 3077 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1903/1905 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14176 ms. Remains : 1903/1905 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1 0) (EQ s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1038 ms.
Product exploration explored 100000 steps with 33333 reset in 983 ms.
Computed a total of 1903 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1903 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r15-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r15-LTLCardinality-03 finished in 17206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 3 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1903 transition count 1674
Applied a total of 2 rules in 43 ms. Remains 1903 /1905 variables (removed 2) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1903 cols
[2023-03-10 08:18:38] [INFO ] Computed 841 place invariants in 1249 ms
[2023-03-10 08:18:43] [INFO ] Implicit Places using invariants in 6615 ms returned []
[2023-03-10 08:18:43] [INFO ] Invariant cache hit.
[2023-03-10 08:18:48] [INFO ] Implicit Places using invariants and state equation in 5146 ms returned []
Implicit Place search using SMT with State Equation took 11764 ms to find 0 implicit places.
[2023-03-10 08:18:48] [INFO ] Invariant cache hit.
[2023-03-10 08:18:52] [INFO ] Dead Transitions using invariants and state equation in 3747 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1903/1905 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15556 ms. Remains : 1903/1905 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s797 0) (EQ s120 1)), p1:(EQ s831 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 316 reset in 1316 ms.
Product exploration explored 100000 steps with 306 reset in 1469 ms.
Computed a total of 1903 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1903 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 154 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2023-03-10 08:18:56] [INFO ] Invariant cache hit.
[2023-03-10 08:18:59] [INFO ] [Real]Absence check using 3 positive place invariants in 102 ms returned sat
[2023-03-10 08:19:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 08:19:11] [INFO ] [Real]Absence check using 3 positive and 838 generalized place invariants in 12447 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 1903 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 : 1903/1903 places, 1674/1674 transitions.
Graph (complete) has 5693 edges and 1903 vertex of which 1898 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 74 ms. Remains 1897 /1903 variables (removed 6) and now considering 1672/1674 (removed 2) transitions.
// Phase 1: matrix 1672 rows 1897 cols
[2023-03-10 08:19:13] [INFO ] Computed 837 place invariants in 1352 ms
[2023-03-10 08:19:19] [INFO ] Implicit Places using invariants in 7644 ms returned [2, 55, 1842, 1895]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 7653 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1893/1903 places, 1672/1674 transitions.
Applied a total of 0 rules in 68 ms. Remains 1893 /1893 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7795 ms. Remains : 1893/1903 places, 1672/1674 transitions.
Computed a total of 1893 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Finished random walk after 404 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
// Phase 1: matrix 1672 rows 1893 cols
[2023-03-10 08:19:22] [INFO ] Computed 833 place invariants in 1595 ms
[2023-03-10 08:19:24] [INFO ] [Real]Absence check using 4 positive place invariants in 35 ms returned sat
[2023-03-10 08:19:37] [INFO ] [Real]Absence check using 4 positive and 829 generalized place invariants in 12449 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Product exploration explored 100000 steps with 299 reset in 1297 ms.
Product exploration explored 100000 steps with 311 reset in 1497 ms.
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 1672/1672 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
[2023-03-10 08:19:40] [INFO ] Invariant cache hit.
[2023-03-10 08:19:45] [INFO ] Implicit Places using invariants in 5712 ms returned []
[2023-03-10 08:19:45] [INFO ] Invariant cache hit.
[2023-03-10 08:19:51] [INFO ] Implicit Places using invariants and state equation in 5925 ms returned []
Implicit Place search using SMT with State Equation took 11639 ms to find 0 implicit places.
[2023-03-10 08:19:51] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-10 08:19:51] [INFO ] Invariant cache hit.
[2023-03-10 08:19:56] [INFO ] Dead Transitions using invariants and state equation in 4413 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16157 ms. Remains : 1893/1893 places, 1672/1672 transitions.
Treatment of property Echo-PT-d02r15-LTLCardinality-04 finished in 79514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p1) U ((!p2&&X(p1))||X(G(p1))))&&p0))))'
Support contains 4 out of 1905 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1902 transition count 1674
Applied a total of 3 rules in 49 ms. Remains 1902 /1905 variables (removed 3) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1902 cols
[2023-03-10 08:19:58] [INFO ] Computed 840 place invariants in 1986 ms
[2023-03-10 08:19:59] [INFO ] Implicit Places using invariants in 3165 ms returned []
[2023-03-10 08:19:59] [INFO ] Invariant cache hit.
[2023-03-10 08:20:06] [INFO ] Implicit Places using invariants and state equation in 6366 ms returned []
Implicit Place search using SMT with State Equation took 9533 ms to find 0 implicit places.
[2023-03-10 08:20:06] [INFO ] Invariant cache hit.
[2023-03-10 08:20:10] [INFO ] Dead Transitions using invariants and state equation in 4640 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1902/1905 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14226 ms. Remains : 1902/1905 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s600 0) (EQ s100 1)), p1:(OR (EQ s1674 0) (EQ s505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLCardinality-06 finished in 14460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0) U p1))))'
Support contains 3 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1903 transition count 1674
Applied a total of 2 rules in 52 ms. Remains 1903 /1905 variables (removed 2) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1903 cols
[2023-03-10 08:20:12] [INFO ] Computed 841 place invariants in 1375 ms
[2023-03-10 08:20:18] [INFO ] Implicit Places using invariants in 7122 ms returned []
[2023-03-10 08:20:18] [INFO ] Invariant cache hit.
[2023-03-10 08:20:24] [INFO ] Implicit Places using invariants and state equation in 5876 ms returned []
Implicit Place search using SMT with State Equation took 13001 ms to find 0 implicit places.
[2023-03-10 08:20:24] [INFO ] Invariant cache hit.
[2023-03-10 08:20:28] [INFO ] Dead Transitions using invariants and state equation in 4323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1903/1905 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17382 ms. Remains : 1903/1905 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s960 1), p0:(OR (EQ s1397 0) (EQ s1420 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d02r15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLCardinality-09 finished in 17556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Graph (complete) has 5709 edges and 1905 vertex of which 1897 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 66 ms. Remains 1896 /1905 variables (removed 9) and now considering 1672/1674 (removed 2) transitions.
// Phase 1: matrix 1672 rows 1896 cols
[2023-03-10 08:20:30] [INFO ] Computed 836 place invariants in 1730 ms
[2023-03-10 08:20:35] [INFO ] Implicit Places using invariants in 6451 ms returned [2, 55, 1841, 1894]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 6453 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1905 places, 1672/1674 transitions.
Applied a total of 0 rules in 63 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6583 ms. Remains : 1892/1905 places, 1672/1674 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1864 0) (EQ s770 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 222 reset in 1191 ms.
Product exploration explored 100000 steps with 222 reset in 1318 ms.
Computed a total of 1892 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1892 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 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 32 ms :[(NOT p0)]
Finished random walk after 196 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=49 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 153 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 1892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1892/1892 places, 1672/1672 transitions.
Applied a total of 0 rules in 62 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
// Phase 1: matrix 1672 rows 1892 cols
[2023-03-10 08:20:40] [INFO ] Computed 832 place invariants in 1305 ms
[2023-03-10 08:20:45] [INFO ] Implicit Places using invariants in 6594 ms returned []
[2023-03-10 08:20:45] [INFO ] Invariant cache hit.
[2023-03-10 08:20:50] [INFO ] Implicit Places using invariants and state equation in 5471 ms returned []
Implicit Place search using SMT with State Equation took 12067 ms to find 0 implicit places.
[2023-03-10 08:20:50] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-10 08:20:50] [INFO ] Invariant cache hit.
[2023-03-10 08:21:51] [INFO ] Performed 1/1672 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 08:21:51] [INFO ] Dead Transitions using invariants and state equation in 60018 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72242 ms. Remains : 1892/1892 places, 1672/1672 transitions.
Computed a total of 1892 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1892 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 986 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=70 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 239 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 222 reset in 1168 ms.
Product exploration explored 100000 steps with 222 reset in 1318 ms.
Support contains 2 out of 1892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1892/1892 places, 1672/1672 transitions.
Applied a total of 0 rules in 56 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
[2023-03-10 08:21:54] [INFO ] Invariant cache hit.
[2023-03-10 08:21:55] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-10 08:21:55] [INFO ] Invariant cache hit.
[2023-03-10 08:22:01] [INFO ] Implicit Places using invariants and state equation in 5497 ms returned []
Implicit Place search using SMT with State Equation took 6724 ms to find 0 implicit places.
[2023-03-10 08:22:01] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-10 08:22:01] [INFO ] Invariant cache hit.
[2023-03-10 08:23:01] [INFO ] Performed 1/1672 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 08:23:01] [INFO ] Dead Transitions using invariants and state equation in 60025 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66856 ms. Remains : 1892/1892 places, 1672/1672 transitions.
Treatment of property Echo-PT-d02r15-LTLCardinality-10 finished in 153095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((F(p1)&&F(G(p2))))&&p0))))'
Support contains 4 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1902 transition count 1674
Applied a total of 3 rules in 52 ms. Remains 1902 /1905 variables (removed 3) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1902 cols
[2023-03-10 08:23:03] [INFO ] Computed 840 place invariants in 1962 ms
[2023-03-10 08:23:04] [INFO ] Implicit Places using invariants in 3197 ms returned []
[2023-03-10 08:23:04] [INFO ] Invariant cache hit.
[2023-03-10 08:23:11] [INFO ] Implicit Places using invariants and state equation in 6406 ms returned []
Implicit Place search using SMT with State Equation took 9609 ms to find 0 implicit places.
[2023-03-10 08:23:11] [INFO ] Invariant cache hit.
[2023-03-10 08:23:15] [INFO ] Dead Transitions using invariants and state equation in 4445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1902/1905 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14108 ms. Remains : 1902/1905 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s1827 0) (NEQ s639 1)), p1:(NEQ s488 1), p2:(EQ s407 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 450 steps with 0 reset in 10 ms.
FORMULA Echo-PT-d02r15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r15-LTLCardinality-11 finished in 14368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 3 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1902 transition count 1674
Applied a total of 3 rules in 52 ms. Remains 1902 /1905 variables (removed 3) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 08:23:16] [INFO ] Invariant cache hit.
[2023-03-10 08:23:22] [INFO ] Implicit Places using invariants in 6016 ms returned []
[2023-03-10 08:23:22] [INFO ] Invariant cache hit.
[2023-03-10 08:23:28] [INFO ] Implicit Places using invariants and state equation in 6309 ms returned []
Implicit Place search using SMT with State Equation took 12329 ms to find 0 implicit places.
[2023-03-10 08:23:28] [INFO ] Invariant cache hit.
[2023-03-10 08:23:33] [INFO ] Dead Transitions using invariants and state equation in 4619 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1902/1905 places, 1674/1674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17003 ms. Remains : 1902/1905 places, 1674/1674 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s207 0) (EQ s362 1)), p1:(NEQ s1249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 236 reset in 1257 ms.
Product exploration explored 100000 steps with 236 reset in 1363 ms.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 277 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 2003 steps, including 4 resets, run visited all 3 properties in 48 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 336 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 46 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-10 08:23:37] [INFO ] Invariant cache hit.
[2023-03-10 08:23:43] [INFO ] Implicit Places using invariants in 5914 ms returned []
[2023-03-10 08:23:43] [INFO ] Invariant cache hit.
[2023-03-10 08:23:49] [INFO ] Implicit Places using invariants and state equation in 6345 ms returned []
Implicit Place search using SMT with State Equation took 12261 ms to find 0 implicit places.
[2023-03-10 08:23:49] [INFO ] Invariant cache hit.
[2023-03-10 08:23:54] [INFO ] Dead Transitions using invariants and state equation in 4566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16876 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Computed a total of 1902 stabilizing places and 1674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1902 transition count 1674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 309 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 4677 steps, including 10 resets, run visited all 3 properties in 69 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 489 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 240 reset in 1214 ms.
Product exploration explored 100000 steps with 235 reset in 1360 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Graph (complete) has 5685 edges and 1902 vertex of which 1897 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 120 ms. Remains 1897 /1902 variables (removed 5) and now considering 1673/1674 (removed 1) transitions.
[2023-03-10 08:23:59] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1673 rows 1897 cols
[2023-03-10 08:24:00] [INFO ] Computed 836 place invariants in 1170 ms
[2023-03-10 08:24:04] [INFO ] Dead Transitions using invariants and state equation in 4778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1897/1902 places, 1673/1674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4946 ms. Remains : 1897/1902 places, 1673/1674 transitions.
Support contains 3 out of 1902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1902/1902 places, 1674/1674 transitions.
Applied a total of 0 rules in 45 ms. Remains 1902 /1902 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1902 cols
[2023-03-10 08:24:06] [INFO ] Computed 840 place invariants in 1983 ms
[2023-03-10 08:24:07] [INFO ] Implicit Places using invariants in 3180 ms returned []
[2023-03-10 08:24:07] [INFO ] Invariant cache hit.
[2023-03-10 08:24:13] [INFO ] Implicit Places using invariants and state equation in 6208 ms returned []
Implicit Place search using SMT with State Equation took 9391 ms to find 0 implicit places.
[2023-03-10 08:24:13] [INFO ] Invariant cache hit.
[2023-03-10 08:24:18] [INFO ] Dead Transitions using invariants and state equation in 4591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14029 ms. Remains : 1902/1902 places, 1674/1674 transitions.
Treatment of property Echo-PT-d02r15-LTLCardinality-12 finished in 62480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Found a Shortening insensitive property : Echo-PT-d02r15-LTLCardinality-04
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Graph (complete) has 5709 edges and 1905 vertex of which 1898 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 66 ms. Remains 1897 /1905 variables (removed 8) and now considering 1672/1674 (removed 2) transitions.
// Phase 1: matrix 1672 rows 1897 cols
[2023-03-10 08:24:20] [INFO ] Computed 837 place invariants in 1325 ms
[2023-03-10 08:24:26] [INFO ] Implicit Places using invariants in 7582 ms returned [2, 55, 1842, 1895]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 7586 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1893/1905 places, 1672/1674 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7712 ms. Remains : 1893/1905 places, 1672/1674 transitions.
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s790 0) (EQ s113 1)), p1:(EQ s824 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 309 reset in 1300 ms.
Product exploration explored 100000 steps with 303 reset in 1454 ms.
Computed a total of 1893 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Finished random walk after 317 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
// Phase 1: matrix 1672 rows 1893 cols
[2023-03-10 08:24:32] [INFO ] Computed 833 place invariants in 1566 ms
[2023-03-10 08:24:34] [INFO ] [Real]Absence check using 4 positive place invariants in 34 ms returned sat
[2023-03-10 08:24:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 08:24:47] [INFO ] [Real]Absence check using 4 positive and 829 generalized place invariants in 12411 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 1893 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 : 1893/1893 places, 1672/1672 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
[2023-03-10 08:24:47] [INFO ] Invariant cache hit.
[2023-03-10 08:24:52] [INFO ] Implicit Places using invariants in 5486 ms returned []
[2023-03-10 08:24:52] [INFO ] Invariant cache hit.
[2023-03-10 08:24:58] [INFO ] Implicit Places using invariants and state equation in 5943 ms returned []
Implicit Place search using SMT with State Equation took 11431 ms to find 0 implicit places.
[2023-03-10 08:24:58] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-10 08:24:58] [INFO ] Invariant cache hit.
[2023-03-10 08:25:03] [INFO ] Dead Transitions using invariants and state equation in 4416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15965 ms. Remains : 1893/1893 places, 1672/1672 transitions.
Computed a total of 1893 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 435 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=72 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2023-03-10 08:25:04] [INFO ] Invariant cache hit.
[2023-03-10 08:25:06] [INFO ] [Real]Absence check using 4 positive place invariants in 31 ms returned sat
[2023-03-10 08:25:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 08:25:19] [INFO ] [Real]Absence check using 4 positive and 829 generalized place invariants in 12459 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 319 reset in 1308 ms.
Product exploration explored 100000 steps with 299 reset in 1442 ms.
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 1672/1672 transitions.
Applied a total of 0 rules in 56 ms. Remains 1893 /1893 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
[2023-03-10 08:25:22] [INFO ] Invariant cache hit.
[2023-03-10 08:25:27] [INFO ] Implicit Places using invariants in 5634 ms returned []
[2023-03-10 08:25:27] [INFO ] Invariant cache hit.
[2023-03-10 08:25:33] [INFO ] Implicit Places using invariants and state equation in 6073 ms returned []
Implicit Place search using SMT with State Equation took 11714 ms to find 0 implicit places.
[2023-03-10 08:25:33] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-10 08:25:33] [INFO ] Invariant cache hit.
[2023-03-10 08:25:38] [INFO ] Dead Transitions using invariants and state equation in 4701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16514 ms. Remains : 1893/1893 places, 1672/1672 transitions.
Treatment of property Echo-PT-d02r15-LTLCardinality-04 finished in 80046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Found a Lengthening insensitive property : Echo-PT-d02r15-LTLCardinality-12
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 1905 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1905/1905 places, 1674/1674 transitions.
Graph (complete) has 5709 edges and 1905 vertex of which 1897 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 64 ms. Remains 1896 /1905 variables (removed 9) and now considering 1672/1674 (removed 2) transitions.
// Phase 1: matrix 1672 rows 1896 cols
[2023-03-10 08:25:40] [INFO ] Computed 836 place invariants in 1750 ms
[2023-03-10 08:25:41] [INFO ] Implicit Places using invariants in 2883 ms returned []
[2023-03-10 08:25:41] [INFO ] Invariant cache hit.
[2023-03-10 08:25:46] [INFO ] Implicit Places using invariants and state equation in 5054 ms returned [2, 55, 1841, 1894]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7941 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1892/1905 places, 1672/1674 transitions.
Applied a total of 0 rules in 56 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8063 ms. Remains : 1892/1905 places, 1672/1674 transitions.
Running random walk in product with property : Echo-PT-d02r15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s200 0) (EQ s355 1)), p1:(NEQ s1241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 242 reset in 1217 ms.
Product exploration explored 100000 steps with 241 reset in 1368 ms.
Computed a total of 1892 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1892 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 3322 steps, including 7 resets, run visited all 3 properties in 48 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 1892 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1892/1892 places, 1672/1672 transitions.
Applied a total of 0 rules in 50 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
// Phase 1: matrix 1672 rows 1892 cols
[2023-03-10 08:25:52] [INFO ] Computed 832 place invariants in 1306 ms
[2023-03-10 08:25:58] [INFO ] Implicit Places using invariants in 6620 ms returned []
[2023-03-10 08:25:58] [INFO ] Invariant cache hit.
[2023-03-10 08:26:03] [INFO ] Implicit Places using invariants and state equation in 5458 ms returned []
Implicit Place search using SMT with State Equation took 12082 ms to find 0 implicit places.
[2023-03-10 08:26:03] [INFO ] Invariant cache hit.
[2023-03-10 08:27:03] [INFO ] Performed 1/1672 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 08:27:03] [INFO ] Dead Transitions using invariants and state equation in 60017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72149 ms. Remains : 1892/1892 places, 1672/1672 transitions.
Computed a total of 1892 stabilizing places and 1672 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1892 transition count 1672
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 1162 steps, including 2 resets, run visited all 3 properties in 28 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 446 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 236 reset in 1208 ms.
Product exploration explored 100000 steps with 244 reset in 1376 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 1892 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1892/1892 places, 1672/1672 transitions.
Applied a total of 0 rules in 58 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
[2023-03-10 08:27:08] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-10 08:27:08] [INFO ] Invariant cache hit.
[2023-03-10 08:27:09] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 1892/1892 places, 1672/1672 transitions.
Support contains 3 out of 1892 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1892/1892 places, 1672/1672 transitions.
Applied a total of 0 rules in 42 ms. Remains 1892 /1892 variables (removed 0) and now considering 1672/1672 (removed 0) transitions.
[2023-03-10 08:27:09] [INFO ] Invariant cache hit.
[2023-03-10 08:27:10] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2023-03-10 08:27:10] [INFO ] Invariant cache hit.
[2023-03-10 08:27:13] [INFO ] Implicit Places using invariants and state equation in 3287 ms returned []
Implicit Place search using SMT with State Equation took 4426 ms to find 0 implicit places.
[2023-03-10 08:27:13] [INFO ] Invariant cache hit.
[2023-03-10 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5434 ms. Remains : 1892/1892 places, 1672/1672 transitions.
Treatment of property Echo-PT-d02r15-LTLCardinality-12 finished in 96382 ms.
[2023-03-10 08:27:15] [INFO ] Flatten gal took : 90 ms
[2023-03-10 08:27:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 08:27:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1905 places, 1674 transitions and 8875 arcs took 15 ms.
Total runtime 579854 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Echo-PT-d02r15
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678437042079

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 7 Echo-PT-d02r15-LTLCardinality-10
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 4/899 2/32 Echo-PT-d02r15-LTLCardinality-10 176818 m, 35363 m/sec, 630181 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 9/899 4/32 Echo-PT-d02r15-LTLCardinality-10 360852 m, 36806 m/sec, 1326586 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 14/899 5/32 Echo-PT-d02r15-LTLCardinality-10 540332 m, 35896 m/sec, 2011972 t fired, .

Time elapsed: 15 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 19/899 7/32 Echo-PT-d02r15-LTLCardinality-10 724248 m, 36783 m/sec, 2702256 t fired, .

Time elapsed: 20 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 24/899 8/32 Echo-PT-d02r15-LTLCardinality-10 896803 m, 34511 m/sec, 3398051 t fired, .

Time elapsed: 25 secs. Pages in use: 8
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 29/899 9/32 Echo-PT-d02r15-LTLCardinality-10 1066241 m, 33887 m/sec, 4088750 t fired, .

Time elapsed: 30 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 34/899 11/32 Echo-PT-d02r15-LTLCardinality-10 1234779 m, 33707 m/sec, 4776888 t fired, .

Time elapsed: 35 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 39/899 12/32 Echo-PT-d02r15-LTLCardinality-10 1415239 m, 36092 m/sec, 5474870 t fired, .

Time elapsed: 40 secs. Pages in use: 12
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 44/899 14/32 Echo-PT-d02r15-LTLCardinality-10 1590194 m, 34991 m/sec, 6179816 t fired, .

Time elapsed: 45 secs. Pages in use: 14
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 49/899 15/32 Echo-PT-d02r15-LTLCardinality-10 1760926 m, 34146 m/sec, 6876192 t fired, .

Time elapsed: 50 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 54/899 17/32 Echo-PT-d02r15-LTLCardinality-10 1936977 m, 35210 m/sec, 7575176 t fired, .

Time elapsed: 55 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 59/899 18/32 Echo-PT-d02r15-LTLCardinality-10 2113106 m, 35225 m/sec, 8274685 t fired, .

Time elapsed: 60 secs. Pages in use: 18
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 64/899 19/32 Echo-PT-d02r15-LTLCardinality-10 2283696 m, 34118 m/sec, 8962575 t fired, .

Time elapsed: 65 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 69/899 21/32 Echo-PT-d02r15-LTLCardinality-10 2450573 m, 33375 m/sec, 9644752 t fired, .

Time elapsed: 70 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 74/899 22/32 Echo-PT-d02r15-LTLCardinality-10 2624165 m, 34718 m/sec, 10332137 t fired, .

Time elapsed: 75 secs. Pages in use: 22
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 79/899 24/32 Echo-PT-d02r15-LTLCardinality-10 2795049 m, 34176 m/sec, 11020254 t fired, .

Time elapsed: 80 secs. Pages in use: 24
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 84/899 25/32 Echo-PT-d02r15-LTLCardinality-10 2966221 m, 34234 m/sec, 11704365 t fired, .

Time elapsed: 85 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 89/899 26/32 Echo-PT-d02r15-LTLCardinality-10 3137398 m, 34235 m/sec, 12381306 t fired, .

Time elapsed: 90 secs. Pages in use: 26
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 94/899 28/32 Echo-PT-d02r15-LTLCardinality-10 3309260 m, 34372 m/sec, 13073040 t fired, .

Time elapsed: 95 secs. Pages in use: 28
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 99/899 29/32 Echo-PT-d02r15-LTLCardinality-10 3478823 m, 33912 m/sec, 13765687 t fired, .

Time elapsed: 100 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 104/899 31/32 Echo-PT-d02r15-LTLCardinality-10 3648660 m, 33967 m/sec, 14448457 t fired, .

Time elapsed: 105 secs. Pages in use: 31
# 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 109/899 32/32 Echo-PT-d02r15-LTLCardinality-10 3820113 m, 34290 m/sec, 15143912 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 8 (type EXCL) for Echo-PT-d02r15-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 10 Echo-PT-d02r15-LTLCardinality-12
lola: time limit : 1161 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1161 6/32 Echo-PT-d02r15-LTLCardinality-12 241281 m, 48256 m/sec, 773355 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1161 11/32 Echo-PT-d02r15-LTLCardinality-12 474988 m, 46741 m/sec, 1551916 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 16/1161 16/32 Echo-PT-d02r15-LTLCardinality-12 702470 m, 45496 m/sec, 2335418 t fired, .

Time elapsed: 131 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 21/1161 20/32 Echo-PT-d02r15-LTLCardinality-12 923604 m, 44226 m/sec, 3125790 t fired, .

Time elapsed: 136 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 26/1161 25/32 Echo-PT-d02r15-LTLCardinality-12 1134012 m, 42081 m/sec, 3908559 t fired, .

Time elapsed: 141 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 31/1161 29/32 Echo-PT-d02r15-LTLCardinality-12 1326585 m, 38514 m/sec, 4696283 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for Echo-PT-d02r15-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 2 0 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 5 (type EXCL) for 0 Echo-PT-d02r15-LTLCardinality-04
lola: time limit : 1724 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1724 4/32 Echo-PT-d02r15-LTLCardinality-04 247484 m, 49496 m/sec, 794235 t fired, .

Time elapsed: 156 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1724 7/32 Echo-PT-d02r15-LTLCardinality-04 486738 m, 47850 m/sec, 1591594 t fired, .

Time elapsed: 161 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1724 11/32 Echo-PT-d02r15-LTLCardinality-04 717916 m, 46235 m/sec, 2392563 t fired, .

Time elapsed: 166 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1724 14/32 Echo-PT-d02r15-LTLCardinality-04 943370 m, 45090 m/sec, 3194891 t fired, .

Time elapsed: 171 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/1724 17/32 Echo-PT-d02r15-LTLCardinality-04 1156894 m, 42704 m/sec, 3994290 t fired, .

Time elapsed: 176 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/1724 19/32 Echo-PT-d02r15-LTLCardinality-04 1351794 m, 38980 m/sec, 4799944 t fired, .

Time elapsed: 181 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/1724 22/32 Echo-PT-d02r15-LTLCardinality-04 1561706 m, 41982 m/sec, 5602644 t fired, .

Time elapsed: 186 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/1724 25/32 Echo-PT-d02r15-LTLCardinality-04 1777494 m, 43157 m/sec, 6403088 t fired, .

Time elapsed: 191 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/1724 28/32 Echo-PT-d02r15-LTLCardinality-04 1996604 m, 43822 m/sec, 7190112 t fired, .

Time elapsed: 196 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
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/1724 31/32 Echo-PT-d02r15-LTLCardinality-04 2201172 m, 40913 m/sec, 7980120 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 5 (type EXCL) for Echo-PT-d02r15-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r15-LTLCardinality-04: CONJ 0 1 0 0 2 0 1 0
Echo-PT-d02r15-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 13 (type EXCL) for 0 Echo-PT-d02r15-LTLCardinality-04
lola: time limit : 3394 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for Echo-PT-d02r15-LTLCardinality-04
lola: result : false
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
Echo-PT-d02r15-LTLCardinality-04: CONJ unknown CONJ
Echo-PT-d02r15-LTLCardinality-10: LTL unknown AGGR
Echo-PT-d02r15-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 206 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="Echo-PT-d02r15"
export BK_EXAMINATION="LTLCardinality"
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 Echo-PT-d02r15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838852500067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;