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-167838853300580.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 FlexibleBarrier-PT-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853300580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 FlexibleBarrier-PT-20b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678490774959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 23:26:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 23:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:26:16] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-10 23:26:16] [INFO ] Transformed 5372 places.
[2023-03-10 23:26:16] [INFO ] Transformed 6193 transitions.
[2023-03-10 23:26:16] [INFO ] Found NUPN structural information;
[2023-03-10 23:26:16] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2261 places :
Symmetric choice reduction at 0 with 2261 rule applications. Total rules 2261 place count 3111 transition count 3932
Iterating global reduction 0 with 2261 rules applied. Total rules applied 4522 place count 3111 transition count 3932
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 5599 place count 2034 transition count 2855
Iterating global reduction 0 with 1077 rules applied. Total rules applied 6676 place count 2034 transition count 2855
Discarding 702 places :
Symmetric choice reduction at 0 with 702 rule applications. Total rules 7378 place count 1332 transition count 2153
Iterating global reduction 0 with 702 rules applied. Total rules applied 8080 place count 1332 transition count 2153
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 0 with 342 rules applied. Total rules applied 8422 place count 1332 transition count 1811
Applied a total of 8422 rules in 1134 ms. Remains 1332 /5372 variables (removed 4040) and now considering 1811/6193 (removed 4382) transitions.
// Phase 1: matrix 1811 rows 1332 cols
[2023-03-10 23:26:18] [INFO ] Computed 22 place invariants in 62 ms
[2023-03-10 23:26:19] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-10 23:26:19] [INFO ] Invariant cache hit.
[2023-03-10 23:26:20] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2023-03-10 23:26:20] [INFO ] Invariant cache hit.
[2023-03-10 23:26:21] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1332/5372 places, 1811/6193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3943 ms. Remains : 1332/5372 places, 1811/6193 transitions.
Support contains 47 out of 1332 places after structural reductions.
[2023-03-10 23:26:21] [INFO ] Flatten gal took : 124 ms
[2023-03-10 23:26:21] [INFO ] Flatten gal took : 74 ms
[2023-03-10 23:26:21] [INFO ] Input system was already deterministic with 1811 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 35) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-10 23:26:22] [INFO ] Invariant cache hit.
[2023-03-10 23:26:22] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-10 23:26:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2023-03-10 23:26:26] [INFO ] After 2160ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :26
[2023-03-10 23:26:29] [INFO ] Deduced a trap composed of 412 places in 321 ms of which 5 ms to minimize.
[2023-03-10 23:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-10 23:26:29] [INFO ] After 5156ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :26
Attempting to minimize the solution found.
Minimization took 1613 ms.
[2023-03-10 23:26:30] [INFO ] After 7983ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :26
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 19 properties in 216 ms.
Support contains 9 out of 1332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1237 edges and 1332 vertex of which 115 / 1332 are part of one of the 19 SCC in 8 ms
Free SCC test removed 96 places
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 1236 transition count 1596
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 1137 transition count 1596
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 199 place count 1137 transition count 1551
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 289 place count 1092 transition count 1551
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 341 place count 1040 transition count 1499
Iterating global reduction 2 with 52 rules applied. Total rules applied 393 place count 1040 transition count 1499
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 399 place count 1040 transition count 1493
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 409 place count 1030 transition count 1483
Iterating global reduction 3 with 10 rules applied. Total rules applied 419 place count 1030 transition count 1483
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 426 place count 1030 transition count 1476
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 4 with 254 rules applied. Total rules applied 680 place count 903 transition count 1349
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 719 place count 903 transition count 1310
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 740 place count 882 transition count 1289
Iterating global reduction 5 with 21 rules applied. Total rules applied 761 place count 882 transition count 1289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 762 place count 882 transition count 1288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 764 place count 881 transition count 1288
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 766 place count 881 transition count 1286
Free-agglomeration rule applied 745 times.
Iterating global reduction 6 with 745 rules applied. Total rules applied 1511 place count 881 transition count 541
Reduce places removed 745 places and 0 transitions.
Drop transitions removed 305 transitions
Reduce isomorphic transitions removed 305 transitions.
Iterating post reduction 6 with 1050 rules applied. Total rules applied 2561 place count 136 transition count 236
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 2580 place count 136 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2580 place count 136 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2582 place count 135 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2583 place count 134 transition count 215
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 133 vertex of which 38 / 133 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2585 place count 114 transition count 215
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 2623 place count 114 transition count 177
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 2623 place count 114 transition count 157
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 2663 place count 94 transition count 157
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2683 place count 94 transition count 137
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 2727 place count 72 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2728 place count 72 transition count 114
Free-agglomeration rule applied 19 times.
Iterating global reduction 11 with 19 rules applied. Total rules applied 2747 place count 72 transition count 95
Reduce places removed 34 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 11 with 67 rules applied. Total rules applied 2814 place count 38 transition count 62
Discarding 14 places :
Symmetric choice reduction at 12 with 14 rule applications. Total rules 2828 place count 24 transition count 48
Iterating global reduction 12 with 14 rules applied. Total rules applied 2842 place count 24 transition count 48
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 2856 place count 24 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2858 place count 24 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2859 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2860 place count 23 transition count 31
Applied a total of 2860 rules in 1033 ms. Remains 23 /1332 variables (removed 1309) and now considering 31/1811 (removed 1780) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1033 ms. Remains : 23/1332 places, 31/1811 transitions.
Finished random walk after 153 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=76 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Computed a total of 23 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 1311 transition count 1784
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 1299 transition count 1772
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 1299 transition count 1772
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 1299 transition count 1766
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 1293 transition count 1760
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 1293 transition count 1760
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 1293 transition count 1754
Applied a total of 96 rules in 172 ms. Remains 1293 /1332 variables (removed 39) and now considering 1754/1811 (removed 57) transitions.
// Phase 1: matrix 1754 rows 1293 cols
[2023-03-10 23:26:32] [INFO ] Computed 22 place invariants in 43 ms
[2023-03-10 23:26:33] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-10 23:26:33] [INFO ] Invariant cache hit.
[2023-03-10 23:26:34] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2023-03-10 23:26:34] [INFO ] Invariant cache hit.
[2023-03-10 23:26:34] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1293/1332 places, 1754/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2409 ms. Remains : 1293/1332 places, 1754/1811 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s378 1) (EQ s392 1) (EQ s1074 1)), p0:(EQ s1238 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 150 steps with 1 reset in 6 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-00 finished in 2704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 1299 transition count 1771
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 1299 transition count 1771
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 1299 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 1292 transition count 1759
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 1292 transition count 1759
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 1292 transition count 1753
Applied a total of 98 rules in 164 ms. Remains 1292 /1332 variables (removed 40) and now considering 1753/1811 (removed 58) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2023-03-10 23:26:35] [INFO ] Computed 22 place invariants in 42 ms
[2023-03-10 23:26:35] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-10 23:26:35] [INFO ] Invariant cache hit.
[2023-03-10 23:26:37] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2023-03-10 23:26:37] [INFO ] Invariant cache hit.
[2023-03-10 23:26:37] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1332 places, 1753/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2724 ms. Remains : 1292/1332 places, 1753/1811 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s222 1), p0:(EQ s461 1), p2:(EQ s222 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 733 reset in 407 ms.
Product exploration explored 100000 steps with 737 reset in 403 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 676 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-10 23:26:40] [INFO ] Invariant cache hit.
[2023-03-10 23:26:41] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-10 23:26:41] [INFO ] After 725ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4 real:5
[2023-03-10 23:26:42] [INFO ] After 1101ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :3 real:6
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-10 23:26:42] [INFO ] After 1780ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :3 real:6
[2023-03-10 23:26:42] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2023-03-10 23:26:43] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-10 23:26:44] [INFO ] After 1475ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-10 23:26:44] [INFO ] After 2278ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 3 different solutions.
Finished Parikh walk after 259 steps, including 1 resets, run visited all 8 properties in 8 ms. (steps per millisecond=32 )
Parikh walk visited 8 properties in 9 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 933 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 34 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2023-03-10 23:26:46] [INFO ] Invariant cache hit.
[2023-03-10 23:26:46] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-10 23:26:46] [INFO ] Invariant cache hit.
[2023-03-10 23:26:47] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2023-03-10 23:26:47] [INFO ] Invariant cache hit.
[2023-03-10 23:26:48] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2269 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 844 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 164949 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{2=1, 3=1, 6=1}
Probabilistic random walk after 164949 steps, saw 81500 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :3
Running SMT prover for 6 properties.
[2023-03-10 23:26:53] [INFO ] Invariant cache hit.
[2023-03-10 23:26:53] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-10 23:26:54] [INFO ] After 583ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:3
[2023-03-10 23:26:54] [INFO ] After 751ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-10 23:26:54] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:3
[2023-03-10 23:26:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2023-03-10 23:26:55] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-10 23:26:55] [INFO ] After 1084ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-10 23:26:55] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 204 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Parikh walk visited 5 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p2) (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND p2 p0)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0))), (F (NOT p2))]
Knowledge based reduction with 18 factoid took 1164 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 735 reset in 311 ms.
Product exploration explored 100000 steps with 735 reset in 321 ms.
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 41 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2023-03-10 23:26:58] [INFO ] Invariant cache hit.
[2023-03-10 23:26:59] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-10 23:26:59] [INFO ] Invariant cache hit.
[2023-03-10 23:27:00] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2023-03-10 23:27:00] [INFO ] Invariant cache hit.
[2023-03-10 23:27:01] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2517 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-01 finished in 26206 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)&&F(p1)))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1267 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1230 transition count 1605
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1127 transition count 1605
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 207 place count 1127 transition count 1559
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1023 transition count 1501
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1023 transition count 1501
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 422 place count 1023 transition count 1494
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 422 place count 1023 transition count 1493
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 1022 transition count 1493
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 434 place count 1012 transition count 1483
Iterating global reduction 3 with 10 rules applied. Total rules applied 444 place count 1012 transition count 1483
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 454 place count 1012 transition count 1473
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 696 place count 891 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 697 place count 890 transition count 1351
Iterating global reduction 4 with 1 rules applied. Total rules applied 698 place count 890 transition count 1351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 699 place count 890 transition count 1350
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 718 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 720 place count 888 transition count 1329
Applied a total of 720 rules in 618 ms. Remains 888 /1332 variables (removed 444) and now considering 1329/1811 (removed 482) transitions.
[2023-03-10 23:27:02] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2023-03-10 23:27:02] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-10 23:27:02] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-10 23:27:02] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-10 23:27:02] [INFO ] Invariant cache hit.
[2023-03-10 23:27:03] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
[2023-03-10 23:27:03] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-10 23:27:03] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-10 23:27:03] [INFO ] Invariant cache hit.
[2023-03-10 23:27:04] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1332 places, 1329/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2657 ms. Remains : 888/1332 places, 1329/1811 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s630 1), p0:(EQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-02 finished in 2791 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(p1)||p0)))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 1300 transition count 1772
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 1300 transition count 1772
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 1300 transition count 1767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1294 transition count 1761
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1294 transition count 1761
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 1294 transition count 1756
Applied a total of 93 rules in 155 ms. Remains 1294 /1332 variables (removed 38) and now considering 1756/1811 (removed 55) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2023-03-10 23:27:04] [INFO ] Computed 22 place invariants in 32 ms
[2023-03-10 23:27:04] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-10 23:27:04] [INFO ] Invariant cache hit.
[2023-03-10 23:27:05] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2023-03-10 23:27:05] [INFO ] Invariant cache hit.
[2023-03-10 23:27:06] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1332 places, 1756/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2718 ms. Remains : 1294/1332 places, 1756/1811 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1270 0), p0:(OR (EQ s835 0) (EQ s1270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 788 ms.
Product exploration explored 100000 steps with 50000 reset in 806 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-03 finished in 4600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F((p1||G(p2))))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 1300 transition count 1772
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 1300 transition count 1772
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 1300 transition count 1767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1294 transition count 1761
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1294 transition count 1761
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 1294 transition count 1756
Applied a total of 93 rules in 154 ms. Remains 1294 /1332 variables (removed 38) and now considering 1756/1811 (removed 55) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2023-03-10 23:27:09] [INFO ] Computed 22 place invariants in 32 ms
[2023-03-10 23:27:09] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-10 23:27:09] [INFO ] Invariant cache hit.
[2023-03-10 23:27:10] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2023-03-10 23:27:10] [INFO ] Invariant cache hit.
[2023-03-10 23:27:11] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1332 places, 1756/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2499 ms. Remains : 1294/1332 places, 1756/1811 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s745 0), p0:(EQ s837 0), p2:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 827 ms.
Product exploration explored 100000 steps with 50000 reset in 784 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/1294 stabilizing places and 22/1756 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-04 finished in 4488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1265 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 3 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1230 transition count 1605
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1127 transition count 1605
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 207 place count 1127 transition count 1559
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1023 transition count 1501
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1023 transition count 1501
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 421 place count 1023 transition count 1495
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 421 place count 1023 transition count 1494
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 423 place count 1022 transition count 1494
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 434 place count 1011 transition count 1483
Iterating global reduction 3 with 11 rules applied. Total rules applied 445 place count 1011 transition count 1483
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 456 place count 1011 transition count 1472
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 698 place count 890 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 699 place count 889 transition count 1350
Iterating global reduction 4 with 1 rules applied. Total rules applied 700 place count 889 transition count 1350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 701 place count 889 transition count 1349
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 721 place count 889 transition count 1329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 723 place count 887 transition count 1327
Applied a total of 723 rules in 416 ms. Remains 887 /1332 variables (removed 445) and now considering 1327/1811 (removed 484) transitions.
[2023-03-10 23:27:13] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2023-03-10 23:27:13] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-10 23:27:14] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-10 23:27:14] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:27:14] [INFO ] Invariant cache hit.
[2023-03-10 23:27:15] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2023-03-10 23:27:15] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 23:27:15] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:27:15] [INFO ] Invariant cache hit.
[2023-03-10 23:27:15] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 887/1332 places, 1327/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2357 ms. Remains : 887/1332 places, 1327/1811 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s21 1), p1:(OR (NEQ s89 1) (NEQ s287 1) (NEQ s587 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2859 steps with 108 reset in 53 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-05 finished in 2537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (X((p1 U p2))||G(p0))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 1298 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 1298 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 1298 transition count 1764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 1292 transition count 1758
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 1292 transition count 1758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 1292 transition count 1753
Applied a total of 98 rules in 150 ms. Remains 1292 /1332 variables (removed 40) and now considering 1753/1811 (removed 58) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2023-03-10 23:27:16] [INFO ] Computed 22 place invariants in 37 ms
[2023-03-10 23:27:16] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-10 23:27:16] [INFO ] Invariant cache hit.
[2023-03-10 23:27:17] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2023-03-10 23:27:17] [INFO ] Invariant cache hit.
[2023-03-10 23:27:18] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1332 places, 1753/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2329 ms. Remains : 1292/1332 places, 1753/1811 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s423 1), p1:(EQ s195 1), p0:(EQ s294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-06 finished in 2571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(p1) U (p2&&X(p1))))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 1300 transition count 1772
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 1300 transition count 1772
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 1300 transition count 1766
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 1295 transition count 1761
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 1295 transition count 1761
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 1295 transition count 1757
Applied a total of 91 rules in 154 ms. Remains 1295 /1332 variables (removed 37) and now considering 1757/1811 (removed 54) transitions.
// Phase 1: matrix 1757 rows 1295 cols
[2023-03-10 23:27:18] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-10 23:27:19] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-10 23:27:19] [INFO ] Invariant cache hit.
[2023-03-10 23:27:20] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-10 23:27:20] [INFO ] Invariant cache hit.
[2023-03-10 23:27:20] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1295/1332 places, 1757/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2437 ms. Remains : 1295/1332 places, 1757/1811 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s204 1) (EQ s658 0)), p2:(EQ s787 1), p1:(EQ s658 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-07 finished in 2749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 1310 transition count 1783
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 1297 transition count 1770
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 1297 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 1297 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 1290 transition count 1757
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 1290 transition count 1757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 1290 transition count 1751
Applied a total of 102 rules in 158 ms. Remains 1290 /1332 variables (removed 42) and now considering 1751/1811 (removed 60) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2023-03-10 23:27:21] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-10 23:27:21] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-10 23:27:21] [INFO ] Invariant cache hit.
[2023-03-10 23:27:22] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2023-03-10 23:27:22] [INFO ] Invariant cache hit.
[2023-03-10 23:27:23] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1332 places, 1751/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2303 ms. Remains : 1290/1332 places, 1751/1811 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s108 1) (EQ s206 1) (EQ s996 1)), p0:(OR (EQ s108 0) (EQ s206 0) (EQ s996 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-08 finished in 2465 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)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 1298 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 1298 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 1298 transition count 1764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 1292 transition count 1758
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 1292 transition count 1758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 1292 transition count 1753
Applied a total of 98 rules in 149 ms. Remains 1292 /1332 variables (removed 40) and now considering 1753/1811 (removed 58) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2023-03-10 23:27:23] [INFO ] Computed 22 place invariants in 35 ms
[2023-03-10 23:27:24] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-10 23:27:24] [INFO ] Invariant cache hit.
[2023-03-10 23:27:25] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2023-03-10 23:27:25] [INFO ] Invariant cache hit.
[2023-03-10 23:27:26] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1332 places, 1753/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2474 ms. Remains : 1292/1332 places, 1753/1811 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s655 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-09 finished in 2599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((p1&&X(X(p2))))))&&p0)))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 1298 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 1298 transition count 1770
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 1298 transition count 1765
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 1291 transition count 1758
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 1291 transition count 1758
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 1291 transition count 1752
Applied a total of 100 rules in 148 ms. Remains 1291 /1332 variables (removed 41) and now considering 1752/1811 (removed 59) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2023-03-10 23:27:26] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-10 23:27:26] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-10 23:27:26] [INFO ] Invariant cache hit.
[2023-03-10 23:27:28] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
[2023-03-10 23:27:28] [INFO ] Invariant cache hit.
[2023-03-10 23:27:28] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1291/1332 places, 1752/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2432 ms. Remains : 1291/1332 places, 1752/1811 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 5}]], initial=3, aps=[p0:(AND (EQ s249 1) (EQ s873 1)), p1:(EQ s151 1), p2:(EQ s873 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-10 finished in 2716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1267 edges and 1332 vertex of which 115 / 1332 are part of one of the 19 SCC in 1 ms
Free SCC test removed 96 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1235 transition count 1609
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1131 transition count 1609
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 209 place count 1131 transition count 1562
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 303 place count 1084 transition count 1562
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 361 place count 1026 transition count 1504
Iterating global reduction 2 with 58 rules applied. Total rules applied 419 place count 1026 transition count 1504
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 426 place count 1026 transition count 1497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 426 place count 1026 transition count 1496
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 1025 transition count 1496
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 439 place count 1014 transition count 1485
Iterating global reduction 3 with 11 rules applied. Total rules applied 450 place count 1014 transition count 1485
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 461 place count 1014 transition count 1474
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 709 place count 890 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 710 place count 889 transition count 1349
Iterating global reduction 4 with 1 rules applied. Total rules applied 711 place count 889 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 712 place count 889 transition count 1348
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 714 place count 888 transition count 1348
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 735 place count 888 transition count 1327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 737 place count 886 transition count 1325
Applied a total of 737 rules in 419 ms. Remains 886 /1332 variables (removed 446) and now considering 1325/1811 (removed 486) transitions.
[2023-03-10 23:27:29] [INFO ] Flow matrix only has 1287 transitions (discarded 38 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2023-03-10 23:27:29] [INFO ] Computed 22 place invariants in 40 ms
[2023-03-10 23:27:29] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-10 23:27:29] [INFO ] Flow matrix only has 1287 transitions (discarded 38 similar events)
[2023-03-10 23:27:29] [INFO ] Invariant cache hit.
[2023-03-10 23:27:30] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2023-03-10 23:27:30] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-10 23:27:30] [INFO ] Flow matrix only has 1287 transitions (discarded 38 similar events)
[2023-03-10 23:27:30] [INFO ] Invariant cache hit.
[2023-03-10 23:27:31] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1332 places, 1325/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2398 ms. Remains : 886/1332 places, 1325/1811 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s261 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-11 finished in 2476 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(p0)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1309 transition count 1788
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1309 transition count 1788
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 1309 transition count 1781
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 1296 transition count 1768
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 1296 transition count 1768
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 85 place count 1296 transition count 1762
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 1289 transition count 1755
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 1289 transition count 1755
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 1289 transition count 1749
Applied a total of 105 rules in 151 ms. Remains 1289 /1332 variables (removed 43) and now considering 1749/1811 (removed 62) transitions.
// Phase 1: matrix 1749 rows 1289 cols
[2023-03-10 23:27:31] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-10 23:27:32] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-10 23:27:32] [INFO ] Invariant cache hit.
[2023-03-10 23:27:33] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2023-03-10 23:27:33] [INFO ] Invariant cache hit.
[2023-03-10 23:27:33] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1289/1332 places, 1749/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2558 ms. Remains : 1289/1332 places, 1749/1811 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s556 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-12 finished in 2683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&F(G(!p1)))))))'
Support contains 5 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 1310 transition count 1783
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 1297 transition count 1770
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 1297 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 1297 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 1290 transition count 1757
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 1290 transition count 1757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 1290 transition count 1751
Applied a total of 102 rules in 156 ms. Remains 1290 /1332 variables (removed 42) and now considering 1751/1811 (removed 60) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2023-03-10 23:27:34] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-10 23:27:34] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-10 23:27:34] [INFO ] Invariant cache hit.
[2023-03-10 23:27:36] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-10 23:27:36] [INFO ] Invariant cache hit.
[2023-03-10 23:27:36] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1332 places, 1751/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2603 ms. Remains : 1290/1332 places, 1751/1811 transitions.
Stuttering acceptance computed with spot in 246 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s783 1) (EQ s851 1) (EQ s1263 1)), p1:(AND (EQ s466 1) (EQ s1284 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 734 reset in 284 ms.
Product exploration explored 100000 steps with 734 reset in 276 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-10 23:27:37] [INFO ] Invariant cache hit.
[2023-03-10 23:27:38] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-10 23:27:38] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p0)))
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-13 finished in 4114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 1297 transition count 1769
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 1297 transition count 1769
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 1297 transition count 1763
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 1290 transition count 1756
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 1290 transition count 1756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 1290 transition count 1750
Applied a total of 103 rules in 158 ms. Remains 1290 /1332 variables (removed 42) and now considering 1750/1811 (removed 61) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2023-03-10 23:27:38] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-10 23:27:38] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-10 23:27:38] [INFO ] Invariant cache hit.
[2023-03-10 23:27:40] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1624 ms to find 0 implicit places.
[2023-03-10 23:27:40] [INFO ] Invariant cache hit.
[2023-03-10 23:27:40] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1332 places, 1750/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2402 ms. Remains : 1290/1332 places, 1750/1811 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s723 0), p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 738 reset in 258 ms.
Product exploration explored 100000 steps with 733 reset in 291 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 321856 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321856 steps, saw 120809 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 23:27:44] [INFO ] Invariant cache hit.
[2023-03-10 23:27:44] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 23:27:45] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-10 23:27:45] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 23:27:45] [INFO ] Deduced a trap composed of 163 places in 92 ms of which 1 ms to minimize.
[2023-03-10 23:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-10 23:27:45] [INFO ] After 847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-10 23:27:46] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 3 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1189 transition count 1530
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 1091 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1090 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 199 place count 1090 transition count 1488
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 281 place count 1049 transition count 1488
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 319 place count 1011 transition count 1450
Iterating global reduction 3 with 38 rules applied. Total rules applied 357 place count 1011 transition count 1450
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 888 transition count 1327
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 642 place count 888 transition count 1288
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 662 place count 868 transition count 1268
Iterating global reduction 4 with 20 rules applied. Total rules applied 682 place count 868 transition count 1268
Free-agglomeration rule applied 763 times.
Iterating global reduction 4 with 763 rules applied. Total rules applied 1445 place count 868 transition count 505
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 285 edges and 105 vertex of which 15 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1125 rules applied. Total rules applied 2570 place count 15 transition count 144
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2696 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2697 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 2700 place count 4 transition count 17
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2713 place count 4 transition count 4
Applied a total of 2713 rules in 244 ms. Remains 4 /1290 variables (removed 1286) and now considering 4/1750 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 4/1290 places, 4/1750 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 42 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
[2023-03-10 23:27:46] [INFO ] Invariant cache hit.
[2023-03-10 23:27:47] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-10 23:27:47] [INFO ] Invariant cache hit.
[2023-03-10 23:27:48] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2023-03-10 23:27:48] [INFO ] Invariant cache hit.
[2023-03-10 23:27:49] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2245 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 318518 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318518 steps, saw 119766 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 23:27:52] [INFO ] Invariant cache hit.
[2023-03-10 23:27:52] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 23:27:52] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-10 23:27:53] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 23:27:53] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 0 ms to minimize.
[2023-03-10 23:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-10 23:27:53] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-10 23:27:53] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1189 transition count 1530
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 1091 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1090 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 199 place count 1090 transition count 1488
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 281 place count 1049 transition count 1488
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 319 place count 1011 transition count 1450
Iterating global reduction 3 with 38 rules applied. Total rules applied 357 place count 1011 transition count 1450
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 888 transition count 1327
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 642 place count 888 transition count 1288
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 662 place count 868 transition count 1268
Iterating global reduction 4 with 20 rules applied. Total rules applied 682 place count 868 transition count 1268
Free-agglomeration rule applied 763 times.
Iterating global reduction 4 with 763 rules applied. Total rules applied 1445 place count 868 transition count 505
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 285 edges and 105 vertex of which 15 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1125 rules applied. Total rules applied 2570 place count 15 transition count 144
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2696 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2697 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 2700 place count 4 transition count 17
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2713 place count 4 transition count 4
Applied a total of 2713 rules in 214 ms. Remains 4 /1290 variables (removed 1286) and now considering 4/1750 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 4/1290 places, 4/1750 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 733 reset in 259 ms.
Product exploration explored 100000 steps with 733 reset in 285 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 1189 transition count 1648
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 58 Pre rules applied. Total rules applied 81 place count 1189 transition count 1648
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 139 place count 1189 transition count 1648
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 235 place count 1093 transition count 1552
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 331 place count 1093 transition count 1552
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 1 with 105 rules applied. Total rules applied 436 place count 1093 transition count 1591
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 480 place count 1049 transition count 1547
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 524 place count 1049 transition count 1547
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 544 place count 1049 transition count 1587
Deduced a syphon composed of 161 places in 1 ms
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 1 with 39 rules applied. Total rules applied 583 place count 1049 transition count 1548
Deduced a syphon composed of 161 places in 0 ms
Applied a total of 583 rules in 619 ms. Remains 1049 /1290 variables (removed 241) and now considering 1548/1750 (removed 202) transitions.
[2023-03-10 23:27:56] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-10 23:27:56] [INFO ] Flow matrix only has 1509 transitions (discarded 39 similar events)
// Phase 1: matrix 1509 rows 1049 cols
[2023-03-10 23:27:56] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-10 23:27:56] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1049/1290 places, 1548/1750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1229 ms. Remains : 1049/1290 places, 1548/1750 transitions.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 34 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2023-03-10 23:27:56] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-10 23:27:57] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-10 23:27:57] [INFO ] Invariant cache hit.
[2023-03-10 23:27:58] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
[2023-03-10 23:27:58] [INFO ] Invariant cache hit.
[2023-03-10 23:27:59] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2510 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 21090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1268 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 0 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1230 transition count 1606
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1128 transition count 1606
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 205 place count 1128 transition count 1559
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 358 place count 1022 transition count 1500
Iterating global reduction 2 with 59 rules applied. Total rules applied 417 place count 1022 transition count 1500
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 424 place count 1022 transition count 1493
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 435 place count 1011 transition count 1482
Iterating global reduction 3 with 11 rules applied. Total rules applied 446 place count 1011 transition count 1482
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 457 place count 1011 transition count 1471
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 701 place count 889 transition count 1349
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 702 place count 888 transition count 1348
Iterating global reduction 4 with 1 rules applied. Total rules applied 703 place count 888 transition count 1348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 704 place count 888 transition count 1347
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 724 place count 888 transition count 1327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 726 place count 886 transition count 1325
Applied a total of 726 rules in 400 ms. Remains 886 /1332 variables (removed 446) and now considering 1325/1811 (removed 486) transitions.
[2023-03-10 23:27:59] [INFO ] Flow matrix only has 1286 transitions (discarded 39 similar events)
// Phase 1: matrix 1286 rows 886 cols
[2023-03-10 23:27:59] [INFO ] Computed 22 place invariants in 32 ms
[2023-03-10 23:28:00] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-10 23:28:00] [INFO ] Flow matrix only has 1286 transitions (discarded 39 similar events)
[2023-03-10 23:28:00] [INFO ] Invariant cache hit.
[2023-03-10 23:28:01] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-10 23:28:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 23:28:01] [INFO ] Flow matrix only has 1286 transitions (discarded 39 similar events)
[2023-03-10 23:28:01] [INFO ] Invariant cache hit.
[2023-03-10 23:28:01] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1332 places, 1325/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2228 ms. Remains : 886/1332 places, 1325/1811 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s835 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-15 finished in 2271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)||X(X(p2))||G(X(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(X(G((X(p0)||F(p1))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-20b-LTLFireability-14
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1267 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 0 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1230 transition count 1606
Reduce places removed 102 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 1128 transition count 1605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 1127 transition count 1605
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 207 place count 1127 transition count 1559
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 358 place count 1022 transition count 1500
Iterating global reduction 3 with 59 rules applied. Total rules applied 417 place count 1022 transition count 1500
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 424 place count 1022 transition count 1493
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 424 place count 1022 transition count 1492
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 426 place count 1021 transition count 1492
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 437 place count 1010 transition count 1481
Iterating global reduction 4 with 11 rules applied. Total rules applied 448 place count 1010 transition count 1481
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 459 place count 1010 transition count 1470
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 5 with 240 rules applied. Total rules applied 699 place count 890 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 700 place count 889 transition count 1349
Iterating global reduction 5 with 1 rules applied. Total rules applied 701 place count 889 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 702 place count 889 transition count 1348
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 721 place count 889 transition count 1329
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 722 place count 889 transition count 1329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 724 place count 887 transition count 1327
Applied a total of 724 rules in 283 ms. Remains 887 /1332 variables (removed 445) and now considering 1327/1811 (removed 484) transitions.
[2023-03-10 23:28:02] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2023-03-10 23:28:02] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-10 23:28:02] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-10 23:28:02] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:02] [INFO ] Invariant cache hit.
[2023-03-10 23:28:03] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2023-03-10 23:28:03] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:03] [INFO ] Invariant cache hit.
[2023-03-10 23:28:04] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 887/1332 places, 1327/1811 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2170 ms. Remains : 887/1332 places, 1327/1811 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s410 0), p0:(EQ s24 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3796 reset in 1086 ms.
Product exploration explored 100000 steps with 3799 reset in 1098 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 388 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 381623 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381623 steps, saw 95604 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 23:28:10] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:10] [INFO ] Invariant cache hit.
[2023-03-10 23:28:10] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 23:28:10] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-10 23:28:10] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 23:28:10] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-10 23:28:10] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t375.t1379.t1195 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 931 place count 4 transition count 4
Applied a total of 931 rules in 122 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 4/887 places, 4/1327 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 22 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 23:28:11] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:11] [INFO ] Invariant cache hit.
[2023-03-10 23:28:11] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-10 23:28:11] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:11] [INFO ] Invariant cache hit.
[2023-03-10 23:28:12] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2023-03-10 23:28:12] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:12] [INFO ] Invariant cache hit.
[2023-03-10 23:28:13] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1713 ms. Remains : 887/887 places, 1327/1327 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 385 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 372812 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 372812 steps, saw 93766 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 23:28:16] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:16] [INFO ] Invariant cache hit.
[2023-03-10 23:28:17] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 23:28:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-10 23:28:17] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 23:28:17] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-10 23:28:17] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t375.t1379.t1195 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 931 place count 4 transition count 4
Applied a total of 931 rules in 125 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 4/887 places, 4/1327 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3785 reset in 1087 ms.
Product exploration explored 100000 steps with 3788 reset in 1088 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 77 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 23:28:21] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 23:28:21] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:21] [INFO ] Invariant cache hit.
[2023-03-10 23:28:21] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 887/887 places, 1327/1327 transitions.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 19 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 23:28:21] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:21] [INFO ] Invariant cache hit.
[2023-03-10 23:28:21] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-10 23:28:21] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:21] [INFO ] Invariant cache hit.
[2023-03-10 23:28:22] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2023-03-10 23:28:22] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-10 23:28:22] [INFO ] Invariant cache hit.
[2023-03-10 23:28:23] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1764 ms. Remains : 887/887 places, 1327/1327 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 21579 ms.
[2023-03-10 23:28:23] [INFO ] Flatten gal took : 68 ms
[2023-03-10 23:28:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 23:28:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1332 places, 1811 transitions and 5443 arcs took 11 ms.
Total runtime 127017 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-20b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678491169689

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:527
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 FlexibleBarrier-PT-20b-LTLFireability-14
lola: time limit : 1800 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
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 2/32 FlexibleBarrier-PT-20b-LTLFireability-14 118391 m, 23678 m/sec, 641391 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 2/32 FlexibleBarrier-PT-20b-LTLFireability-14 224142 m, 21150 m/sec, 1327238 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 3/32 FlexibleBarrier-PT-20b-LTLFireability-14 316319 m, 18435 m/sec, 2018879 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 4/32 FlexibleBarrier-PT-20b-LTLFireability-14 434722 m, 23680 m/sec, 2701609 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 5/32 FlexibleBarrier-PT-20b-LTLFireability-14 559368 m, 24929 m/sec, 3373414 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 7/32 FlexibleBarrier-PT-20b-LTLFireability-14 733222 m, 34770 m/sec, 3994947 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 9/32 FlexibleBarrier-PT-20b-LTLFireability-14 897758 m, 32907 m/sec, 4620486 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 10/32 FlexibleBarrier-PT-20b-LTLFireability-14 1034983 m, 27445 m/sec, 5249895 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 11/32 FlexibleBarrier-PT-20b-LTLFireability-14 1159040 m, 24811 m/sec, 5866446 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 13/32 FlexibleBarrier-PT-20b-LTLFireability-14 1314318 m, 31055 m/sec, 6491839 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 14/32 FlexibleBarrier-PT-20b-LTLFireability-14 1469671 m, 31070 m/sec, 7113847 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1800 15/32 FlexibleBarrier-PT-20b-LTLFireability-14 1596046 m, 25275 m/sec, 7733375 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1800 16/32 FlexibleBarrier-PT-20b-LTLFireability-14 1703765 m, 21543 m/sec, 8343027 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1800 18/32 FlexibleBarrier-PT-20b-LTLFireability-14 1855119 m, 30270 m/sec, 8966596 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1800 19/32 FlexibleBarrier-PT-20b-LTLFireability-14 1976799 m, 24336 m/sec, 9584869 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1800 20/32 FlexibleBarrier-PT-20b-LTLFireability-14 2087635 m, 22167 m/sec, 10192768 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1800 21/32 FlexibleBarrier-PT-20b-LTLFireability-14 2213525 m, 25178 m/sec, 10825816 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1800 22/32 FlexibleBarrier-PT-20b-LTLFireability-14 2319118 m, 21118 m/sec, 11426952 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1800 24/32 FlexibleBarrier-PT-20b-LTLFireability-14 2477656 m, 31707 m/sec, 12050276 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/1800 25/32 FlexibleBarrier-PT-20b-LTLFireability-14 2625546 m, 29578 m/sec, 12670593 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/1800 26/32 FlexibleBarrier-PT-20b-LTLFireability-14 2771095 m, 29109 m/sec, 13285147 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/1800 27/32 FlexibleBarrier-PT-20b-LTLFireability-14 2929338 m, 31648 m/sec, 13910476 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/1800 29/32 FlexibleBarrier-PT-20b-LTLFireability-14 3082088 m, 30550 m/sec, 14503810 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/1800 30/32 FlexibleBarrier-PT-20b-LTLFireability-14 3222992 m, 28180 m/sec, 15083676 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 125/1800 31/32 FlexibleBarrier-PT-20b-LTLFireability-14 3354699 m, 26341 m/sec, 15685623 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 130/1800 32/32 FlexibleBarrier-PT-20b-LTLFireability-14 3495354 m, 28131 m/sec, 16277052 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for FlexibleBarrier-PT-20b-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 FlexibleBarrier-PT-20b-LTLFireability-01
lola: time limit : 3465 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
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3465 2/32 FlexibleBarrier-PT-20b-LTLFireability-01 170601 m, 34120 m/sec, 663354 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3465 3/32 FlexibleBarrier-PT-20b-LTLFireability-01 312978 m, 28475 m/sec, 1326790 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3465 4/32 FlexibleBarrier-PT-20b-LTLFireability-01 450038 m, 27412 m/sec, 1991431 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3465 5/32 FlexibleBarrier-PT-20b-LTLFireability-01 577222 m, 25436 m/sec, 2660894 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3465 6/32 FlexibleBarrier-PT-20b-LTLFireability-01 694118 m, 23379 m/sec, 3329727 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3465 7/32 FlexibleBarrier-PT-20b-LTLFireability-01 849650 m, 31106 m/sec, 3991797 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3465 8/32 FlexibleBarrier-PT-20b-LTLFireability-01 1007807 m, 31631 m/sec, 4651019 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3465 9/32 FlexibleBarrier-PT-20b-LTLFireability-01 1164582 m, 31355 m/sec, 5306907 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3465 11/32 FlexibleBarrier-PT-20b-LTLFireability-01 1350577 m, 37199 m/sec, 5928188 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3465 12/32 FlexibleBarrier-PT-20b-LTLFireability-01 1510130 m, 31910 m/sec, 6555452 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3465 14/32 FlexibleBarrier-PT-20b-LTLFireability-01 1640453 m, 26064 m/sec, 7171143 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3465 15/32 FlexibleBarrier-PT-20b-LTLFireability-01 1760785 m, 24066 m/sec, 7782361 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3465 17/32 FlexibleBarrier-PT-20b-LTLFireability-01 1930072 m, 33857 m/sec, 8400693 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3465 18/32 FlexibleBarrier-PT-20b-LTLFireability-01 2079680 m, 29921 m/sec, 9031583 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3465 19/32 FlexibleBarrier-PT-20b-LTLFireability-01 2198854 m, 23834 m/sec, 9638711 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3465 20/32 FlexibleBarrier-PT-20b-LTLFireability-01 2327790 m, 25787 m/sec, 10262095 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3465 22/32 FlexibleBarrier-PT-20b-LTLFireability-01 2468450 m, 28132 m/sec, 10887664 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3465 23/32 FlexibleBarrier-PT-20b-LTLFireability-01 2577418 m, 21793 m/sec, 11479424 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3465 24/32 FlexibleBarrier-PT-20b-LTLFireability-01 2706788 m, 25874 m/sec, 12088408 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3465 25/32 FlexibleBarrier-PT-20b-LTLFireability-01 2821852 m, 23012 m/sec, 12720066 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3465 26/32 FlexibleBarrier-PT-20b-LTLFireability-01 2918129 m, 19255 m/sec, 13320102 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3465 28/32 FlexibleBarrier-PT-20b-LTLFireability-01 3086106 m, 33595 m/sec, 13942633 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3465 29/32 FlexibleBarrier-PT-20b-LTLFireability-01 3240722 m, 30923 m/sec, 14553608 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3465 30/32 FlexibleBarrier-PT-20b-LTLFireability-01 3376690 m, 27193 m/sec, 15168258 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3465 31/32 FlexibleBarrier-PT-20b-LTLFireability-01 3520565 m, 28775 m/sec, 15790757 t fired, .

Time elapsed: 260 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for FlexibleBarrier-PT-20b-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-20b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
FlexibleBarrier-PT-20b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-20b-LTLFireability-01: LTL unknown AGGR
FlexibleBarrier-PT-20b-LTLFireability-14: LTL unknown AGGR


Time elapsed: 265 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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FlexibleBarrier-PT-20b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853300580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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