Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r631-smll-171774447000044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ResIsolation-PT-N09P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r631-smll-171774447000044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 9.6K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 9.1M Jun 7 06:26 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 ResIsolation-PT-N09P1-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717771350024

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N09P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 14:42:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 14:42:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 14:42:34] [INFO ] Load time of PNML (sax parser for PT used): 1237 ms
[2024-06-07 14:42:34] [INFO ] Transformed 299 places.
[2024-06-07 14:42:34] [INFO ] Transformed 9484 transitions.
[2024-06-07 14:42:34] [INFO ] Found NUPN structural information;
[2024-06-07 14:42:34] [INFO ] Parsed PT model containing 299 places and 9484 transitions and 184865 arcs in 1566 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ResIsolation-PT-N09P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 9484/9484 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 289 transition count 9484
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 177 place count 122 transition count 9317
Iterating global reduction 1 with 167 rules applied. Total rules applied 344 place count 122 transition count 9317
Ensure Unique test removed 1285 transitions
Reduce isomorphic transitions removed 1285 transitions.
Iterating post reduction 1 with 1285 rules applied. Total rules applied 1629 place count 122 transition count 8032
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1647 place count 104 transition count 8014
Iterating global reduction 2 with 18 rules applied. Total rules applied 1665 place count 104 transition count 8014
Applied a total of 1665 rules in 477 ms. Remains 104 /299 variables (removed 195) and now considering 8014/9484 (removed 1470) transitions.
// Phase 1: matrix 8014 rows 104 cols
[2024-06-07 14:42:35] [INFO ] Computed 0 invariants in 214 ms
[2024-06-07 14:42:35] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-07 14:42:35] [INFO ] Invariant cache hit.
[2024-06-07 14:42:40] [INFO ] Implicit Places using invariants and state equation in 4348 ms returned []
Implicit Place search using SMT with State Equation took 4814 ms to find 0 implicit places.
Running 8013 sub problems to find dead transitions.
[2024-06-07 14:42:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/8118 variables, and 0 constraints, problems are : Problem set: 0 solved, 8013 unsolved in 30407 ms.
Refiners :[State Equation: 0/104 constraints, PredecessorRefiner: 8013/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8013 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/8118 variables, and 0 constraints, problems are : Problem set: 0 solved, 8013 unsolved in 30216 ms.
Refiners :[State Equation: 0/104 constraints, PredecessorRefiner: 7950/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 203704ms problems are : Problem set: 0 solved, 8013 unsolved
Search for dead transitions found 0 dead transitions in 204031ms
Starting structural reductions in LTL mode, iteration 1 : 104/299 places, 8014/9484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209441 ms. Remains : 104/299 places, 8014/9484 transitions.
Support contains 44 out of 104 places after structural reductions.
[2024-06-07 14:46:06] [INFO ] Flatten gal took : 1927 ms
[2024-06-07 14:46:08] [INFO ] Flatten gal took : 1900 ms
[2024-06-07 14:46:11] [INFO ] Input system was already deterministic with 8014 transitions.
Reduction of identical properties reduced properties to check from 38 to 32
RANDOM walk for 40000 steps (8 resets) in 3871 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 104509 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 32
Probabilistic random walk after 104509 steps, saw 30369 distinct states, run finished after 3016 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-07 14:46:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 7957/8001 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8001 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8047/8118 variables, and 68 constraints, problems are : Problem set: 0 solved, 32 unsolved in 5012 ms.
Refiners :[State Equation: 68/104 constraints, PredecessorRefiner: 32/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 7957/8001 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8001 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
SMT process timed out in 11206ms, After SMT, problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.94 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 102 transition count 7987
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 41 place count 87 transition count 7987
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 95 place count 60 transition count 7960
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 60 transition count 7958
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 58 transition count 7958
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 57 transition count 7957
Applied a total of 100 rules in 3275 ms. Remains 57 /104 variables (removed 47) and now considering 7957/8014 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3276 ms. Remains : 57/104 places, 7957/8014 transitions.
RANDOM walk for 40000 steps (8 resets) in 5974 ms. (6 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4004 steps (2 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (3 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (1 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (6 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (6 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (3 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (6 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (2 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (2 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (1 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (2 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (6 resets) in 66 ms. (59 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (2 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (7 resets) in 70 ms. (56 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (3 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (0 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (3 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (2 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (2 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
// Phase 1: matrix 7957 rows 57 cols
[2024-06-07 14:46:32] [INFO ] Computed 10 invariants in 58 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/57 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 7957/8014 variables, 57/67 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8014 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 0/8014 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8014/8014 variables, and 67 constraints, problems are : Problem set: 1 solved, 27 unsolved in 18011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 28/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 14/57 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 7957/8014 variables, 57/67 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8014 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 0/8014 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8014/8014 variables, and 67 constraints, problems are : Problem set: 1 solved, 27 unsolved in 31832 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 50808ms problems are : Problem set: 1 solved, 27 unsolved
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 20 properties in 5688 ms.
Support contains 31 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 7957/7957 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 55 transition count 7444
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 7444
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 261 place count 55 transition count 7187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 261 place count 55 transition count 7186
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 263 place count 54 transition count 7186
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 264 place count 54 transition count 7185
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 265 place count 54 transition count 7184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 266 place count 53 transition count 7184
Applied a total of 266 rules in 2637 ms. Remains 53 /57 variables (removed 4) and now considering 7184/7957 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2637 ms. Remains : 53/57 places, 7184/7957 transitions.
RANDOM walk for 40000 steps (8 resets) in 4291 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 107442 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 7
Probabilistic random walk after 107442 steps, saw 17205 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 7184 rows 53 cols
[2024-06-07 14:47:36] [INFO ] Computed 10 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7184/7237 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/7237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7237/7237 variables, and 63 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4759 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7184/7237 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/7237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7237/7237 variables, and 63 constraints, problems are : Problem set: 0 solved, 7 unsolved in 8141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13240ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 7 properties in 1628 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.290 ms
FORMULA ResIsolation-PT-N09P1-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((G(p2)||p1))))'
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.162 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 101 transition count 8004
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 94 transition count 8004
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 15 place count 94 transition count 7994
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 35 place count 84 transition count 7994
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 82 transition count 7481
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 82 transition count 7481
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 2 with 257 rules applied. Total rules applied 296 place count 82 transition count 7224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 296 place count 82 transition count 7223
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 298 place count 81 transition count 7223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 299 place count 80 transition count 6711
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 80 transition count 6711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 80 transition count 6710
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 301 place count 80 transition count 6709
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 303 place count 79 transition count 6709
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 337 place count 62 transition count 6692
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 343 place count 59 transition count 6700
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 344 place count 59 transition count 6699
Applied a total of 344 rules in 3579 ms. Remains 59 /104 variables (removed 45) and now considering 6699/8014 (removed 1315) transitions.
// Phase 1: matrix 6699 rows 59 cols
[2024-06-07 14:47:55] [INFO ] Computed 0 invariants in 59 ms
[2024-06-07 14:47:56] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-06-07 14:47:56] [INFO ] Invariant cache hit.
[2024-06-07 14:48:00] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 5021 ms to find 0 implicit places.
[2024-06-07 14:48:31] [INFO ] Redundant transitions in 30751 ms returned []
Running 6681 sub problems to find dead transitions.
[2024-06-07 14:48:31] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/6758 variables, and 0 constraints, problems are : Problem set: 0 solved, 6681 unsolved in 30174 ms.
Refiners :[State Equation: 0/59 constraints, PredecessorRefiner: 6681/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6681 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 57/6758 variables, and 0 constraints, problems are : Problem set: 0 solved, 6681 unsolved in 30178 ms.
Refiners :[State Equation: 0/59 constraints, PredecessorRefiner: 6669/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 188991ms problems are : Problem set: 0 solved, 6681 unsolved
Search for dead transitions found 0 dead transitions in 189141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/104 places, 6699/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228564 ms. Remains : 59/104 places, 6699/8014 transitions.
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 4561 ms.
Product exploration explored 100000 steps with 0 reset in 3983 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 141 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 4
RANDOM walk for 40000 steps (8 resets) in 2778 ms. (14 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 634 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 732 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 170734 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :2 out of 4
Probabilistic random walk after 170734 steps, saw 24991 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :2
[2024-06-07 14:51:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6668/6685 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6685 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/6744 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6744 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/6758 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6758/6758 variables, and 59 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3044 ms.
Refiners :[State Equation: 59/59 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6668/6685 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6685 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/6744 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6744 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/6758 variables, 7/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6758/6758 variables, and 59 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3104 ms.
Refiners :[State Equation: 59/59 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6225ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 3 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p2 p0)), (G (OR p2 p0 p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 18 factoid took 292 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 6699/6699 transitions.
Applied a total of 0 rules in 614 ms. Remains 59 /59 variables (removed 0) and now considering 6699/6699 (removed 0) transitions.
[2024-06-07 14:52:02] [INFO ] Invariant cache hit.
[2024-06-07 14:52:02] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-06-07 14:52:02] [INFO ] Invariant cache hit.
[2024-06-07 14:52:06] [INFO ] Implicit Places using invariants and state equation in 3757 ms returned []
Implicit Place search using SMT with State Equation took 4409 ms to find 0 implicit places.
[2024-06-07 14:52:35] [INFO ] Redundant transitions in 29071 ms returned []
Running 6681 sub problems to find dead transitions.
[2024-06-07 14:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6681 unsolved
SMT process timed out in 155503ms, After SMT, problems are : Problem set: 0 solved, 6681 unsolved
Search for dead transitions found 0 dead transitions in 155581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 189701 ms. Remains : 59/59 places, 6699/6699 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 155 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 4
RANDOM walk for 40000 steps (8 resets) in 2222 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 805 ms. (49 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 764 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 869 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 833 ms. (47 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 178418 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :2 out of 4
Probabilistic random walk after 178418 steps, saw 26112 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :2
[2024-06-07 14:55:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6668/6685 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6685 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/6744 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6744 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/6758 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6758/6758 variables, and 59 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2872 ms.
Refiners :[State Equation: 59/59 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6668/6685 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6685 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/6744 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6744 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/6758 variables, 7/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6758 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6758/6758 variables, and 59 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3336 ms.
Refiners :[State Equation: 59/59 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6283ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 6 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p2 p0)), (G (OR p2 p0 p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 18 factoid took 389 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 3900 ms.
Product exploration explored 100000 steps with 0 reset in 3688 ms.
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 6699/6699 transitions.
Applied a total of 0 rules in 616 ms. Remains 59 /59 variables (removed 0) and now considering 6699/6699 (removed 0) transitions.
[2024-06-07 14:55:32] [INFO ] Invariant cache hit.
[2024-06-07 14:55:32] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-06-07 14:55:32] [INFO ] Invariant cache hit.
[2024-06-07 14:55:37] [INFO ] Implicit Places using invariants and state equation in 4202 ms returned []
Implicit Place search using SMT with State Equation took 4947 ms to find 0 implicit places.
[2024-06-07 14:56:07] [INFO ] Redundant transitions in 30383 ms returned []
Running 6681 sub problems to find dead transitions.
[2024-06-07 14:56:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/6758 variables, and 0 constraints, problems are : Problem set: 0 solved, 6681 unsolved in 30112 ms.
Refiners :[State Equation: 0/59 constraints, PredecessorRefiner: 6681/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 57/6758 variables, and 0 constraints, problems are : Problem set: 0 solved, 6681 unsolved in 30110 ms.
Refiners :[State Equation: 0/59 constraints, PredecessorRefiner: 6669/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 188305ms problems are : Problem set: 0 solved, 6681 unsolved
Search for dead transitions found 0 dead transitions in 188418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 224394 ms. Remains : 59/59 places, 6699/6699 transitions.
Treatment of property ResIsolation-PT-N09P1-LTLFireability-00 finished in 686122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 14 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (trivial) has 59 edges and 104 vertex of which 9 / 104 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 831 edges and 98 vertex of which 96 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 95 transition count 7998
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 88 transition count 7998
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 88 transition count 7988
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 78 transition count 7988
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 76 transition count 6964
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 76 transition count 6964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 76 transition count 6962
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 42 place count 76 transition count 6960
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 74 transition count 6960
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 76 place count 59 transition count 6945
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 332 place count 59 transition count 6689
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 56 transition count 6697
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 339 place count 56 transition count 6696
Applied a total of 339 rules in 11303 ms. Remains 56 /104 variables (removed 48) and now considering 6696/8014 (removed 1318) transitions.
[2024-06-07 14:59:29] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 14:59:29] [INFO ] Computed 0 invariants in 45 ms
[2024-06-07 14:59:30] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-06-07 14:59:30] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:59:30] [INFO ] Invariant cache hit.
[2024-06-07 14:59:35] [INFO ] State equation strengthened by 5819 read => feed constraints.
[2024-06-07 14:59:55] [INFO ] Implicit Places using invariants and state equation in 25518 ms returned []
Implicit Place search using SMT with State Equation took 26330 ms to find 0 implicit places.
[2024-06-07 15:00:23] [INFO ] Redundant transitions in 27379 ms returned []
Running 6678 sub problems to find dead transitions.
[2024-06-07 15:00:23] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:00:23] [INFO ] Invariant cache hit.
[2024-06-07 15:00:29] [INFO ] State equation strengthened by 5819 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 54/6750 variables, and 0 constraints, problems are : Problem set: 0 solved, 6678 unsolved in 30130 ms.
Refiners :[State Equation: 0/56 constraints, ReadFeed: 0/5819 constraints, PredecessorRefiner: 6678/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6678 unsolved
SMT process timed out in 191224ms, After SMT, problems are : Problem set: 0 solved, 6678 unsolved
Search for dead transitions found 0 dead transitions in 191304ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/104 places, 6696/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256347 ms. Remains : 56/104 places, 6696/8014 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 2963 ms.
Product exploration explored 100000 steps with 0 reset in 2387 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 4344 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 850 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1078 ms. (37 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 150471 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 150471 steps, saw 22697 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-07 15:03:45] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:03:45] [INFO ] Invariant cache hit.
[2024-06-07 15:03:49] [INFO ] State equation strengthened by 5819 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6648/6662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6662 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/6735 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 10393ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 56 transition count 6687
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 51 transition count 6682
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 6681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 50 transition count 6681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 49 transition count 6680
Applied a total of 22 rules in 14351 ms. Remains 49 /56 variables (removed 7) and now considering 6680/6696 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14351 ms. Remains : 49/56 places, 6680/6696 transitions.
RANDOM walk for 40000 steps (8 resets) in 3418 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 510 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 594 ms. (67 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 71382 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 71382 steps, saw 14973 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 6680 rows 49 cols
[2024-06-07 15:04:14] [INFO ] Computed 6 invariants in 73 ms
[2024-06-07 15:04:17] [INFO ] State equation strengthened by 4986 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6680/6715 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6715 variables, 4986/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6715 variables, 0/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6729 variables, 14/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6729/6729 variables, and 5041 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15917 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 4986/4986 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6680/6715 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6715 variables, 4986/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6715 variables, 0/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6729 variables, 14/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6729/6729 variables, and 5041 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18444 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 4986/4986 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 37112ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 231 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Applied a total of 0 rules in 5095 ms. Remains 56 /56 variables (removed 0) and now considering 6696/6696 (removed 0) transitions.
[2024-06-07 15:04:57] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 15:04:57] [INFO ] Computed 0 invariants in 40 ms
[2024-06-07 15:04:58] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-06-07 15:04:58] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:04:58] [INFO ] Invariant cache hit.
[2024-06-07 15:05:01] [INFO ] State equation strengthened by 5819 read => feed constraints.
[2024-06-07 15:05:24] [INFO ] Implicit Places using invariants and state equation in 26240 ms returned []
Implicit Place search using SMT with State Equation took 27011 ms to find 0 implicit places.
[2024-06-07 15:05:50] [INFO ] Redundant transitions in 26446 ms returned []
Running 6678 sub problems to find dead transitions.
[2024-06-07 15:05:51] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:05:51] [INFO ] Invariant cache hit.
[2024-06-07 15:05:56] [INFO ] State equation strengthened by 5819 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6678 unsolved
SMT process timed out in 161417ms, After SMT, problems are : Problem set: 0 solved, 6678 unsolved
Search for dead transitions found 0 dead transitions in 161497ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 220074 ms. Remains : 56/56 places, 6696/6696 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 2137 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1250 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 762 ms. (52 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149134 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149134 steps, saw 22474 distinct states, run finished after 3013 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-07 15:08:37] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:08:37] [INFO ] Invariant cache hit.
[2024-06-07 15:08:42] [INFO ] State equation strengthened by 5819 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6648/6662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6662 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/6735 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 10570ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 56 transition count 6687
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 51 transition count 6682
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 6681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 50 transition count 6681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 49 transition count 6680
Applied a total of 22 rules in 15003 ms. Remains 49 /56 variables (removed 7) and now considering 6680/6696 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15003 ms. Remains : 49/56 places, 6680/6696 transitions.
RANDOM walk for 40000 steps (8 resets) in 3125 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 71372 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 71372 steps, saw 14970 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 6680 rows 49 cols
[2024-06-07 15:09:06] [INFO ] Computed 6 invariants in 70 ms
[2024-06-07 15:09:09] [INFO ] State equation strengthened by 4986 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6680/6715 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6715 variables, 4986/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6715 variables, 0/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6729 variables, 14/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6729/6729 variables, and 5041 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17307 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 4986/4986 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6680/6715 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6715 variables, 4986/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6715 variables, 0/5027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6729 variables, 14/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6729 variables, 0/5041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6729/6729 variables, and 5041 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18134 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 4986/4986 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 38200ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 222 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2999 ms.
Product exploration explored 100000 steps with 0 reset in 2576 ms.
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Applied a total of 0 rules in 5191 ms. Remains 56 /56 variables (removed 0) and now considering 6696/6696 (removed 0) transitions.
[2024-06-07 15:09:56] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 15:09:56] [INFO ] Computed 0 invariants in 43 ms
[2024-06-07 15:09:57] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-06-07 15:09:57] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:09:57] [INFO ] Invariant cache hit.
[2024-06-07 15:10:01] [INFO ] State equation strengthened by 5819 read => feed constraints.
[2024-06-07 15:10:20] [INFO ] Implicit Places using invariants and state equation in 23484 ms returned []
Implicit Place search using SMT with State Equation took 24303 ms to find 0 implicit places.
[2024-06-07 15:10:47] [INFO ] Redundant transitions in 26434 ms returned []
Running 6678 sub problems to find dead transitions.
[2024-06-07 15:10:47] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:10:47] [INFO ] Invariant cache hit.
[2024-06-07 15:10:52] [INFO ] State equation strengthened by 5819 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 54/6750 variables, and 0 constraints, problems are : Problem set: 0 solved, 6678 unsolved in 30116 ms.
Refiners :[State Equation: 0/56 constraints, ReadFeed: 0/5819 constraints, PredecessorRefiner: 6678/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6678 unsolved
SMT process timed out in 193514ms, After SMT, problems are : Problem set: 0 solved, 6678 unsolved
Search for dead transitions found 0 dead transitions in 193593ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 249545 ms. Remains : 56/56 places, 6696/6696 transitions.
Treatment of property ResIsolation-PT-N09P1-LTLFireability-01 finished in 884382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(p1)&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))))'
Support contains 18 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 7501
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 7501
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 261 place count 102 transition count 7244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 262 place count 101 transition count 6732
Iterating global reduction 1 with 1 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 136 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 15:14:02] [INFO ] Computed 0 invariants in 97 ms
[2024-06-07 15:14:03] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-06-07 15:14:03] [INFO ] Invariant cache hit.
[2024-06-07 15:14:07] [INFO ] Implicit Places using invariants and state equation in 4014 ms returned []
Implicit Place search using SMT with State Equation took 4724 ms to find 0 implicit places.
Running 6731 sub problems to find dead transitions.
[2024-06-07 15:14:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/6833 variables, and 0 constraints, problems are : Problem set: 0 solved, 6731 unsolved in 30115 ms.
Refiners :[State Equation: 0/101 constraints, PredecessorRefiner: 6731/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6731 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/6833 variables, and 0 constraints, problems are : Problem set: 0 solved, 6731 unsolved in 30168 ms.
Refiners :[State Equation: 0/101 constraints, PredecessorRefiner: 6670/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 184439ms problems are : Problem set: 0 solved, 6731 unsolved
Search for dead transitions found 0 dead transitions in 184520ms
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6732/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189401 ms. Remains : 101/104 places, 6732/8014 transitions.
Stuttering acceptance computed with spot in 583 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 2814 ms.
Product exploration explored 100000 steps with 1 reset in 2856 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.118 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 162 ms. Reduced automaton from 9 states, 38 edges and 3 AP (stutter sensitive) to 9 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 2307 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 133 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 178 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 206 ms. (19 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 137 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 132 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 75379 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 15
Probabilistic random walk after 75379 steps, saw 29686 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-06-07 15:17:23] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 6669/6687 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6687 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 74/6761 variables, 46/64 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6761 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 31/6792 variables, 12/76 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6792 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 23/6815 variables, 11/87 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6815/6833 variables, and 87 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5013 ms.
Refiners :[State Equation: 87/101 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 6669/6687 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6687 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 74/6761 variables, 46/64 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6761 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 31/6792 variables, 12/76 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6792 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 23/6815 variables, 11/87 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6815/6833 variables, and 87 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5010 ms.
Refiners :[State Equation: 87/101 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10411ms problems are : Problem set: 3 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 6732/6732 transitions.
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 99 transition count 6704
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 44 place count 83 transition count 6703
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 83 transition count 6701
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 81 transition count 6701
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 54 transition count 6674
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 54 transition count 6673
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 54 transition count 6671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 52 transition count 6671
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 51 transition count 6670
Applied a total of 108 rules in 2740 ms. Remains 51 /101 variables (removed 50) and now considering 6670/6732 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2740 ms. Remains : 51/101 places, 6670/6732 transitions.
RANDOM walk for 40000 steps (8 resets) in 6472 ms. (6 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 703 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 829 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 7/7 properties
// Phase 1: matrix 6670 rows 51 cols
[2024-06-07 15:17:39] [INFO ] Computed 10 invariants in 60 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/51 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6670/6721 variables, 51/61 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6721 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/6721 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6721/6721 variables, and 61 constraints, problems are : Problem set: 1 solved, 6 unsolved in 4026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/51 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6670/6721 variables, 51/61 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6721 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/6721 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6721/6721 variables, and 61 constraints, problems are : Problem set: 2 solved, 5 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8302ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=2 )
Parikh walk visited 5 properties in 5 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 30 factoid took 727 ms. Reduced automaton from 9 states, 38 edges and 3 AP (stutter sensitive) to 15 states, 48 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 781 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 821 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false]
Support contains 18 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 6732/6732 transitions.
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.41 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 98 transition count 6723
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 92 transition count 6722
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 14 place count 92 transition count 6710
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 80 transition count 6710
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 63 transition count 6693
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 60 transition count 6701
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 60 transition count 6700
Applied a total of 79 rules in 1730 ms. Remains 60 /101 variables (removed 41) and now considering 6700/6732 (removed 32) transitions.
// Phase 1: matrix 6700 rows 60 cols
[2024-06-07 15:17:51] [INFO ] Computed 0 invariants in 83 ms
[2024-06-07 15:17:52] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-06-07 15:17:52] [INFO ] Invariant cache hit.
[2024-06-07 15:17:56] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 5064 ms to find 0 implicit places.
[2024-06-07 15:18:25] [INFO ] Redundant transitions in 28587 ms returned []
Running 6682 sub problems to find dead transitions.
[2024-06-07 15:18:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/6760 variables, and 0 constraints, problems are : Problem set: 0 solved, 6682 unsolved in 30105 ms.
Refiners :[State Equation: 0/60 constraints, PredecessorRefiner: 6682/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 58/6760 variables, and 0 constraints, problems are : Problem set: 0 solved, 6682 unsolved in 30176 ms.
Refiners :[State Equation: 0/60 constraints, PredecessorRefiner: 6669/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 181334ms problems are : Problem set: 0 solved, 6682 unsolved
Search for dead transitions found 0 dead transitions in 181412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/101 places, 6700/6732 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216821 ms. Remains : 60/101 places, 6700/6732 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR p2 (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 303 ms. Reduced automaton from 15 states, 48 edges and 3 AP (stutter insensitive) to 15 states, 48 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 876 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 6346 ms. (6 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 153 ms. (25 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 109 ms. (36 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 139 ms. (28 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 145 ms. (27 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 166 ms. (23 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 145 ms. (27 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 216058 steps, run timeout after 6001 ms. (steps per millisecond=36 ) properties seen :6 out of 18
Probabilistic random walk after 216058 steps, saw 31572 distinct states, run finished after 6001 ms. (steps per millisecond=36 ) properties seen :6
[2024-06-07 15:21:36] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6668/6686 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6686 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 60/6746 variables, 35/53 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6746 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem apf4 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/6760 variables, 7/60 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6760 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6760/6760 variables, and 60 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5016 ms.
Refiners :[State Equation: 60/60 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6668/6686 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6686 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 60/6746 variables, 35/53 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6746 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem apf1 is UNSAT
Problem apf10 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/6760 variables, 7/60 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6760 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/6760 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6760/6760 variables, and 60 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5012 ms.
Refiners :[State Equation: 60/60 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10404ms problems are : Problem set: 7 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 6700/6700 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 60 transition count 6694
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 16 place count 55 transition count 6689
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 55 transition count 6687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 53 transition count 6687
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 53 transition count 6687
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 52 transition count 6686
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 52 transition count 6686
Applied a total of 23 rules in 2401 ms. Remains 52 /60 variables (removed 8) and now considering 6686/6700 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2401 ms. Remains : 52/60 places, 6686/6700 transitions.
RANDOM walk for 40000 steps (8 resets) in 4512 ms. (8 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 843 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 801 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 788 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 709 ms. (56 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 200634 steps, run timeout after 6001 ms. (steps per millisecond=33 ) properties seen :0 out of 5
Probabilistic random walk after 200634 steps, saw 28999 distinct states, run finished after 6001 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 6686 rows 52 cols
[2024-06-07 15:21:57] [INFO ] Computed 6 invariants in 155 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6686/6725 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6725 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/6738 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6738 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/6738 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6738/6738 variables, and 58 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4610 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6686/6725 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6725 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/6738 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6738 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/6738 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6738/6738 variables, and 58 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10647ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 15 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=2 )
Parikh walk visited 5 properties in 6 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR p2 (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p1 (NOT p2) p0)), (G (OR p1 p0)), (G (AND (OR p1 p0) (OR (NOT p2) p0))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR p1 p2 (NOT p0))), (G (OR (AND p1 (NOT p2)) p0)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2) p0))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 41 factoid took 1210 ms. Reduced automaton from 15 states, 48 edges and 3 AP (stutter insensitive) to 13 states, 43 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 818 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0) p2), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 737 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0) p2), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 745 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0) p2), false, false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 4097 ms.
Product exploration explored 100000 steps with 0 reset in 3768 ms.
Support contains 18 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 6700/6700 transitions.
Applied a total of 0 rules in 591 ms. Remains 60 /60 variables (removed 0) and now considering 6700/6700 (removed 0) transitions.
// Phase 1: matrix 6700 rows 60 cols
[2024-06-07 15:22:20] [INFO ] Computed 0 invariants in 77 ms
[2024-06-07 15:22:21] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-06-07 15:22:21] [INFO ] Invariant cache hit.
[2024-06-07 15:22:26] [INFO ] Implicit Places using invariants and state equation in 4759 ms returned []
Implicit Place search using SMT with State Equation took 5669 ms to find 0 implicit places.
[2024-06-07 15:22:52] [INFO ] Redundant transitions in 26110 ms returned []
Running 6682 sub problems to find dead transitions.
[2024-06-07 15:22:52] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/6760 variables, and 0 constraints, problems are : Problem set: 0 solved, 6682 unsolved in 30146 ms.
Refiners :[State Equation: 0/60 constraints, PredecessorRefiner: 6682/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6682 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 58/6760 variables, and 0 constraints, problems are : Problem set: 0 solved, 6682 unsolved in 30109 ms.
Refiners :[State Equation: 0/60 constraints, PredecessorRefiner: 6669/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 181246ms problems are : Problem set: 0 solved, 6682 unsolved
Search for dead transitions found 0 dead transitions in 181338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 213730 ms. Remains : 60/60 places, 6700/6700 transitions.
Treatment of property ResIsolation-PT-N09P1-LTLFireability-02 finished in 712314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 16 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (trivial) has 56 edges and 104 vertex of which 6 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 834 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.29 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 97 transition count 8000
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 90 transition count 8000
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 90 transition count 7990
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 80 transition count 7990
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 77 transition count 6965
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 77 transition count 6965
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 2 with 258 rules applied. Total rules applied 300 place count 77 transition count 6707
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 300 place count 77 transition count 6705
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 75 transition count 6705
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 334 place count 60 transition count 6690
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 340 place count 57 transition count 6698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 57 transition count 6697
Applied a total of 341 rules in 8421 ms. Remains 57 /104 variables (removed 47) and now considering 6697/8014 (removed 1317) transitions.
[2024-06-07 15:26:03] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
// Phase 1: matrix 6696 rows 57 cols
[2024-06-07 15:26:03] [INFO ] Computed 0 invariants in 72 ms
[2024-06-07 15:26:04] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-06-07 15:26:04] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 15:26:04] [INFO ] Invariant cache hit.
[2024-06-07 15:26:08] [INFO ] State equation strengthened by 4987 read => feed constraints.
[2024-06-07 15:26:27] [INFO ] Implicit Places using invariants and state equation in 23725 ms returned []
Implicit Place search using SMT with State Equation took 24609 ms to find 0 implicit places.
[2024-06-07 15:26:56] [INFO ] Redundant transitions in 28831 ms returned []
Running 6679 sub problems to find dead transitions.
[2024-06-07 15:26:56] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 15:26:56] [INFO ] Invariant cache hit.
[2024-06-07 15:27:00] [INFO ] State equation strengthened by 4987 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 55/6753 variables, and 0 constraints, problems are : Problem set: 0 solved, 6679 unsolved in 30170 ms.
Refiners :[State Equation: 0/57 constraints, ReadFeed: 0/4987 constraints, PredecessorRefiner: 6679/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 55/6753 variables, and 0 constraints, problems are : Problem set: 0 solved, 6679 unsolved in 30104 ms.
Refiners :[State Equation: 0/57 constraints, ReadFeed: 0/4987 constraints, PredecessorRefiner: 6667/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 194801ms problems are : Problem set: 0 solved, 6679 unsolved
Search for dead transitions found 0 dead transitions in 194918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/104 places, 6697/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256799 ms. Remains : 57/104 places, 6697/8014 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 3191 ms.
Product exploration explored 100000 steps with 0 reset in 3583 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 2158 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1516 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1681 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1486 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1591 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1201 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1588 ms. (25 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 304774 steps, run timeout after 9001 ms. (steps per millisecond=33 ) properties seen :3 out of 6
Probabilistic random walk after 304774 steps, saw 43974 distinct states, run finished after 9004 ms. (steps per millisecond=33 ) properties seen :3
[2024-06-07 15:30:31] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 15:30:31] [INFO ] Invariant cache hit.
[2024-06-07 15:30:34] [INFO ] State equation strengthened by 4987 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6662/6678 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6678 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/6738 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 8429ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 57 transition count 6689
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 18 place count 52 transition count 6684
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 52 transition count 6683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 6683
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 50 transition count 6682
Applied a total of 21 rules in 12653 ms. Remains 50 /57 variables (removed 7) and now considering 6682/6697 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12653 ms. Remains : 50/57 places, 6682/6697 transitions.
RANDOM walk for 40000 steps (8 resets) in 3512 ms. (11 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 441 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 71518 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 3
Probabilistic random walk after 71518 steps, saw 13827 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 6682 rows 50 cols
[2024-06-07 15:30:57] [INFO ] Computed 6 invariants in 61 ms
[2024-06-07 15:30:58] [INFO ] State equation strengthened by 3322 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/36 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6682/6718 variables, 36/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6718 variables, 3322/3364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6718 variables, 0/3364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6732 variables, 14/3378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6732/6732 variables, and 3378 constraints, problems are : Problem set: 1 solved, 2 unsolved in 14567 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 3322/3322 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6682/6718 variables, 36/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6718 variables, 3322/3364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6718 variables, 0/3364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6732 variables, 14/3378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6732/6732 variables, and 3378 constraints, problems are : Problem set: 1 solved, 2 unsolved in 13832 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 3322/3322 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 30494ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 724 ms.
Support contains 16 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 6682/6682 transitions.
Applied a total of 0 rules in 4450 ms. Remains 50 /50 variables (removed 0) and now considering 6682/6682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4453 ms. Remains : 50/50 places, 6682/6682 transitions.
RANDOM walk for 40000 steps (8 resets) in 3008 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 427 ms. (93 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81526 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81526 steps, saw 15431 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-06-07 15:31:37] [INFO ] Invariant cache hit.
[2024-06-07 15:31:38] [INFO ] State equation strengthened by 3322 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6682/6718 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6718 variables, 3322/3364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6718 variables, 0/3364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6732 variables, 14/3378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6732/6732 variables, and 3378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13096 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 3322/3322 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6682/6718 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6718 variables, 3322/3364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6718 variables, 0/3364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/6732 variables, 14/3378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6732 variables, 0/3378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6732/6732 variables, and 3378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12646 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 3322/3322 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 27546ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 374 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Support contains 10 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Applied a total of 0 rules in 4264 ms. Remains 57 /57 variables (removed 0) and now considering 6697/6697 (removed 0) transitions.
[2024-06-07 15:32:09] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
// Phase 1: matrix 6696 rows 57 cols
[2024-06-07 15:32:09] [INFO ] Computed 0 invariants in 72 ms
[2024-06-07 15:32:10] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-06-07 15:32:10] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 15:32:10] [INFO ] Invariant cache hit.
[2024-06-07 15:32:14] [INFO ] State equation strengthened by 4987 read => feed constraints.
[2024-06-07 15:32:28] [INFO ] Implicit Places using invariants and state equation in 18100 ms returned []
Implicit Place search using SMT with State Equation took 18885 ms to find 0 implicit places.
[2024-06-07 15:32:55] [INFO ] Redundant transitions in 27055 ms returned []
Running 6679 sub problems to find dead transitions.
[2024-06-07 15:32:55] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 15:32:55] [INFO ] Invariant cache hit.
[2024-06-07 15:32:59] [INFO ] State equation strengthened by 4987 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 55/6753 variables, and 0 constraints, problems are : Problem set: 0 solved, 6679 unsolved in 30119 ms.
Refiners :[State Equation: 0/57 constraints, ReadFeed: 0/4987 constraints, PredecessorRefiner: 6679/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 55/6753 variables, and 0 constraints, problems are : Problem set: 0 solved, 6679 unsolved in 30168 ms.
Refiners :[State Equation: 0/57 constraints, ReadFeed: 0/4987 constraints, PredecessorRefiner: 6667/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 188478ms problems are : Problem set: 0 solved, 6679 unsolved
Search for dead transitions found 0 dead transitions in 188548ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 238772 ms. Remains : 57/57 places, 6697/6697 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 2591 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 416 ms. (95 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 162010 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 162010 steps, saw 23358 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-07 15:36:07] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 15:36:07] [INFO ] Invariant cache hit.
[2024-06-07 15:36:11] [INFO ] State equation strengthened by 4987 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6629/6639 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6639 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6738/6753 variables, and 50 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2813 ms.
Refiners :[State Equation: 50/57 constraints, ReadFeed: 0/4987 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6629/6639 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6639 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/6738 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 11625ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Graph (trivial) has 12 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 56 transition count 6686
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 6686
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 50 transition count 6681
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 6680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 49 transition count 6680
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 48 transition count 6679
Applied a total of 16 rules in 17663 ms. Remains 48 /57 variables (removed 9) and now considering 6679/6697 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17664 ms. Remains : 48/57 places, 6679/6697 transitions.
RANDOM walk for 40000 steps (8 resets) in 2118 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 577 ms. (69 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 77162 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 77162 steps, saw 16129 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 6679 rows 48 cols
[2024-06-07 15:36:41] [INFO ] Computed 6 invariants in 50 ms
[2024-06-07 15:36:46] [INFO ] State equation strengthened by 5754 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6679/6711 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6711 variables, 5754/5792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6711 variables, 0/5792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/6727 variables, 16/5808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6727 variables, 0/5808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6727 variables, 0/5808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6727/6727 variables, and 5808 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30877 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 5754/5754 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6679/6711 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6711 variables, 5754/5792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6711 variables, 0/5792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/6727 variables, 16/5808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6727 variables, 0/5808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6727 variables, 0/5808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6727/6727 variables, and 5808 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28583 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 5754/5754 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 64857ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 3493 ms.
Product exploration explored 100000 steps with 0 reset in 2332 ms.
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Graph (trivial) has 12 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 56 transition count 6695
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 6695
Applied a total of 3 rules in 6070 ms. Remains 55 /57 variables (removed 2) and now considering 6695/6697 (removed 2) transitions.
[2024-06-07 15:37:58] [INFO ] Flow matrix only has 6693 transitions (discarded 2 similar events)
// Phase 1: matrix 6693 rows 55 cols
[2024-06-07 15:37:58] [INFO ] Computed 0 invariants in 81 ms
[2024-06-07 15:37:59] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-06-07 15:37:59] [INFO ] Flow matrix only has 6693 transitions (discarded 2 similar events)
[2024-06-07 15:37:59] [INFO ] Invariant cache hit.
[2024-06-07 15:38:04] [INFO ] State equation strengthened by 6203 read => feed constraints.
[2024-06-07 15:38:42] [INFO ] Implicit Places using invariants and state equation in 42966 ms returned []
Implicit Place search using SMT with State Equation took 44126 ms to find 0 implicit places.
[2024-06-07 15:39:08] [INFO ] Redundant transitions in 25959 ms returned []
Running 6677 sub problems to find dead transitions.
[2024-06-07 15:39:08] [INFO ] Flow matrix only has 6693 transitions (discarded 2 similar events)
[2024-06-07 15:39:08] [INFO ] Invariant cache hit.
[2024-06-07 15:39:16] [INFO ] State equation strengthened by 6203 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 53/6748 variables, and 0 constraints, problems are : Problem set: 0 solved, 6677 unsolved in 30105 ms.
Refiners :[State Equation: 0/55 constraints, ReadFeed: 0/6203 constraints, PredecessorRefiner: 6677/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6677 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6677 unsolved
SMT process timed out in 194956ms, After SMT, problems are : Problem set: 0 solved, 6677 unsolved
Search for dead transitions found 0 dead transitions in 195025ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/57 places, 6695/6697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271198 ms. Remains : 55/57 places, 6695/6697 transitions.
Treatment of property ResIsolation-PT-N09P1-LTLFireability-03 finished in 989970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 6989
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 6989
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 98 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 15:42:24] [INFO ] Computed 0 invariants in 86 ms
[2024-06-07 15:42:25] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-06-07 15:42:25] [INFO ] Invariant cache hit.

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ResIsolation-PT-N09P1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ResIsolation-PT-N09P1, 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 r631-smll-171774447000044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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