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.r484-smll-171624275500188.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 DLCround-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275500188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 963K May 18 16:42 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 DLCround-PT-07b-LTLFireability-00
FORMULA_NAME DLCround-PT-07b-LTLFireability-01
FORMULA_NAME DLCround-PT-07b-LTLFireability-02
FORMULA_NAME DLCround-PT-07b-LTLFireability-03
FORMULA_NAME DLCround-PT-07b-LTLFireability-04
FORMULA_NAME DLCround-PT-07b-LTLFireability-05
FORMULA_NAME DLCround-PT-07b-LTLFireability-06
FORMULA_NAME DLCround-PT-07b-LTLFireability-07
FORMULA_NAME DLCround-PT-07b-LTLFireability-08
FORMULA_NAME DLCround-PT-07b-LTLFireability-09
FORMULA_NAME DLCround-PT-07b-LTLFireability-10
FORMULA_NAME DLCround-PT-07b-LTLFireability-11
FORMULA_NAME DLCround-PT-07b-LTLFireability-12
FORMULA_NAME DLCround-PT-07b-LTLFireability-13
FORMULA_NAME DLCround-PT-07b-LTLFireability-14
FORMULA_NAME DLCround-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225330346

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:02:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:02:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:02:13] [INFO ] Load time of PNML (sax parser for PT used): 569 ms
[2024-06-01 07:02:13] [INFO ] Transformed 2703 places.
[2024-06-01 07:02:13] [INFO ] Transformed 4071 transitions.
[2024-06-01 07:02:13] [INFO ] Found NUPN structural information;
[2024-06-01 07:02:13] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 963 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DLCround-PT-07b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Discarding 470 places :
Symmetric choice reduction at 0 with 470 rule applications. Total rules 470 place count 2233 transition count 3601
Iterating global reduction 0 with 470 rules applied. Total rules applied 940 place count 2233 transition count 3601
Discarding 370 places :
Symmetric choice reduction at 0 with 370 rule applications. Total rules 1310 place count 1863 transition count 3231
Iterating global reduction 0 with 370 rules applied. Total rules applied 1680 place count 1863 transition count 3231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1686 place count 1863 transition count 3225
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 1741 place count 1808 transition count 3096
Iterating global reduction 1 with 55 rules applied. Total rules applied 1796 place count 1808 transition count 3096
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 1830 place count 1774 transition count 3062
Iterating global reduction 1 with 34 rules applied. Total rules applied 1864 place count 1774 transition count 3062
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1868 place count 1774 transition count 3058
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1887 place count 1755 transition count 3039
Iterating global reduction 2 with 19 rules applied. Total rules applied 1906 place count 1755 transition count 3039
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1925 place count 1736 transition count 3020
Iterating global reduction 2 with 19 rules applied. Total rules applied 1944 place count 1736 transition count 3020
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1963 place count 1717 transition count 3001
Iterating global reduction 2 with 19 rules applied. Total rules applied 1982 place count 1717 transition count 3001
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1993 place count 1706 transition count 2990
Iterating global reduction 2 with 11 rules applied. Total rules applied 2004 place count 1706 transition count 2990
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2011 place count 1699 transition count 2983
Iterating global reduction 2 with 7 rules applied. Total rules applied 2018 place count 1699 transition count 2983
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2025 place count 1692 transition count 2976
Iterating global reduction 2 with 7 rules applied. Total rules applied 2032 place count 1692 transition count 2976
Applied a total of 2032 rules in 1760 ms. Remains 1692 /2703 variables (removed 1011) and now considering 2976/4071 (removed 1095) transitions.
// Phase 1: matrix 2976 rows 1692 cols
[2024-06-01 07:02:16] [INFO ] Computed 132 invariants in 47 ms
[2024-06-01 07:02:17] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2024-06-01 07:02:17] [INFO ] Invariant cache hit.
[2024-06-01 07:02:20] [INFO ] Implicit Places using invariants and state equation in 3043 ms returned []
Implicit Place search using SMT with State Equation took 4536 ms to find 0 implicit places.
Running 2975 sub problems to find dead transitions.
[2024-06-01 07:02:20] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1691/4668 variables, and 0 constraints, problems are : Problem set: 0 solved, 2975 unsolved in 30226 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1692 constraints, PredecessorRefiner: 2975/2975 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2975 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 1691/4668 variables, and 0 constraints, problems are : Problem set: 0 solved, 2975 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1692 constraints, PredecessorRefiner: 0/2975 constraints, Known Traps: 0/0 constraints]
After SMT, in 62767ms problems are : Problem set: 0 solved, 2975 unsolved
Search for dead transitions found 0 dead transitions in 62910ms
Starting structural reductions in LTL mode, iteration 1 : 1692/2703 places, 2976/4071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69289 ms. Remains : 1692/2703 places, 2976/4071 transitions.
Support contains 39 out of 1692 places after structural reductions.
[2024-06-01 07:03:24] [INFO ] Flatten gal took : 423 ms
[2024-06-01 07:03:24] [INFO ] Flatten gal took : 173 ms
[2024-06-01 07:03:25] [INFO ] Input system was already deterministic with 2976 transitions.
RANDOM walk for 40000 steps (8 resets) in 2349 ms. (17 steps per ms) remains 4/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
[2024-06-01 07:03:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 436/444 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1248/1692 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1692 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2976/4668 variables, 1692/1824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4668 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/4668 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4668/4668 variables, and 1824 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1692/1692 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 436/444 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1248/1692 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1692 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2976/4668 variables, 1692/1824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4668 variables, 4/1828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4668 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/4668 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4668/4668 variables, and 1828 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3706 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1692/1692 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 5950ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 44501 steps, including 70 resets, run visited all 4 properties in 344 ms. (steps per millisecond=129 )
Parikh walk visited 4 properties in 365 ms.
FORMULA DLCround-PT-07b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 262 stabilizing places and 262 stable transitions
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)&&X(G(p1)))))'
Support contains 3 out of 1692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Graph (trivial) has 1518 edges and 1692 vertex of which 429 / 1692 are part of one of the 37 SCC in 11 ms
Free SCC test removed 392 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1299 transition count 2275
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 317 rules applied. Total rules applied 597 place count 1020 transition count 2237
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 621 place count 996 transition count 2237
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 621 place count 996 transition count 2104
Deduced a syphon composed of 133 places in 12 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 887 place count 863 transition count 2104
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 946 place count 804 transition count 1707
Iterating global reduction 3 with 59 rules applied. Total rules applied 1005 place count 804 transition count 1707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1009 place count 804 transition count 1703
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1009 place count 804 transition count 1700
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1015 place count 801 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1016 place count 800 transition count 1689
Iterating global reduction 4 with 1 rules applied. Total rules applied 1017 place count 800 transition count 1689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1018 place count 800 transition count 1688
Performed 302 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 302 places in 1 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 5 with 604 rules applied. Total rules applied 1622 place count 498 transition count 1378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1630 place count 498 transition count 1370
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1648 place count 480 transition count 1184
Iterating global reduction 6 with 18 rules applied. Total rules applied 1666 place count 480 transition count 1184
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1683 place count 480 transition count 1167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1685 place count 479 transition count 1166
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1711 place count 466 transition count 1269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1716 place count 466 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1720 place count 462 transition count 1196
Iterating global reduction 8 with 4 rules applied. Total rules applied 1724 place count 462 transition count 1196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1728 place count 462 transition count 1192
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1736 place count 458 transition count 1218
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 1767 place count 458 transition count 1187
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 1780 place count 445 transition count 1161
Iterating global reduction 9 with 13 rules applied. Total rules applied 1793 place count 445 transition count 1161
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 1806 place count 432 transition count 1014
Iterating global reduction 9 with 13 rules applied. Total rules applied 1819 place count 432 transition count 1014
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1832 place count 432 transition count 1001
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1833 place count 431 transition count 1000
Applied a total of 1833 rules in 961 ms. Remains 431 /1692 variables (removed 1261) and now considering 1000/2976 (removed 1976) transitions.
[2024-06-01 07:03:34] [INFO ] Flow matrix only has 972 transitions (discarded 28 similar events)
// Phase 1: matrix 972 rows 431 cols
[2024-06-01 07:03:34] [INFO ] Computed 132 invariants in 6 ms
[2024-06-01 07:03:34] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-01 07:03:34] [INFO ] Flow matrix only has 972 transitions (discarded 28 similar events)
[2024-06-01 07:03:34] [INFO ] Invariant cache hit.
[2024-06-01 07:03:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 07:03:35] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2024-06-01 07:03:35] [INFO ] Redundant transitions in 66 ms returned []
Running 936 sub problems to find dead transitions.
[2024-06-01 07:03:35] [INFO ] Flow matrix only has 972 transitions (discarded 28 similar events)
[2024-06-01 07:03:35] [INFO ] Invariant cache hit.
[2024-06-01 07:03:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (OVERLAPS) 2/431 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/1403 variables, and 132 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/431 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (OVERLAPS) 2/431 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 4 (OVERLAPS) 971/1402 variables, 431/563 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1402 variables, 56/619 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/1403 variables, and 1555 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30191 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 431/431 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 0/0 constraints]
After SMT, in 61174ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 61186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 431/1692 places, 1000/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63260 ms. Remains : 431/1692 places, 1000/2976 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-01 finished in 63825 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&&F(p1)&&X(X(G((p2 U X(p3)))))))))'
Support contains 6 out of 1692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1680 transition count 2954
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1680 transition count 2954
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1675 transition count 2949
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1675 transition count 2949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1675 transition count 2948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1672 transition count 2945
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1672 transition count 2945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1670 transition count 2943
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1670 transition count 2943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1668 transition count 2941
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1668 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1667 transition count 2940
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1667 transition count 2940
Applied a total of 51 rules in 865 ms. Remains 1667 /1692 variables (removed 25) and now considering 2940/2976 (removed 36) transitions.
// Phase 1: matrix 2940 rows 1667 cols
[2024-06-01 07:04:37] [INFO ] Computed 132 invariants in 14 ms
[2024-06-01 07:04:39] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2024-06-01 07:04:39] [INFO ] Invariant cache hit.
[2024-06-01 07:04:42] [INFO ] Implicit Places using invariants and state equation in 3179 ms returned []
Implicit Place search using SMT with State Equation took 4432 ms to find 0 implicit places.
Running 2939 sub problems to find dead transitions.
[2024-06-01 07:04:42] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1666/4607 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1667 constraints, PredecessorRefiner: 2939/2939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2939 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 1666/4607 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1667 constraints, PredecessorRefiner: 0/2939 constraints, Known Traps: 0/0 constraints]
After SMT, in 61934ms problems are : Problem set: 0 solved, 2939 unsolved
Search for dead transitions found 0 dead transitions in 61988ms
Starting structural reductions in LTL mode, iteration 1 : 1667/1692 places, 2940/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67298 ms. Remains : 1667/1692 places, 2940/2976 transitions.
Stuttering acceptance computed with spot in 1302 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-02
Product exploration explored 100000 steps with 15 reset in 1156 ms.
Product exploration explored 100000 steps with 13 reset in 884 ms.
Computed a total of 261 stabilizing places and 261 stable transitions
Computed a total of 261 stabilizing places and 261 stable transitions
Detected a total of 261/1667 stabilizing places and 261/2940 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 381 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter sensitive) to 16 states, 69 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1601 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 1621 ms. (24 steps per ms) remains 8/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
[2024-06-01 07:05:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 316/322 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1667 variables, 126/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1667 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2940/4607 variables, 1667/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4607 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/4607 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4607/4607 variables, and 1799 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3293 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1667/1667 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 316/322 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1667 variables, 126/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1667 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2940/4607 variables, 1667/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4607 variables, 8/1807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4607 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/4607 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 4607/4607 variables, and 1807 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1667/1667 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 8337ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 2110 ms.
Support contains 6 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 2940/2940 transitions.
Graph (trivial) has 1489 edges and 1667 vertex of which 436 / 1667 are part of one of the 36 SCC in 5 ms
Free SCC test removed 400 places
Drop transitions (Empty/Sink Transition effects.) removed 456 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 468 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 1267 transition count 2213
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 295 rules applied. Total rules applied 555 place count 1008 transition count 2177
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 579 place count 984 transition count 2177
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 579 place count 984 transition count 2045
Deduced a syphon composed of 132 places in 13 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 843 place count 852 transition count 2045
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 897 place count 798 transition count 1653
Iterating global reduction 3 with 54 rules applied. Total rules applied 951 place count 798 transition count 1653
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 955 place count 798 transition count 1649
Performed 302 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 4 with 604 rules applied. Total rules applied 1559 place count 496 transition count 1339
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1567 place count 496 transition count 1331
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1585 place count 478 transition count 1142
Iterating global reduction 5 with 18 rules applied. Total rules applied 1603 place count 478 transition count 1142
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1621 place count 478 transition count 1124
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -320
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 1695 place count 441 transition count 1444
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1715 place count 441 transition count 1424
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1734 place count 422 transition count 1024
Iterating global reduction 7 with 19 rules applied. Total rules applied 1753 place count 422 transition count 1024
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1772 place count 422 transition count 1005
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1780 place count 418 transition count 1030
Drop transitions (Redundant composition of simpler transitions.) removed 111 transitions
Redundant transition composition rules discarded 111 transitions
Iterating global reduction 8 with 111 rules applied. Total rules applied 1891 place count 418 transition count 919
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1899 place count 410 transition count 830
Iterating global reduction 8 with 8 rules applied. Total rules applied 1907 place count 410 transition count 830
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1915 place count 410 transition count 822
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1923 place count 406 transition count 854
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1929 place count 406 transition count 848
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 1953 place count 406 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1961 place count 402 transition count 851
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1966 place count 402 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1988 place count 402 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1996 place count 398 transition count 852
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2002 place count 398 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 2024 place count 398 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2032 place count 394 transition count 851
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2038 place count 394 transition count 845
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2059 place count 394 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2067 place count 390 transition count 852
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2073 place count 390 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 14 with 22 rules applied. Total rules applied 2095 place count 390 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2103 place count 386 transition count 851
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2109 place count 386 transition count 845
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2130 place count 386 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2138 place count 382 transition count 852
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2144 place count 382 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 16 with 22 rules applied. Total rules applied 2166 place count 382 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2174 place count 378 transition count 855
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2180 place count 378 transition count 849
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2201 place count 378 transition count 828
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2209 place count 374 transition count 860
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2215 place count 374 transition count 854
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 18 with 22 rules applied. Total rules applied 2237 place count 374 transition count 832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2245 place count 370 transition count 859
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2251 place count 370 transition count 853
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2272 place count 370 transition count 832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2280 place count 366 transition count 860
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2286 place count 366 transition count 854
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 20 with 22 rules applied. Total rules applied 2308 place count 366 transition count 832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2316 place count 362 transition count 859
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2322 place count 362 transition count 853
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2343 place count 362 transition count 832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2351 place count 358 transition count 859
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2357 place count 358 transition count 853
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2378 place count 358 transition count 832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2386 place count 354 transition count 860
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2392 place count 354 transition count 854
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 23 with 22 rules applied. Total rules applied 2414 place count 354 transition count 832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2422 place count 350 transition count 855
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 2427 place count 350 transition count 850
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 24 with 20 rules applied. Total rules applied 2447 place count 350 transition count 830
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2455 place count 346 transition count 849
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2459 place count 346 transition count 845
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2478 place count 346 transition count 826
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2486 place count 342 transition count 847
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2490 place count 342 transition count 843
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 26 with 20 rules applied. Total rules applied 2510 place count 342 transition count 823
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2518 place count 338 transition count 842
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2522 place count 338 transition count 838
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2541 place count 338 transition count 819
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2549 place count 334 transition count 840
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2553 place count 334 transition count 836
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 28 with 20 rules applied. Total rules applied 2573 place count 334 transition count 816
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2581 place count 330 transition count 837
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2585 place count 330 transition count 833
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 29 with 20 rules applied. Total rules applied 2605 place count 330 transition count 813
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2613 place count 326 transition count 832
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2617 place count 326 transition count 828
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2636 place count 326 transition count 809
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2644 place count 322 transition count 834
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2648 place count 322 transition count 830
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 31 with 20 rules applied. Total rules applied 2668 place count 322 transition count 810
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2676 place count 318 transition count 837
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2680 place count 318 transition count 833
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 2699 place count 318 transition count 814
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 2707 place count 314 transition count 835
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 2711 place count 314 transition count 831
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 33 with 20 rules applied. Total rules applied 2731 place count 314 transition count 811
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 2739 place count 310 transition count 832
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 2743 place count 310 transition count 828
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 34 with 20 rules applied. Total rules applied 2763 place count 310 transition count 808
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 2771 place count 306 transition count 827
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 2775 place count 306 transition count 823
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 2794 place count 306 transition count 804
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 2802 place count 302 transition count 825
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 2806 place count 302 transition count 821
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 36 with 20 rules applied. Total rules applied 2826 place count 302 transition count 801
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 2834 place count 298 transition count 820
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 2838 place count 298 transition count 816
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 2857 place count 298 transition count 797
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 2859 place count 297 transition count 799
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 2860 place count 297 transition count 798
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 38 with 2 rules applied. Total rules applied 2862 place count 297 transition count 796
Free-agglomeration rule applied 33 times with reduction of 1 identical transitions.
Iterating global reduction 38 with 33 rules applied. Total rules applied 2895 place count 297 transition count 762
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 290 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 292 transitions.
Graph (complete) has 778 edges and 264 vertex of which 178 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.2 ms
Discarding 86 places :
Also discarding 0 output transitions
Iterating post reduction 38 with 326 rules applied. Total rules applied 3221 place count 178 transition count 470
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 39 with 86 rules applied. Total rules applied 3307 place count 178 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 40 with 42 rules applied. Total rules applied 3349 place count 178 transition count 342
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 40 with 1 rules applied. Total rules applied 3350 place count 177 transition count 341
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 40 with 6 rules applied. Total rules applied 3356 place count 171 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 41 with 87 rules applied. Total rules applied 3443 place count 113 transition count 312
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 41 with 86 rules applied. Total rules applied 3529 place count 113 transition count 226
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 42 with 87 rules applied. Total rules applied 3616 place count 55 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (trivial) has 10 edges and 55 vertex of which 8 / 55 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 83 rules applied. Total rules applied 3699 place count 51 transition count 115
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (complete) has 95 edges and 48 vertex of which 34 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 43 with 45 rules applied. Total rules applied 3744 place count 34 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 44 with 9 rules applied. Total rules applied 3753 place count 34 transition count 59
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 45 with 9 rules applied. Total rules applied 3762 place count 28 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 45 with 9 rules applied. Total rules applied 3771 place count 28 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 46 with 9 rules applied. Total rules applied 3780 place count 22 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 46 with 9 rules applied. Total rules applied 3789 place count 22 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 47 with 8 rules applied. Total rules applied 3797 place count 22 transition count 27
Graph (complete) has 38 edges and 22 vertex of which 14 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 47 with 1 rules applied. Total rules applied 3798 place count 14 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 48 with 10 rules applied. Total rules applied 3808 place count 14 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 3808 place count 14 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 49 with 2 rules applied. Total rules applied 3810 place count 13 transition count 16
Applied a total of 3810 rules in 1400 ms. Remains 13 /1667 variables (removed 1654) and now considering 16/2940 (removed 2924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1400 ms. Remains : 13/1667 places, 16/2940 transitions.
RANDOM walk for 130 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1), (F (NOT (OR p3 (NOT p0) p1 (NOT p2)))), (F (NOT (OR p3 p0))), (F (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT p0)), (F p3), (F (NOT (OR p3 p1 (NOT p2)))), (F (NOT (AND (NOT p3) p0 (NOT p2)))), (F (NOT (OR p3 (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p3 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p3 p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p3 p0 p1))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p3 p0 p1 (NOT p2))))]
Knowledge based reduction with 8 factoid took 1945 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter sensitive) to 16 states, 69 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1125 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3)]
Stuttering acceptance computed with spot in 1097 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3)]
[2024-06-01 07:06:06] [INFO ] Invariant cache hit.
[2024-06-01 07:06:09] [INFO ] [Real]Absence check using 132 positive place invariants in 81 ms returned unsat
Proved EG (NOT p1)
[2024-06-01 07:06:09] [INFO ] Invariant cache hit.
[2024-06-01 07:06:12] [INFO ] [Real]Absence check using 132 positive place invariants in 214 ms returned sat
[2024-06-01 07:06:18] [INFO ] [Real]Absence check using state equation in 6610 ms returned sat
[2024-06-01 07:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:06:21] [INFO ] [Nat]Absence check using 132 positive place invariants in 215 ms returned sat
[2024-06-01 07:06:29] [INFO ] [Nat]Absence check using state equation in 7369 ms returned sat
[2024-06-01 07:06:29] [INFO ] Computed and/alt/rep : 2738/4646/2738 causal constraints (skipped 201 transitions) in 272 ms.
Could not prove EG (NOT p3)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1), (F (NOT (OR p3 (NOT p0) p1 (NOT p2)))), (F (NOT (OR p3 p0))), (F (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT p0)), (F p3), (F (NOT (OR p3 p1 (NOT p2)))), (F (NOT (AND (NOT p3) p0 (NOT p2)))), (F (NOT (OR p3 (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p3 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p3 p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p3 p0 p1))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p3 p0 p1 (NOT p2)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 2372 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-07b-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-02 finished in 119390 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)))'
Support contains 2 out of 1692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Graph (trivial) has 1520 edges and 1692 vertex of which 443 / 1692 are part of one of the 36 SCC in 2 ms
Free SCC test removed 407 places
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 276 place count 1284 transition count 2261
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 313 rules applied. Total rules applied 589 place count 1009 transition count 2223
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 613 place count 985 transition count 2223
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 613 place count 985 transition count 2092
Deduced a syphon composed of 131 places in 25 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 875 place count 854 transition count 2092
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 937 place count 792 transition count 1682
Iterating global reduction 3 with 62 rules applied. Total rules applied 999 place count 792 transition count 1682
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1003 place count 792 transition count 1678
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1003 place count 792 transition count 1675
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1009 place count 789 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1010 place count 788 transition count 1664
Iterating global reduction 4 with 1 rules applied. Total rules applied 1011 place count 788 transition count 1664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1012 place count 788 transition count 1663
Performed 297 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 5 with 594 rules applied. Total rules applied 1606 place count 491 transition count 1359
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1614 place count 491 transition count 1351
Renaming transitions due to excessive name length > 1024 char.
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1633 place count 472 transition count 1154
Iterating global reduction 6 with 19 rules applied. Total rules applied 1652 place count 472 transition count 1154
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1671 place count 472 transition count 1135
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1695 place count 460 transition count 1226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1699 place count 460 transition count 1222
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1703 place count 456 transition count 1154
Iterating global reduction 8 with 4 rules applied. Total rules applied 1707 place count 456 transition count 1154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1711 place count 456 transition count 1150
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1719 place count 452 transition count 1176
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 9 with 34 rules applied. Total rules applied 1753 place count 452 transition count 1142
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 1769 place count 436 transition count 1110
Iterating global reduction 9 with 16 rules applied. Total rules applied 1785 place count 436 transition count 1110
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 1801 place count 420 transition count 930
Iterating global reduction 9 with 16 rules applied. Total rules applied 1817 place count 420 transition count 930
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1833 place count 420 transition count 914
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1834 place count 419 transition count 913
Applied a total of 1834 rules in 588 ms. Remains 419 /1692 variables (removed 1273) and now considering 913/2976 (removed 2063) transitions.
[2024-06-01 07:06:36] [INFO ] Flow matrix only has 889 transitions (discarded 24 similar events)
// Phase 1: matrix 889 rows 419 cols
[2024-06-01 07:06:36] [INFO ] Computed 132 invariants in 3 ms
[2024-06-01 07:06:37] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 07:06:37] [INFO ] Flow matrix only has 889 transitions (discarded 24 similar events)
[2024-06-01 07:06:37] [INFO ] Invariant cache hit.
[2024-06-01 07:06:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:06:38] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-06-01 07:06:38] [INFO ] Redundant transitions in 156 ms returned []
Running 848 sub problems to find dead transitions.
[2024-06-01 07:06:38] [INFO ] Flow matrix only has 889 transitions (discarded 24 similar events)
[2024-06-01 07:06:38] [INFO ] Invariant cache hit.
[2024-06-01 07:06:38] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (OVERLAPS) 1/419 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1308 variables, and 132 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/419 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (OVERLAPS) 1/419 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 4 (OVERLAPS) 888/1307 variables, 419/551 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1307 variables, 45/596 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1307 variables, 848/1444 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1307/1308 variables, and 1444 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 419/419 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 0/0 constraints]
After SMT, in 60986ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 61003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1692 places, 913/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63087 ms. Remains : 419/1692 places, 913/2976 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-04 finished in 63174 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(X(F(((!X(X(!F(p0))) U p1)&&p2))))))'
Support contains 3 out of 1692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Graph (trivial) has 1516 edges and 1692 vertex of which 437 / 1692 are part of one of the 35 SCC in 3 ms
Free SCC test removed 402 places
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 276 place count 1289 transition count 2266
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 313 rules applied. Total rules applied 589 place count 1014 transition count 2228
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 613 place count 990 transition count 2228
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 613 place count 990 transition count 2095
Deduced a syphon composed of 133 places in 15 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 879 place count 857 transition count 2095
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 939 place count 797 transition count 1687
Iterating global reduction 3 with 60 rules applied. Total rules applied 999 place count 797 transition count 1687
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1003 place count 797 transition count 1683
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1003 place count 797 transition count 1680
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1009 place count 794 transition count 1680
Performed 298 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 596 rules applied. Total rules applied 1605 place count 496 transition count 1374
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1613 place count 496 transition count 1366
Renaming transitions due to excessive name length > 1024 char.
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1632 place count 477 transition count 1169
Iterating global reduction 5 with 19 rules applied. Total rules applied 1651 place count 477 transition count 1169
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1669 place count 477 transition count 1151
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1695 place count 464 transition count 1252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1699 place count 464 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1703 place count 460 transition count 1180
Iterating global reduction 7 with 4 rules applied. Total rules applied 1707 place count 460 transition count 1180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1711 place count 460 transition count 1176
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1719 place count 456 transition count 1202
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 1753 place count 456 transition count 1168
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1768 place count 441 transition count 1138
Iterating global reduction 8 with 15 rules applied. Total rules applied 1783 place count 441 transition count 1138
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1798 place count 426 transition count 969
Iterating global reduction 8 with 15 rules applied. Total rules applied 1813 place count 426 transition count 969
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1828 place count 426 transition count 954
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1829 place count 425 transition count 953
Applied a total of 1829 rules in 502 ms. Remains 425 /1692 variables (removed 1267) and now considering 953/2976 (removed 2023) transitions.
[2024-06-01 07:07:40] [INFO ] Flow matrix only has 929 transitions (discarded 24 similar events)
// Phase 1: matrix 929 rows 425 cols
[2024-06-01 07:07:40] [INFO ] Computed 132 invariants in 7 ms
[2024-06-01 07:07:40] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-06-01 07:07:40] [INFO ] Flow matrix only has 929 transitions (discarded 24 similar events)
[2024-06-01 07:07:40] [INFO ] Invariant cache hit.
[2024-06-01 07:07:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:07:41] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
[2024-06-01 07:07:41] [INFO ] Redundant transitions in 29 ms returned []
Running 886 sub problems to find dead transitions.
[2024-06-01 07:07:41] [INFO ] Flow matrix only has 929 transitions (discarded 24 similar events)
[2024-06-01 07:07:41] [INFO ] Invariant cache hit.
[2024-06-01 07:07:41] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 2 (OVERLAPS) 1/425 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1354 variables, and 132 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/425 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 886 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 2 (OVERLAPS) 1/425 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 4 (OVERLAPS) 928/1353 variables, 425/557 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1353 variables, 45/602 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1353 variables, 886/1488 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1353/1354 variables, and 1488 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 425/425 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 0/0 constraints]
After SMT, in 60813ms problems are : Problem set: 0 solved, 886 unsolved
Search for dead transitions found 0 dead transitions in 60828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1692 places, 953/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62949 ms. Remains : 425/1692 places, 953/2976 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-07b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-06 finished in 63237 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((X(X(G(p0)))||F(p1))))'
Support contains 4 out of 1692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1678 transition count 2952
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1678 transition count 2952
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1671 transition count 2945
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1671 transition count 2945
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 1671 transition count 2943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 1668 transition count 2940
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 1668 transition count 2940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 1666 transition count 2938
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 1666 transition count 2938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 1664 transition count 2936
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 1664 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1663 transition count 2935
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1663 transition count 2935
Applied a total of 60 rules in 603 ms. Remains 1663 /1692 variables (removed 29) and now considering 2935/2976 (removed 41) transitions.
// Phase 1: matrix 2935 rows 1663 cols
[2024-06-01 07:08:43] [INFO ] Computed 132 invariants in 18 ms
[2024-06-01 07:08:44] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-06-01 07:08:44] [INFO ] Invariant cache hit.
[2024-06-01 07:08:47] [INFO ] Implicit Places using invariants and state equation in 2880 ms returned []
Implicit Place search using SMT with State Equation took 3724 ms to find 0 implicit places.
Running 2934 sub problems to find dead transitions.
[2024-06-01 07:08:47] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 2934/2934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2934 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 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 0/2934 constraints, Known Traps: 0/0 constraints]
After SMT, in 61949ms problems are : Problem set: 0 solved, 2934 unsolved
Search for dead transitions found 0 dead transitions in 62000ms
Starting structural reductions in LTL mode, iteration 1 : 1663/1692 places, 2935/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66343 ms. Remains : 1663/1692 places, 2935/2976 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-07
Product exploration explored 100000 steps with 10 reset in 887 ms.
Product exploration explored 100000 steps with 8 reset in 774 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 37451 steps (8 resets) in 1217 ms. (30 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 2935/2935 transitions.
Applied a total of 0 rules in 101 ms. Remains 1663 /1663 variables (removed 0) and now considering 2935/2935 (removed 0) transitions.
[2024-06-01 07:09:52] [INFO ] Invariant cache hit.
[2024-06-01 07:09:54] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-06-01 07:09:54] [INFO ] Invariant cache hit.
[2024-06-01 07:09:57] [INFO ] Implicit Places using invariants and state equation in 2892 ms returned []
Implicit Place search using SMT with State Equation took 4206 ms to find 0 implicit places.
Running 2934 sub problems to find dead transitions.
[2024-06-01 07:09:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 2934/2934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 0/2934 constraints, Known Traps: 0/0 constraints]
After SMT, in 61554ms problems are : Problem set: 0 solved, 2934 unsolved
Search for dead transitions found 0 dead transitions in 61583ms
Finished structural reductions in LTL mode , in 1 iterations and 65897 ms. Remains : 1663/1663 places, 2935/2935 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 30692 steps (6 resets) in 590 ms. (51 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 238 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15 reset in 934 ms.
Product exploration explored 100000 steps with 15 reset in 888 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 2935/2935 transitions.
Graph (trivial) has 1488 edges and 1663 vertex of which 436 / 1663 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 260 rules applied. Total rules applied 261 place count 1263 transition count 2503
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 285 place count 1263 transition count 2491
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 285 place count 1263 transition count 2495
Deduced a syphon composed of 280 places in 9 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 293 place count 1263 transition count 2495
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 424 place count 1132 transition count 2026
Deduced a syphon composed of 204 places in 12 ms
Iterating global reduction 2 with 131 rules applied. Total rules applied 555 place count 1132 transition count 2026
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 559 place count 1132 transition count 2022
Performed 422 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 626 places in 1 ms
Iterating global reduction 3 with 422 rules applied. Total rules applied 981 place count 1132 transition count 2030
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 989 place count 1132 transition count 2022
Renaming transitions due to excessive name length > 1024 char.
Discarding 311 places :
Symmetric choice reduction at 4 with 311 rule applications. Total rules 1300 place count 821 transition count 1533
Deduced a syphon composed of 334 places in 1 ms
Iterating global reduction 4 with 311 rules applied. Total rules applied 1611 place count 821 transition count 1533
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1630 place count 821 transition count 1514
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1638 place count 813 transition count 1506
Deduced a syphon composed of 326 places in 1 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1646 place count 813 transition count 1506
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -181
Deduced a syphon composed of 353 places in 1 ms
Iterating global reduction 5 with 27 rules applied. Total rules applied 1673 place count 813 transition count 1687
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1689 place count 813 transition count 1671
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1728 place count 774 transition count 1529
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 6 with 39 rules applied. Total rules applied 1767 place count 774 transition count 1529
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1775 place count 774 transition count 1521
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1783 place count 766 transition count 1505
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1791 place count 766 transition count 1505
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 314 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1795 place count 766 transition count 1537
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1799 place count 762 transition count 1529
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1803 place count 762 transition count 1529
Deduced a syphon composed of 310 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 1839 place count 762 transition count 1493
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1854 place count 747 transition count 1463
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1869 place count 747 transition count 1463
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1884 place count 732 transition count 1292
Deduced a syphon composed of 310 places in 0 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1899 place count 732 transition count 1292
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1922 place count 732 transition count 1269
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1937 place count 717 transition count 1246
Deduced a syphon composed of 295 places in 0 ms
Iterating global reduction 8 with 15 rules applied. Total rules applied 1952 place count 717 transition count 1246
Deduced a syphon composed of 295 places in 1 ms
Applied a total of 1952 rules in 1501 ms. Remains 717 /1663 variables (removed 946) and now considering 1246/2935 (removed 1689) transitions.
[2024-06-01 07:11:05] [INFO ] Redundant transitions in 37 ms returned []
Running 1245 sub problems to find dead transitions.
[2024-06-01 07:11:05] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
// Phase 1: matrix 1222 rows 717 cols
[2024-06-01 07:11:05] [INFO ] Computed 132 invariants in 28 ms
[2024-06-01 07:11:05] [INFO ] State equation strengthened by 158 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/716 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
SMT process timed out in 32095ms, After SMT, problems are : Problem set: 0 solved, 1245 unsolved
Search for dead transitions found 0 dead transitions in 32109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 717/1663 places, 1246/2935 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33658 ms. Remains : 717/1663 places, 1246/2935 transitions.
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 2935/2935 transitions.
Applied a total of 0 rules in 108 ms. Remains 1663 /1663 variables (removed 0) and now considering 2935/2935 (removed 0) transitions.
// Phase 1: matrix 2935 rows 1663 cols
[2024-06-01 07:11:37] [INFO ] Computed 132 invariants in 15 ms
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants in 988 ms returned []
[2024-06-01 07:11:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:40] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
Running 2934 sub problems to find dead transitions.
[2024-06-01 07:11:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 2934/2934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 0/2934 constraints, Known Traps: 0/0 constraints]
After SMT, in 61518ms problems are : Problem set: 0 solved, 2934 unsolved
Search for dead transitions found 0 dead transitions in 61549ms
Finished structural reductions in LTL mode , in 1 iterations and 65077 ms. Remains : 1663/1663 places, 2935/2935 transitions.
Treatment of property DLCround-PT-07b-LTLFireability-07 finished in 240223 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((p0||G(((!p0 U (p2||G(!p0)))||p1)))))'
Support contains 5 out of 1692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1679 transition count 2953
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1679 transition count 2953
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1672 transition count 2946
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1672 transition count 2946
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1672 transition count 2944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 1669 transition count 2941
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 1669 transition count 2941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 1667 transition count 2939
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 1667 transition count 2939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 1665 transition count 2937
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 1665 transition count 2937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1664 transition count 2936
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1664 transition count 2936
Applied a total of 58 rules in 523 ms. Remains 1664 /1692 variables (removed 28) and now considering 2936/2976 (removed 40) transitions.
// Phase 1: matrix 2936 rows 1664 cols
[2024-06-01 07:12:43] [INFO ] Computed 132 invariants in 13 ms
[2024-06-01 07:12:44] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-06-01 07:12:44] [INFO ] Invariant cache hit.
[2024-06-01 07:12:47] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3779 ms to find 0 implicit places.
Running 2935 sub problems to find dead transitions.
[2024-06-01 07:12:47] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1663/4600 variables, and 0 constraints, problems are : Problem set: 0 solved, 2935 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1664 constraints, PredecessorRefiner: 2935/2935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2935 unsolved
(s173 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/4600 variables, and 0 constraints, problems are : Problem set: 0 solved, 2935 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1664 constraints, PredecessorRefiner: 0/2935 constraints, Known Traps: 0/0 constraints]
After SMT, in 61360ms problems are : Problem set: 0 solved, 2935 unsolved
Search for dead transitions found 0 dead transitions in 61407ms
Starting structural reductions in LTL mode, iteration 1 : 1664/1692 places, 2936/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65720 ms. Remains : 1664/1692 places, 2936/2976 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, false, false, (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 894 ms.
Product exploration explored 100000 steps with 0 reset in 910 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p1 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 166 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1008 ms. (39 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
[2024-06-01 07:13:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 256/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1403/1664 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1664 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2936/4600 variables, 1664/1796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4600 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/4600 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4600/4600 variables, and 1796 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2263 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1664/1664 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 256/261 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1403/1664 variables, 128/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1664 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2936/4600 variables, 1664/1796 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4600 variables, 3/1799 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4600 variables, 0/1799 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/4600 variables, 0/1799 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4600/4600 variables, and 1799 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2868 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1664/1664 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 5154ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 28443 steps, including 43 resets, run visited all 3 properties in 1286 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 1288 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p1 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p2 p1))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p1)))
Knowledge based reduction with 15 factoid took 304 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-07b-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-08 finished in 75628 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((p0||X(p1))))'
Support contains 2 out of 1692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1680 transition count 2954
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1680 transition count 2954
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1674 transition count 2948
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1674 transition count 2948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1674 transition count 2947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1671 transition count 2944
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1671 transition count 2944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1669 transition count 2942
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1669 transition count 2942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1667 transition count 2940
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1667 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1666 transition count 2939
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1666 transition count 2939
Applied a total of 53 rules in 981 ms. Remains 1666 /1692 variables (removed 26) and now considering 2939/2976 (removed 37) transitions.
// Phase 1: matrix 2939 rows 1666 cols
[2024-06-01 07:13:59] [INFO ] Computed 132 invariants in 12 ms
[2024-06-01 07:14:00] [INFO ] Implicit Places using invariants in 1068 ms returned []
[2024-06-01 07:14:00] [INFO ] Invariant cache hit.
[2024-06-01 07:14:03] [INFO ] Implicit Places using invariants and state equation in 3095 ms returned []
Implicit Place search using SMT with State Equation took 4169 ms to find 0 implicit places.
Running 2938 sub problems to find dead transitions.
[2024-06-01 07:14:03] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1665/4605 variables, and 0 constraints, problems are : Problem set: 0 solved, 2938 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 2938/2938 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2938 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1665/4605 variables, and 0 constraints, problems are : Problem set: 0 solved, 2938 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 0/2938 constraints, Known Traps: 0/0 constraints]
After SMT, in 61734ms problems are : Problem set: 0 solved, 2938 unsolved
Search for dead transitions found 0 dead transitions in 61785ms
Starting structural reductions in LTL mode, iteration 1 : 1666/1692 places, 2939/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66964 ms. Remains : 1666/1692 places, 2939/2976 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-10
Product exploration explored 100000 steps with 42 reset in 747 ms.
Product exploration explored 100000 steps with 34 reset in 592 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1313 ms. (30 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-06-01 07:15:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 128/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1536/1666 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2939/4605 variables, 1666/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4605 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4605 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4605/4605 variables, and 1798 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2081 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1666/1666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 128/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1536/1666 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2939/4605 variables, 1666/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4605 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4605 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4605 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4605/4605 variables, and 1799 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1666/1666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4077ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 465 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=155 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:15:12] [INFO ] Invariant cache hit.
[2024-06-01 07:15:15] [INFO ] [Real]Absence check using 132 positive place invariants in 326 ms returned sat
[2024-06-01 07:15:22] [INFO ] [Real]Absence check using state equation in 6812 ms returned sat
[2024-06-01 07:15:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:25] [INFO ] [Nat]Absence check using 132 positive place invariants in 227 ms returned sat
[2024-06-01 07:15:32] [INFO ] [Nat]Absence check using state equation in 7062 ms returned sat
[2024-06-01 07:15:32] [INFO ] Computed and/alt/rep : 2737/4647/2737 causal constraints (skipped 201 transitions) in 256 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:15:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1666/1666 places, 2939/2939 transitions.
Graph (trivial) has 1493 edges and 1666 vertex of which 436 / 1666 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 1265 transition count 2247
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 295 rules applied. Total rules applied 555 place count 1006 transition count 2211
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 579 place count 982 transition count 2211
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 579 place count 982 transition count 2079
Deduced a syphon composed of 132 places in 11 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 843 place count 850 transition count 2079
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 898 place count 795 transition count 1676
Iterating global reduction 3 with 55 rules applied. Total rules applied 953 place count 795 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 957 place count 795 transition count 1672
Performed 301 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 301 places in 0 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 4 with 602 rules applied. Total rules applied 1559 place count 494 transition count 1363
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1567 place count 494 transition count 1355
Renaming transitions due to excessive name length > 1024 char.
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1586 place count 475 transition count 1158
Iterating global reduction 5 with 19 rules applied. Total rules applied 1605 place count 475 transition count 1158
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1624 place count 475 transition count 1139
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1650 place count 462 transition count 1239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1654 place count 462 transition count 1235
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1658 place count 458 transition count 1167
Iterating global reduction 7 with 4 rules applied. Total rules applied 1662 place count 458 transition count 1167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1666 place count 458 transition count 1163
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1674 place count 454 transition count 1189
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 1708 place count 454 transition count 1155
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1724 place count 438 transition count 1123
Iterating global reduction 8 with 16 rules applied. Total rules applied 1740 place count 438 transition count 1123
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1756 place count 422 transition count 943
Iterating global reduction 8 with 16 rules applied. Total rules applied 1772 place count 422 transition count 943
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1788 place count 422 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1789 place count 421 transition count 926
Applied a total of 1789 rules in 335 ms. Remains 421 /1666 variables (removed 1245) and now considering 926/2939 (removed 2013) transitions.
[2024-06-01 07:15:38] [INFO ] Flow matrix only has 902 transitions (discarded 24 similar events)
// Phase 1: matrix 902 rows 421 cols
[2024-06-01 07:15:38] [INFO ] Computed 132 invariants in 3 ms
[2024-06-01 07:15:38] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 07:15:38] [INFO ] Flow matrix only has 902 transitions (discarded 24 similar events)
[2024-06-01 07:15:38] [INFO ] Invariant cache hit.
[2024-06-01 07:15:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:15:39] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-06-01 07:15:39] [INFO ] Redundant transitions in 29 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-01 07:15:39] [INFO ] Flow matrix only has 902 transitions (discarded 24 similar events)
[2024-06-01 07:15:39] [INFO ] Invariant cache hit.
[2024-06-01 07:15:39] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (OVERLAPS) 1/421 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1323 variables, and 132 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/421 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (OVERLAPS) 1/421 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 4 (OVERLAPS) 901/1322 variables, 421/553 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 45/598 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 861/1459 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1322/1323 variables, and 1459 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 421/421 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints]
After SMT, in 60743ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60755ms
Starting structural reductions in SI_LTL mode, iteration 1 : 421/1666 places, 926/2939 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62403 ms. Remains : 421/1666 places, 926/2939 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 12806 steps (2 resets) in 382 ms. (33 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:16:41] [INFO ] Flow matrix only has 902 transitions (discarded 24 similar events)
[2024-06-01 07:16:41] [INFO ] Invariant cache hit.
[2024-06-01 07:16:42] [INFO ] [Real]Absence check using 132 positive place invariants in 81 ms returned sat
[2024-06-01 07:16:43] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2024-06-01 07:16:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:16:43] [INFO ] [Nat]Absence check using 132 positive place invariants in 43 ms returned sat
[2024-06-01 07:16:44] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-06-01 07:16:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:16:44] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-06-01 07:16:44] [INFO ] Computed and/alt/rep : 550/1207/550 causal constraints (skipped 298 transitions) in 68 ms.
[2024-06-01 07:16:44] [INFO ] Added : 1 causal constraints over 1 iterations in 183 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-10 finished in 166093 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)&&(p1||G(F(p1))))))'
Support contains 4 out of 1692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Graph (trivial) has 1518 edges and 1692 vertex of which 443 / 1692 are part of one of the 36 SCC in 1 ms
Free SCC test removed 407 places
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 1284 transition count 2260
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 314 rules applied. Total rules applied 591 place count 1008 transition count 2222
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 615 place count 984 transition count 2222
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 615 place count 984 transition count 2091
Deduced a syphon composed of 131 places in 8 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 877 place count 853 transition count 2091
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 939 place count 791 transition count 1681
Iterating global reduction 3 with 62 rules applied. Total rules applied 1001 place count 791 transition count 1681
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1005 place count 791 transition count 1677
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1005 place count 791 transition count 1674
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1011 place count 788 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1012 place count 787 transition count 1663
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 787 transition count 1663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1014 place count 787 transition count 1662
Performed 297 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 297 places in 0 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 5 with 594 rules applied. Total rules applied 1608 place count 490 transition count 1357
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1616 place count 490 transition count 1349
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1634 place count 472 transition count 1163
Iterating global reduction 6 with 18 rules applied. Total rules applied 1652 place count 472 transition count 1163
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1670 place count 472 transition count 1145
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1694 place count 460 transition count 1237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1698 place count 460 transition count 1233
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1702 place count 456 transition count 1163
Iterating global reduction 8 with 4 rules applied. Total rules applied 1706 place count 456 transition count 1163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1710 place count 456 transition count 1159
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1718 place count 452 transition count 1184
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 9 with 32 rules applied. Total rules applied 1750 place count 452 transition count 1152
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1765 place count 437 transition count 1122
Iterating global reduction 9 with 15 rules applied. Total rules applied 1780 place count 437 transition count 1122
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1795 place count 422 transition count 956
Iterating global reduction 9 with 15 rules applied. Total rules applied 1810 place count 422 transition count 956
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1825 place count 422 transition count 941
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1826 place count 421 transition count 940
Applied a total of 1826 rules in 302 ms. Remains 421 /1692 variables (removed 1271) and now considering 940/2976 (removed 2036) transitions.
[2024-06-01 07:16:45] [INFO ] Flow matrix only has 915 transitions (discarded 25 similar events)
// Phase 1: matrix 915 rows 421 cols
[2024-06-01 07:16:45] [INFO ] Computed 132 invariants in 4 ms
[2024-06-01 07:16:45] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-06-01 07:16:45] [INFO ] Flow matrix only has 915 transitions (discarded 25 similar events)
[2024-06-01 07:16:45] [INFO ] Invariant cache hit.
[2024-06-01 07:16:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 07:16:46] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-06-01 07:16:46] [INFO ] Redundant transitions in 22 ms returned []
Running 874 sub problems to find dead transitions.
[2024-06-01 07:16:46] [INFO ] Flow matrix only has 915 transitions (discarded 25 similar events)
[2024-06-01 07:16:46] [INFO ] Invariant cache hit.
[2024-06-01 07:16:46] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (OVERLAPS) 1/421 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1336 variables, and 132 constraints, problems are : Problem set: 0 solved, 874 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/421 constraints, ReadFeed: 0/46 constraints, PredecessorRefiner: 874/874 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 874 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (OVERLAPS) 1/421 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 4 (OVERLAPS) 914/1335 variables, 421/553 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1335 variables, 46/599 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 874/1473 constraints. Problems are: Problem set: 0 solved, 874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1336 variables, and 1473 constraints, problems are : Problem set: 0 solved, 874 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 421/421 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 874/874 constraints, Known Traps: 0/0 constraints]
After SMT, in 60626ms problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 60636ms
Starting structural reductions in SI_LTL mode, iteration 1 : 421/1692 places, 940/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62289 ms. Remains : 421/1692 places, 940/2976 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-11 finished in 62577 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)||X(X(G(p1))))))'
Support contains 3 out of 1692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1681 transition count 2955
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1681 transition count 2955
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1676 transition count 2950
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1676 transition count 2950
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1676 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 1675 transition count 2947
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 1675 transition count 2947
Applied a total of 36 rules in 453 ms. Remains 1675 /1692 variables (removed 17) and now considering 2947/2976 (removed 29) transitions.
// Phase 1: matrix 2947 rows 1675 cols
[2024-06-01 07:17:47] [INFO ] Computed 132 invariants in 15 ms
[2024-06-01 07:17:48] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2024-06-01 07:17:48] [INFO ] Invariant cache hit.
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants and state equation in 2956 ms returned []
Implicit Place search using SMT with State Equation took 4165 ms to find 0 implicit places.
Running 2946 sub problems to find dead transitions.
[2024-06-01 07:17:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 2946/2946 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2946 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 0/2946 constraints, Known Traps: 0/0 constraints]
After SMT, in 61548ms problems are : Problem set: 0 solved, 2946 unsolved
Search for dead transitions found 0 dead transitions in 61596ms
Starting structural reductions in LTL mode, iteration 1 : 1675/1692 places, 2947/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66224 ms. Remains : 1675/1692 places, 2947/2976 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-12
Product exploration explored 100000 steps with 603 reset in 432 ms.
Product exploration explored 100000 steps with 598 reset in 395 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13608 steps (2 resets) in 161 ms. (84 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:18:55] [INFO ] Invariant cache hit.
[2024-06-01 07:18:58] [INFO ] [Real]Absence check using 132 positive place invariants in 200 ms returned sat
[2024-06-01 07:19:04] [INFO ] [Real]Absence check using state equation in 5913 ms returned sat
[2024-06-01 07:19:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:19:06] [INFO ] [Nat]Absence check using 132 positive place invariants in 210 ms returned sat
[2024-06-01 07:19:12] [INFO ] [Nat]Absence check using state equation in 6209 ms returned sat
[2024-06-01 07:19:12] [INFO ] Computed and/alt/rep : 2747/4648/2747 causal constraints (skipped 199 transitions) in 191 ms.
[2024-06-01 07:19:19] [INFO ] Added : 140 causal constraints over 28 iterations in 6535 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1675/1675 places, 2947/2947 transitions.
Applied a total of 0 rules in 108 ms. Remains 1675 /1675 variables (removed 0) and now considering 2947/2947 (removed 0) transitions.
[2024-06-01 07:19:19] [INFO ] Invariant cache hit.
[2024-06-01 07:19:20] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2024-06-01 07:19:20] [INFO ] Invariant cache hit.
[2024-06-01 07:19:23] [INFO ] Implicit Places using invariants and state equation in 2689 ms returned []
Implicit Place search using SMT with State Equation took 4051 ms to find 0 implicit places.
Running 2946 sub problems to find dead transitions.
[2024-06-01 07:19:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 2946/2946 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2946 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 0/2946 constraints, Known Traps: 0/0 constraints]
After SMT, in 61614ms problems are : Problem set: 0 solved, 2946 unsolved
Search for dead transitions found 0 dead transitions in 61659ms
Finished structural reductions in LTL mode , in 1 iterations and 65826 ms. Remains : 1675/1675 places, 2947/2947 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 16259 steps (2 resets) in 235 ms. (68 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:20:26] [INFO ] Invariant cache hit.
[2024-06-01 07:20:29] [INFO ] [Real]Absence check using 132 positive place invariants in 206 ms returned sat
[2024-06-01 07:20:35] [INFO ] [Real]Absence check using state equation in 6272 ms returned sat
[2024-06-01 07:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:20:38] [INFO ] [Nat]Absence check using 132 positive place invariants in 309 ms returned sat
[2024-06-01 07:20:45] [INFO ] [Nat]Absence check using state equation in 7542 ms returned sat
[2024-06-01 07:20:46] [INFO ] Computed and/alt/rep : 2747/4648/2747 causal constraints (skipped 199 transitions) in 291 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:20:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 604 reset in 314 ms.
Product exploration explored 100000 steps with 598 reset in 322 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1675/1675 places, 2947/2947 transitions.
Graph (trivial) has 1498 edges and 1675 vertex of which 408 / 1675 are part of one of the 38 SCC in 1 ms
Free SCC test removed 370 places
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 1305 transition count 2551
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 299 place count 1305 transition count 2539
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 299 place count 1305 transition count 2545
Deduced a syphon composed of 299 places in 9 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 312 place count 1305 transition count 2545
Discarding 136 places :
Symmetric choice reduction at 2 with 136 rule applications. Total rules 448 place count 1169 transition count 2081
Deduced a syphon composed of 213 places in 8 ms
Iterating global reduction 2 with 136 rules applied. Total rules applied 584 place count 1169 transition count 2081
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 588 place count 1169 transition count 2077
Performed 436 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 649 places in 1 ms
Iterating global reduction 3 with 436 rules applied. Total rules applied 1024 place count 1169 transition count 2083
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1032 place count 1169 transition count 2075
Renaming transitions due to excessive name length > 1024 char.
Discarding 323 places :
Symmetric choice reduction at 4 with 323 rule applications. Total rules 1355 place count 846 transition count 1584
Deduced a syphon composed of 344 places in 1 ms
Iterating global reduction 4 with 323 rules applied. Total rules applied 1678 place count 846 transition count 1584
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1694 place count 846 transition count 1568
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1702 place count 838 transition count 1560
Deduced a syphon composed of 336 places in 0 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1710 place count 838 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -211
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 5 with 30 rules applied. Total rules applied 1740 place count 838 transition count 1771
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1754 place count 838 transition count 1757
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 1797 place count 795 transition count 1621
Deduced a syphon composed of 326 places in 0 ms
Iterating global reduction 6 with 43 rules applied. Total rules applied 1840 place count 795 transition count 1621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1846 place count 795 transition count 1615
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1852 place count 789 transition count 1603
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1858 place count 789 transition count 1603
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1861 place count 789 transition count 1627
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1864 place count 786 transition count 1621
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1867 place count 786 transition count 1621
Deduced a syphon composed of 320 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 1900 place count 786 transition count 1588
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1912 place count 774 transition count 1564
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1924 place count 774 transition count 1564
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1936 place count 762 transition count 1426
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1948 place count 762 transition count 1426
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1966 place count 762 transition count 1408
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1978 place count 750 transition count 1390
Deduced a syphon composed of 308 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1990 place count 750 transition count 1390
Deduced a syphon composed of 308 places in 0 ms
Applied a total of 1990 rules in 803 ms. Remains 750 /1675 variables (removed 925) and now considering 1390/2947 (removed 1557) transitions.
[2024-06-01 07:20:52] [INFO ] Redundant transitions in 44 ms returned []
Running 1389 sub problems to find dead transitions.
[2024-06-01 07:20:52] [INFO ] Flow matrix only has 1353 transitions (discarded 37 similar events)
// Phase 1: matrix 1353 rows 750 cols
[2024-06-01 07:20:52] [INFO ] Computed 132 invariants in 25 ms
[2024-06-01 07:20:52] [INFO ] State equation strengthened by 158 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
SMT process timed out in 31603ms, After SMT, problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 31616ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/1675 places, 1390/2947 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32470 ms. Remains : 750/1675 places, 1390/2947 transitions.
Support contains 3 out of 1675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1675/1675 places, 2947/2947 transitions.
Applied a total of 0 rules in 107 ms. Remains 1675 /1675 variables (removed 0) and now considering 2947/2947 (removed 0) transitions.
// Phase 1: matrix 2947 rows 1675 cols
[2024-06-01 07:21:24] [INFO ] Computed 132 invariants in 12 ms
[2024-06-01 07:21:25] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2024-06-01 07:21:25] [INFO ] Invariant cache hit.
[2024-06-01 07:21:27] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
Running 2946 sub problems to find dead transitions.
[2024-06-01 07:21:27] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 2946/2946 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2946 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 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 0/2946 constraints, Known Traps: 0/0 constraints]
After SMT, in 61987ms problems are : Problem set: 0 solved, 2946 unsolved
Search for dead transitions found 0 dead transitions in 62015ms
Finished structural reductions in LTL mode , in 1 iterations and 65469 ms. Remains : 1675/1675 places, 2947/2947 transitions.
Treatment of property DLCround-PT-07b-LTLFireability-12 finished in 282693 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(G(p1)))))'
Support contains 3 out of 1692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Graph (trivial) has 1518 edges and 1692 vertex of which 443 / 1692 are part of one of the 36 SCC in 1 ms
Free SCC test removed 407 places
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 1284 transition count 2262
Reduce places removed 274 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 312 rules applied. Total rules applied 587 place count 1010 transition count 2224
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 611 place count 986 transition count 2224
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 611 place count 986 transition count 2093
Deduced a syphon composed of 131 places in 13 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 873 place count 855 transition count 2093
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 935 place count 793 transition count 1673
Iterating global reduction 3 with 62 rules applied. Total rules applied 997 place count 793 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1001 place count 793 transition count 1669
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1001 place count 793 transition count 1667
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1005 place count 791 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1006 place count 790 transition count 1656
Iterating global reduction 4 with 1 rules applied. Total rules applied 1007 place count 790 transition count 1656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1008 place count 790 transition count 1655
Performed 298 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 5 with 596 rules applied. Total rules applied 1604 place count 492 transition count 1349
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1612 place count 492 transition count 1341
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1630 place count 474 transition count 1155
Iterating global reduction 6 with 18 rules applied. Total rules applied 1648 place count 474 transition count 1155
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1666 place count 474 transition count 1137
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1692 place count 461 transition count 1234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1696 place count 461 transition count 1230
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1700 place count 457 transition count 1160
Iterating global reduction 8 with 4 rules applied. Total rules applied 1704 place count 457 transition count 1160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1708 place count 457 transition count 1156
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1716 place count 453 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 1752 place count 453 transition count 1146
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 1768 place count 437 transition count 1114
Iterating global reduction 9 with 16 rules applied. Total rules applied 1784 place count 437 transition count 1114
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 1800 place count 421 transition count 934
Iterating global reduction 9 with 16 rules applied. Total rules applied 1816 place count 421 transition count 934
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1832 place count 421 transition count 918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1833 place count 420 transition count 917
Applied a total of 1833 rules in 440 ms. Remains 420 /1692 variables (removed 1272) and now considering 917/2976 (removed 2059) transitions.
[2024-06-01 07:22:30] [INFO ] Flow matrix only has 892 transitions (discarded 25 similar events)
// Phase 1: matrix 892 rows 420 cols
[2024-06-01 07:22:30] [INFO ] Computed 132 invariants in 5 ms
[2024-06-01 07:22:31] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-06-01 07:22:31] [INFO ] Flow matrix only has 892 transitions (discarded 25 similar events)
[2024-06-01 07:22:31] [INFO ] Invariant cache hit.
[2024-06-01 07:22:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 07:22:32] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2024-06-01 07:22:32] [INFO ] Redundant transitions in 28 ms returned []
Running 852 sub problems to find dead transitions.
[2024-06-01 07:22:32] [INFO ] Flow matrix only has 892 transitions (discarded 25 similar events)
[2024-06-01 07:22:32] [INFO ] Invariant cache hit.
[2024-06-01 07:22:32] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/420 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1312 variables, and 132 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/420 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/420 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (OVERLAPS) 891/1311 variables, 420/552 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1311 variables, 48/600 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1311 variables, 852/1452 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1311/1312 variables, and 1452 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 420/420 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 0/0 constraints]
After SMT, in 60799ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 60813ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1692 places, 917/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63085 ms. Remains : 420/1692 places, 917/2976 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-13 finished in 63236 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((p0||X(F(p1)))))'
Support contains 2 out of 1692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1692/1692 places, 2976/2976 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1679 transition count 2953
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1679 transition count 2953
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 1673 transition count 2947
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 1673 transition count 2947
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 1673 transition count 2945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 1671 transition count 2943
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 1671 transition count 2943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 1669 transition count 2941
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 1669 transition count 2941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 1667 transition count 2939
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 1667 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1666 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1666 transition count 2938
Applied a total of 54 rules in 494 ms. Remains 1666 /1692 variables (removed 26) and now considering 2938/2976 (removed 38) transitions.
// Phase 1: matrix 2938 rows 1666 cols
[2024-06-01 07:23:33] [INFO ] Computed 132 invariants in 8 ms
[2024-06-01 07:23:34] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-06-01 07:23:34] [INFO ] Invariant cache hit.
[2024-06-01 07:23:36] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
Running 2937 sub problems to find dead transitions.
[2024-06-01 07:23:36] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1665/4604 variables, and 0 constraints, problems are : Problem set: 0 solved, 2937 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 2937/2937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2937 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1665/4604 variables, and 0 constraints, problems are : Problem set: 0 solved, 2937 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 0/2937 constraints, Known Traps: 0/0 constraints]
After SMT, in 61322ms problems are : Problem set: 0 solved, 2937 unsolved
Search for dead transitions found 0 dead transitions in 61350ms
Starting structural reductions in LTL mode, iteration 1 : 1666/1692 places, 2938/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65025 ms. Remains : 1666/1692 places, 2938/2976 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-15
Product exploration explored 100000 steps with 94 reset in 605 ms.
Product exploration explored 100000 steps with 102 reset in 445 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 34222 steps (7 resets) in 218 ms. (156 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:24:40] [INFO ] Invariant cache hit.
[2024-06-01 07:24:43] [INFO ] [Real]Absence check using 132 positive place invariants in 196 ms returned sat
[2024-06-01 07:24:49] [INFO ] [Real]Absence check using state equation in 6196 ms returned sat
[2024-06-01 07:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:24:52] [INFO ] [Nat]Absence check using 132 positive place invariants in 277 ms returned sat
[2024-06-01 07:24:59] [INFO ] [Nat]Absence check using state equation in 7376 ms returned sat
[2024-06-01 07:25:00] [INFO ] Computed and/alt/rep : 2737/4644/2737 causal constraints (skipped 200 transitions) in 305 ms.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1666/1666 places, 2938/2938 transitions.
Graph (trivial) has 1491 edges and 1666 vertex of which 436 / 1666 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 1265 transition count 2246
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 295 rules applied. Total rules applied 555 place count 1006 transition count 2210
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 579 place count 982 transition count 2210
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 579 place count 982 transition count 2077
Deduced a syphon composed of 133 places in 13 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 845 place count 849 transition count 2077
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 901 place count 793 transition count 1673
Iterating global reduction 3 with 56 rules applied. Total rules applied 957 place count 793 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 961 place count 793 transition count 1669
Performed 299 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 1559 place count 494 transition count 1362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1566 place count 494 transition count 1355
Renaming transitions due to excessive name length > 1024 char.
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1586 place count 474 transition count 1147
Iterating global reduction 5 with 20 rules applied. Total rules applied 1606 place count 474 transition count 1147
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1626 place count 474 transition count 1127
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1650 place count 462 transition count 1218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1654 place count 462 transition count 1214
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1658 place count 458 transition count 1146
Iterating global reduction 7 with 4 rules applied. Total rules applied 1662 place count 458 transition count 1146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1666 place count 458 transition count 1142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1674 place count 454 transition count 1168
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1706 place count 454 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1720 place count 440 transition count 1108
Iterating global reduction 8 with 14 rules applied. Total rules applied 1734 place count 440 transition count 1108
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1748 place count 426 transition count 950
Iterating global reduction 8 with 14 rules applied. Total rules applied 1762 place count 426 transition count 950
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1776 place count 426 transition count 936
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1777 place count 425 transition count 935
Applied a total of 1777 rules in 395 ms. Remains 425 /1666 variables (removed 1241) and now considering 935/2938 (removed 2003) transitions.
[2024-06-01 07:25:05] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
// Phase 1: matrix 909 rows 425 cols
[2024-06-01 07:25:05] [INFO ] Computed 132 invariants in 4 ms
[2024-06-01 07:25:05] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-01 07:25:05] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
[2024-06-01 07:25:05] [INFO ] Invariant cache hit.
[2024-06-01 07:25:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:25:06] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2024-06-01 07:25:06] [INFO ] Redundant transitions in 29 ms returned []
Running 870 sub problems to find dead transitions.
[2024-06-01 07:25:06] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
[2024-06-01 07:25:06] [INFO ] Invariant cache hit.
[2024-06-01 07:25:06] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 2 (OVERLAPS) 1/425 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 870 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1334 variables, and 132 constraints, problems are : Problem set: 0 solved, 870 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/425 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 870/870 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 2 (OVERLAPS) 1/425 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 4 (OVERLAPS) 908/1333 variables, 425/557 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1333 variables, 45/602 constraints. Problems are: Problem set: 0 solved, 870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1333/1334 variables, and 1472 constraints, problems are : Problem set: 0 solved, 870 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 425/425 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 870/870 constraints, Known Traps: 0/0 constraints]
After SMT, in 60783ms problems are : Problem set: 0 solved, 870 unsolved
Search for dead transitions found 0 dead transitions in 60797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1666 places, 935/2938 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62970 ms. Remains : 425/1666 places, 935/2938 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2000 steps (0 resets) in 55 ms. (35 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 655 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:26:09] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
[2024-06-01 07:26:09] [INFO ] Invariant cache hit.
[2024-06-01 07:26:10] [INFO ] [Real]Absence check using 132 positive place invariants in 55 ms returned sat
[2024-06-01 07:26:11] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-06-01 07:26:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:26:12] [INFO ] [Nat]Absence check using 132 positive place invariants in 62 ms returned sat
[2024-06-01 07:26:12] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-06-01 07:26:12] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:26:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-01 07:26:12] [INFO ] Computed and/alt/rep : 553/1242/553 causal constraints (skipped 302 transitions) in 105 ms.
[2024-06-01 07:26:12] [INFO ] Added : 4 causal constraints over 1 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 812 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-15 finished in 160464 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((X(X(G(p0)))||F(p1))))'
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)||X(X(G(p1))))))'
[2024-06-01 07:26:14] [INFO ] Flatten gal took : 159 ms
[2024-06-01 07:26:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 07:26:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1692 places, 2976 transitions and 8729 arcs took 42 ms.
Total runtime 1441509 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DLCround-PT-07b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-07b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717227333659

--------------------
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
mcc2024
ltl formula name DLCround-PT-07b-LTLFireability-07
ltl formula formula --ltl=/tmp/2371/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1692 places, 2976 transitions and 8729 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.120 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2371/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2371/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2371/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2371/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1694 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1693, there are 3013 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~470464 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~904048 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~1491120 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~2814416 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~5542048 transitions
pnml2lts-mc( 2/ 4): ~80000 levels ~320000 states ~11692272 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~17672640 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~31591376 transitions
pnml2lts-mc( 3/ 4): ~639974 levels ~2560000 states ~60571016 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 2623539
pnml2lts-mc( 0/ 4): unique transitions count: 78166850
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 5236986
pnml2lts-mc( 0/ 4): - claim success count: 2623549
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2623188
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2623549 states 78166907 transitions, fanout: 29.794
pnml2lts-mc( 0/ 4): Total exploration time 555.510 sec (555.170 sec minimum, 555.318 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4723, Transitions per second: 140712
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 278.6MB, 8.7 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/35.0%
pnml2lts-mc( 0/ 4): Stored 3033 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 278.6MB (~256.0MB paged-in)
ltl formula name DLCround-PT-07b-LTLFireability-12
ltl formula formula --ltl=/tmp/2371/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1692 places, 2976 transitions and 8729 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.120 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2371/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2371/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2371/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2371/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1694 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1693, there are 3001 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~46!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 170
pnml2lts-mc( 0/ 4): unique transitions count: 1424
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 180
pnml2lts-mc( 0/ 4): - cum. max stack depth: 180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 180 states 1449 transitions, fanout: 8.050
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3600, Transitions per second: 28980
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3033 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="DLCround-PT-07b"
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 DLCround-PT-07b, 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 r484-smll-171624275500188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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