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.r179-tall-171640601200292.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 greatspnxred
Input is FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716438626049

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:30:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 04:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:30:27] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2024-05-23 04:30:27] [INFO ] Transformed 2826 places.
[2024-05-23 04:30:27] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:30:27] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 43 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 309 place count 1319 transition count 3796
Iterating global reduction 1 with 292 rules applied. Total rules applied 601 place count 1319 transition count 3796
Ensure Unique test removed 430 transitions
Reduce isomorphic transitions removed 430 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 1031 place count 1319 transition count 3366
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 1180 place count 1170 transition count 3068
Iterating global reduction 2 with 149 rules applied. Total rules applied 1329 place count 1170 transition count 3068
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1425 place count 1170 transition count 2972
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1439 place count 1156 transition count 2944
Iterating global reduction 3 with 14 rules applied. Total rules applied 1453 place count 1156 transition count 2944
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1466 place count 1143 transition count 2918
Iterating global reduction 3 with 13 rules applied. Total rules applied 1479 place count 1143 transition count 2918
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1492 place count 1130 transition count 2892
Iterating global reduction 3 with 13 rules applied. Total rules applied 1505 place count 1130 transition count 2892
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1518 place count 1117 transition count 2866
Iterating global reduction 3 with 13 rules applied. Total rules applied 1531 place count 1117 transition count 2866
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1544 place count 1104 transition count 2840
Iterating global reduction 3 with 13 rules applied. Total rules applied 1557 place count 1104 transition count 2840
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1570 place count 1091 transition count 2814
Iterating global reduction 3 with 13 rules applied. Total rules applied 1583 place count 1091 transition count 2814
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1595 place count 1079 transition count 2790
Iterating global reduction 3 with 12 rules applied. Total rules applied 1607 place count 1079 transition count 2790
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1659 place count 1027 transition count 2592
Iterating global reduction 3 with 52 rules applied. Total rules applied 1711 place count 1027 transition count 2592
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1763 place count 975 transition count 2384
Iterating global reduction 3 with 52 rules applied. Total rules applied 1815 place count 975 transition count 2384
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1867 place count 923 transition count 2270
Iterating global reduction 3 with 52 rules applied. Total rules applied 1919 place count 923 transition count 2270
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1971 place count 871 transition count 2166
Iterating global reduction 3 with 52 rules applied. Total rules applied 2023 place count 871 transition count 2166
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2075 place count 819 transition count 2062
Iterating global reduction 3 with 52 rules applied. Total rules applied 2127 place count 819 transition count 2062
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2179 place count 767 transition count 1958
Iterating global reduction 3 with 52 rules applied. Total rules applied 2231 place count 767 transition count 1958
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2282 place count 716 transition count 1856
Iterating global reduction 3 with 51 rules applied. Total rules applied 2333 place count 716 transition count 1856
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2338 place count 711 transition count 1846
Iterating global reduction 3 with 5 rules applied. Total rules applied 2343 place count 711 transition count 1846
Applied a total of 2343 rules in 1315 ms. Remains 711 /1628 variables (removed 917) and now considering 1846/5962 (removed 4116) transitions.
[2024-05-23 04:30:29] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
// Phase 1: matrix 1235 rows 711 cols
[2024-05-23 04:30:29] [INFO ] Computed 2 invariants in 36 ms
[2024-05-23 04:30:30] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-23 04:30:30] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-23 04:30:30] [INFO ] Invariant cache hit.
[2024-05-23 04:30:30] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-23 04:30:31] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
Running 1844 sub problems to find dead transitions.
[2024-05-23 04:30:31] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-23 04:30:31] [INFO ] Invariant cache hit.
[2024-05-23 04:30:31] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 25.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.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 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.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 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.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 0.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 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/1946 variables, and 2 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/711 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 1844/1844 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1844 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/711 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 3 (OVERLAPS) 1235/1946 variables, 711/713 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1946 variables, 298/1011 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1946/1946 variables, and 2855 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 31970 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 711/711 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 1844/1844 constraints, Known Traps: 0/0 constraints]
After SMT, in 70856ms problems are : Problem set: 0 solved, 1844 unsolved
Search for dead transitions found 0 dead transitions in 70888ms
Starting structural reductions in LTL mode, iteration 1 : 711/1628 places, 1846/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74733 ms. Remains : 711/1628 places, 1846/5962 transitions.
Support contains 21 out of 711 places after structural reductions.
[2024-05-23 04:31:43] [INFO ] Flatten gal took : 232 ms
[2024-05-23 04:31:43] [INFO ] Flatten gal took : 121 ms
[2024-05-23 04:31:43] [INFO ] Input system was already deterministic with 1846 transitions.
RANDOM walk for 40001 steps (8 resets) in 2893 ms. (13 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
[2024-05-23 04:31:44] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-23 04:31:44] [INFO ] Invariant cache hit.
[2024-05-23 04:31:44] [INFO ] State equation strengthened by 298 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 380/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 939/1337 variables, 398/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 218/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 505/1842 variables, 217/834 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1842 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1842 variables, 80/915 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1842 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 99/1941 variables, 93/1008 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1941 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 4/1945 variables, 2/1010 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1945 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 1/1946 variables, 1/1011 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/1946 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1946/1946 variables, and 1011 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 711/711 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 380/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 939/1337 variables, 398/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 218/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 505/1842 variables, 217/834 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1842 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1842 variables, 80/915 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1842 variables, 17/932 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 04:31:50] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 27 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1842 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1842 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 99/1941 variables, 93/1026 constraints. Problems are: Problem set: 0 solved, 17 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 1941/1946 variables, and 1026 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 708/711 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
After SMT, in 8444ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 710 transition count 1844
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 710 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 709 transition count 1842
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 709 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 708 transition count 1840
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 708 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 707 transition count 1838
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 707 transition count 1838
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 706 transition count 1836
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 706 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 705 transition count 1834
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 705 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 704 transition count 1832
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 704 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 703 transition count 1828
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 703 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 702 transition count 1824
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 702 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 701 transition count 1822
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 701 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 700 transition count 1820
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 700 transition count 1820
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 699 transition count 1818
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 699 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 698 transition count 1816
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 698 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 697 transition count 1814
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 697 transition count 1814
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 50 place count 697 transition count 1792
Applied a total of 50 rules in 895 ms. Remains 697 /711 variables (removed 14) and now considering 1792/1846 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 895 ms. Remains : 697/711 places, 1792/1846 transitions.
RANDOM walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 151202 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :1 out of 16
Probabilistic random walk after 151202 steps, saw 98162 distinct states, run finished after 3011 ms. (steps per millisecond=50 ) properties seen :1
[2024-05-23 04:31:57] [INFO ] Flow matrix only has 1203 transitions (discarded 589 similar events)
// Phase 1: matrix 1203 rows 697 cols
[2024-05-23 04:31:57] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 04:31:57] [INFO ] State equation strengthened by 294 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 380/396 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 928/1324 variables, 396/397 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1324 variables, 216/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 476/1800 variables, 207/820 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1800 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1800 variables, 78/899 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1800 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 98/1898 variables, 92/991 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1898 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 2/1900 variables, 2/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1900 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/1900 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1900/1900 variables, and 993 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2685 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 697/697 constraints, ReadFeed: 294/294 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 380/396 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 928/1324 variables, 396/397 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1324 variables, 216/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 476/1800 variables, 207/820 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1800 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1800 variables, 78/899 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1800 variables, 15/914 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 04:32:02] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1800 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1800 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 98/1898 variables, 92/1007 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1898 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 2/1900 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1900 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/1900 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1900/1900 variables, and 1009 constraints, problems are : Problem set: 0 solved, 15 unsolved in 8329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 697/697 constraints, ReadFeed: 294/294 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 11201ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 16 out of 697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1792/1792 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 695 transition count 1788
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 695 transition count 1788
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 693 transition count 1782
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 693 transition count 1782
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 691 transition count 1776
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 691 transition count 1776
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 689 transition count 1772
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 689 transition count 1772
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 687 transition count 1768
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 687 transition count 1768
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 685 transition count 1764
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 685 transition count 1764
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 683 transition count 1760
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 683 transition count 1760
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 681 transition count 1756
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 681 transition count 1756
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 680 transition count 1754
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 680 transition count 1754
Applied a total of 34 rules in 237 ms. Remains 680 /697 variables (removed 17) and now considering 1754/1792 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 680/697 places, 1754/1792 transitions.
RANDOM walk for 40006 steps (8 resets) in 302 ms. (132 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
[2024-05-23 04:32:09] [INFO ] Flow matrix only has 1176 transitions (discarded 578 similar events)
// Phase 1: matrix 1176 rows 680 cols
[2024-05-23 04:32:09] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 04:32:09] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 811/1201 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 74/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 537/1738 variables, 192/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1738 variables, 214/871 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1738 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1739 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1739 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1739 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 112/1851 variables, 92/965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 5/1856 variables, 5/970 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1856 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1856 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1856/1856 variables, and 970 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 680/680 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 811/1201 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 74/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 537/1738 variables, 192/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1738 variables, 214/871 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1738 variables, 7/878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1738 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/1739 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1739 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 04:32:12] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1739 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1739 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 112/1851 variables, 92/973 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1851 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 5/1856 variables, 5/978 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1856 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1856 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1856/1856 variables, and 978 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 680/680 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 6348ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 1476 ms.
Support contains 4 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 1754/1754 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 673 transition count 1738
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 673 transition count 1738
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 673 transition count 1734
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 666 transition count 1720
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 666 transition count 1720
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 661 transition count 1704
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 661 transition count 1704
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 656 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 656 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 651 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 651 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 646 transition count 1672
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 646 transition count 1672
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 641 transition count 1662
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 641 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 637 transition count 1654
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 637 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 633 transition count 1646
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 633 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 632 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 632 transition count 1644
Applied a total of 100 rules in 221 ms. Remains 632 /680 variables (removed 48) and now considering 1644/1754 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 632/680 places, 1644/1754 transitions.
RANDOM walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 316238 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 3
Probabilistic random walk after 316238 steps, saw 205270 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-05-23 04:32:20] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2024-05-23 04:32:20] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:32:20] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 3 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 148/1729 variables, 141/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:32:22] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1729 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1731 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1731 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1731 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 909 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3180ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 922 ms.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 97 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 632/632 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 76 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2024-05-23 04:32:24] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 04:32:24] [INFO ] Invariant cache hit.
[2024-05-23 04:32:25] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-23 04:32:25] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 04:32:25] [INFO ] Invariant cache hit.
[2024-05-23 04:32:25] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:32:26] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
[2024-05-23 04:32:27] [INFO ] Redundant transitions in 91 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-23 04:32:27] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 04:32:27] [INFO ] Invariant cache hit.
[2024-05-23 04:32:27] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/632 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 3 (OVERLAPS) 1099/1731 variables, 632/634 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1731 variables, 271/905 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 2547 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 31595 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
After SMT, in 69133ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 69149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71606 ms. Remains : 632/632 places, 1644/1644 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c008-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 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' '!(X(X(F(p0))))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 698 transition count 1818
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 698 transition count 1818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 698 transition count 1814
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 685 transition count 1784
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 685 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 674 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 674 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 663 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 663 transition count 1708
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 652 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 652 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 641 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 641 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 630 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 630 transition count 1640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 620 transition count 1618
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 620 transition count 1618
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 611 transition count 1598
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 place count 605 transition count 1586
Applied a total of 216 rules in 304 ms. Remains 605 /711 variables (removed 106) and now considering 1586/1846 (removed 260) transitions.
[2024-05-23 04:33:36] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 04:33:36] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:33:37] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 04:33:37] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 04:33:37] [INFO ] Invariant cache hit.
[2024-05-23 04:33:37] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:33:38] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 04:33:38] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 04:33:38] [INFO ] Invariant cache hit.
[2024-05-23 04:33:38] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1663 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 2453 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 31299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 68214ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 68227ms
Starting structural reductions in LTL mode, iteration 1 : 605/711 places, 1586/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70615 ms. Remains : 605/711 places, 1586/1846 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 604 ms.
Product exploration explored 100000 steps with 33333 reset in 513 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLFireability-00 finished in 72092 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 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 698 transition count 1818
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 698 transition count 1818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 698 transition count 1814
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 685 transition count 1784
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 685 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 674 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 674 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 663 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 663 transition count 1708
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 652 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 652 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 641 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 641 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 630 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 630 transition count 1640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 620 transition count 1618
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 620 transition count 1618
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 611 transition count 1598
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 218 place count 605 transition count 1584
Applied a total of 218 rules in 502 ms. Remains 605 /711 variables (removed 106) and now considering 1584/1846 (removed 262) transitions.
[2024-05-23 04:34:49] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 04:34:49] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:34:49] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-23 04:34:49] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:34:49] [INFO ] Invariant cache hit.
[2024-05-23 04:34:49] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:34:51] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2024-05-23 04:34:51] [INFO ] Redundant transitions in 84 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:34:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:34:51] [INFO ] Invariant cache hit.
[2024-05-23 04:34:51] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 69414ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 69432ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/711 places, 1584/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72442 ms. Remains : 605/711 places, 1584/1846 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-01
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 72516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Applied a total of 198 rules in 213 ms. Remains 614 /711 variables (removed 97) and now considering 1608/1846 (removed 238) transitions.
[2024-05-23 04:36:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 04:36:01] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:36:01] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-23 04:36:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:36:01] [INFO ] Invariant cache hit.
[2024-05-23 04:36:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:36:03] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 04:36:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:36:03] [INFO ] Invariant cache hit.
[2024-05-23 04:36:03] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68556ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68568ms
Starting structural reductions in LTL mode, iteration 1 : 614/711 places, 1608/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70840 ms. Remains : 614/711 places, 1608/1846 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 544 ms.
Stack based approach found an accepted trace after 3178 steps with 0 reset with depth 3179 and stack size 3179 in 16 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-05 finished in 71521 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(F((X(F(p1))&&p0)))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1790
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1790
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 179 place count 619 transition count 1618
Iterating global reduction 1 with 9 rules applied. Total rules applied 188 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 617 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Applied a total of 200 rules in 220 ms. Remains 613 /711 variables (removed 98) and now considering 1606/1846 (removed 240) transitions.
[2024-05-23 04:37:12] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 04:37:12] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 04:37:13] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 04:37:13] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:37:13] [INFO ] Invariant cache hit.
[2024-05-23 04:37:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:37:14] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 04:37:14] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:37:14] [INFO ] Invariant cache hit.
[2024-05-23 04:37:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 70278ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 70294ms
Starting structural reductions in LTL mode, iteration 1 : 613/711 places, 1606/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72234 ms. Remains : 613/711 places, 1606/1846 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 441 ms.
Stack based approach found an accepted trace after 917 steps with 0 reset with depth 918 and stack size 918 in 6 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-07 finished in 72896 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((X(F(p1))||p0))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 614 transition count 1604
Applied a total of 202 rules in 395 ms. Remains 614 /711 variables (removed 97) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 04:38:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 04:38:25] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:38:26] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-23 04:38:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:38:26] [INFO ] Invariant cache hit.
[2024-05-23 04:38:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:38:27] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2024-05-23 04:38:28] [INFO ] Redundant transitions in 33 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:38:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:38:28] [INFO ] Invariant cache hit.
[2024-05-23 04:38:28] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 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 Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31424 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69126ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/711 places, 1604/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71672 ms. Remains : 614/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 0 reset in 466 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2024-05-23 04:39:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:39:38] [INFO ] Invariant cache hit.
[2024-05-23 04:39:38] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:39:40] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 347 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 614/614 places, 1604/1604 transitions.
RANDOM walk for 40008 steps (8 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 299974 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 299974 steps, saw 194715 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-23 04:39:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:39:44] [INFO ] Invariant cache hit.
[2024-05-23 04:39:44] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:39:46] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 317 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 68 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 69 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:39:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:39:47] [INFO ] Invariant cache hit.
[2024-05-23 04:39:47] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 04:39:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:39:47] [INFO ] Invariant cache hit.
[2024-05-23 04:39:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:39:49] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2024-05-23 04:39:49] [INFO ] Redundant transitions in 31 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:39:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:39:49] [INFO ] Invariant cache hit.
[2024-05-23 04:39:49] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.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 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.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 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.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 0.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 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.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 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.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 0.0)
(s551 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69107ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71242 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 90 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-23 04:40:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:40:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:40:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:40:58] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 04:40:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:40:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:40:58] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 04:40:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:40:58] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 04:40:58] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 04:40:58] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 221 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 86 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:40:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 04:40:59] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:40:59] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 04:40:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:40:59] [INFO ] Invariant cache hit.
[2024-05-23 04:40:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:41:01] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
[2024-05-23 04:41:01] [INFO ] Redundant transitions in 28 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:41:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:41:01] [INFO ] Invariant cache hit.
[2024-05-23 04:41:01] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69075ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71232 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40009 steps (8 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/4 properties
[2024-05-23 04:42:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:42:10] [INFO ] Invariant cache hit.
[2024-05-23 04:42:10] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:42:12] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2442ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 259 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 83 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 614/614 places, 1604/1604 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 301733 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 301733 steps, saw 195855 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-23 04:42:16] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:42:16] [INFO ] Invariant cache hit.
[2024-05-23 04:42:16] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:42:18] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2515ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 320 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:42:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:42:19] [INFO ] Invariant cache hit.
[2024-05-23 04:42:20] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 04:42:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:42:20] [INFO ] Invariant cache hit.
[2024-05-23 04:42:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:42:21] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
[2024-05-23 04:42:21] [INFO ] Redundant transitions in 28 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:42:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:42:21] [INFO ] Invariant cache hit.
[2024-05-23 04:42:21] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69085ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71235 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 8 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 56 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-23 04:43:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 04:43:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:43:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:43:31] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 04:43:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:43:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:43:31] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 04:43:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:43:31] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 04:43:31] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 04:43:31] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 229 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 495 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 101 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:43:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 04:43:32] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 04:43:33] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-23 04:43:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:43:33] [INFO ] Invariant cache hit.
[2024-05-23 04:43:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:43:34] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
[2024-05-23 04:43:34] [INFO ] Redundant transitions in 25 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:43:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:43:34] [INFO ] Invariant cache hit.
[2024-05-23 04:43:34] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31592 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69691ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69707ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72056 ms. Remains : 614/614 places, 1604/1604 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 379332 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)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 614 transition count 1604
Applied a total of 202 rules in 536 ms. Remains 614 /711 variables (removed 97) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 04:44:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 04:44:45] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 04:44:45] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-23 04:44:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:44:45] [INFO ] Invariant cache hit.
[2024-05-23 04:44:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:44:47] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2024-05-23 04:44:47] [INFO ] Redundant transitions in 26 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:44:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:44:47] [INFO ] Invariant cache hit.
[2024-05-23 04:44:47] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69415ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69431ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/711 places, 1604/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72097 ms. Remains : 614/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 393 ms.
Stack based approach found an accepted trace after 475 steps with 0 reset with depth 476 and stack size 476 in 3 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-10 finished in 72648 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((G(p0)||X(F(p1))))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 700 transition count 1822
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 700 transition count 1822
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 689 transition count 1796
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 689 transition count 1796
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 679 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 679 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 669 transition count 1726
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 669 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 659 transition count 1706
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 659 transition count 1706
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 649 transition count 1686
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 649 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 639 transition count 1666
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 639 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 630 transition count 1646
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 630 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 622 transition count 1628
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 621 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 620 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 620 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 619 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 618 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 618 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 617 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 617 transition count 1618
Applied a total of 188 rules in 243 ms. Remains 617 /711 variables (removed 94) and now considering 1618/1846 (removed 228) transitions.
[2024-05-23 04:45:57] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 617 cols
[2024-05-23 04:45:57] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:45:58] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-23 04:45:58] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:45:58] [INFO ] Invariant cache hit.
[2024-05-23 04:45:58] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:45:59] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 04:45:59] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:45:59] [INFO ] Invariant cache hit.
[2024-05-23 04:45:59] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1697 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1697 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69398ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69414ms
Starting structural reductions in LTL mode, iteration 1 : 617/711 places, 1618/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71728 ms. Remains : 617/711 places, 1618/1846 transitions.
Stuttering acceptance computed with spot in 163 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 : FunctionPointer-PT-c008-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 515 ms.
Product exploration explored 100000 steps with 25000 reset in 493 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 526978 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 526978 steps, saw 342271 distinct states, run finished after 3003 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 04:47:13] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:47:13] [INFO ] Invariant cache hit.
[2024-05-23 04:47:13] [INFO ] State equation strengthened by 267 read => feed constraints.
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) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1410 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1410 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1411 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 269/1680 variables, 199/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1680 variables, 64/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1692 variables, 5/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1692 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1697 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1697/1697 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 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) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1348 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1410 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1411 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 269/1680 variables, 199/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 64/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1692 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1692 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1697 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 425 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.5 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 425 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 424 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 424 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 423 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 423 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 422 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 422 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 421 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 421 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 419 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 419 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 400 place count 418 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 418 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 417 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 417 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 416 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 416 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 415 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 415 transition count 1208
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 409 place count 415 transition count 1206
Applied a total of 409 rules in 190 ms. Remains 415 /617 variables (removed 202) and now considering 1206/1618 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 415/617 places, 1206/1618 transitions.
RANDOM walk for 33800 steps (7 resets) in 193 ms. (174 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 617 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Applied a total of 0 rules in 14 ms. Remains 617 /617 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-23 04:47:15] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:47:15] [INFO ] Invariant cache hit.
[2024-05-23 04:47:16] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 04:47:16] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:47:16] [INFO ] Invariant cache hit.
[2024-05-23 04:47:16] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:47:17] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 04:47:17] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:47:17] [INFO ] Invariant cache hit.
[2024-05-23 04:47:17] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1697 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1697 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 70144ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 70163ms
Finished structural reductions in LTL mode , in 1 iterations and 72081 ms. Remains : 617/617 places, 1618/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 517365 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 517365 steps, saw 336031 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-23 04:48:31] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:48:31] [INFO ] Invariant cache hit.
[2024-05-23 04:48:31] [INFO ] State equation strengthened by 267 read => feed constraints.
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) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1410 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1410 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1411 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 269/1680 variables, 199/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1680 variables, 64/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1692 variables, 5/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1692 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1697 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1697/1697 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 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) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1348 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1410 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1411 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 269/1680 variables, 199/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 64/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1692 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1692 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1697 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 425 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 425 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 424 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 424 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 423 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 423 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 422 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 422 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 421 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 421 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 419 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 419 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 400 place count 418 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 418 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 417 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 417 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 416 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 416 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 415 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 415 transition count 1208
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 409 place count 415 transition count 1206
Applied a total of 409 rules in 184 ms. Remains 415 /617 variables (removed 202) and now considering 1206/1618 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 415/617 places, 1206/1618 transitions.
RANDOM walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24771 steps (5 resets) in 40 ms. (604 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 548 ms.
Product exploration explored 100000 steps with 25000 reset in 506 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 616 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 616 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 614 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 614 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 607 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 607 transition count 1590
Applied a total of 24 rules in 427 ms. Remains 607 /617 variables (removed 10) and now considering 1590/1618 (removed 28) transitions.
[2024-05-23 04:48:35] [INFO ] Redundant transitions in 27 ms returned []
Running 1588 sub problems to find dead transitions.
[2024-05-23 04:48:35] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2024-05-23 04:48:35] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:48:35] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 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 Real declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 3 (OVERLAPS) 1062/1669 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1669 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1669/1669 variables, and 2461 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 31508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
After SMT, in 69373ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 69387ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/617 places, 1590/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69852 ms. Remains : 607/617 places, 1590/1618 transitions.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 616 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 616 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 614 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 614 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 607 transition count 1592
Applied a total of 22 rules in 141 ms. Remains 607 /617 variables (removed 10) and now considering 1592/1618 (removed 26) transitions.
[2024-05-23 04:49:45] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-23 04:49:45] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:49:45] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-23 04:49:45] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 04:49:45] [INFO ] Invariant cache hit.
[2024-05-23 04:49:45] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 04:49:47] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 04:49:47] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 04:49:47] [INFO ] Invariant cache hit.
[2024-05-23 04:49:47] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1670 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 2463 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 31626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 69292ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 69310ms
Starting structural reductions in LTL mode, iteration 1 : 607/617 places, 1592/1618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71400 ms. Remains : 607/617 places, 1592/1618 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-11 finished in 299019 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) U (G(p1)||G(F(p2))||G(p0))))'
Support contains 5 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 701 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 701 transition count 1824
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 701 transition count 1820
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 691 transition count 1796
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 691 transition count 1796
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 683 transition count 1770
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 683 transition count 1770
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 675 transition count 1744
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 675 transition count 1744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 667 transition count 1726
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 667 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 659 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 651 transition count 1694
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 651 transition count 1694
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 644 transition count 1678
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 644 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 144 place count 638 transition count 1664
Iterating global reduction 1 with 6 rules applied. Total rules applied 150 place count 638 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 636 transition count 1660
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 636 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 635 transition count 1658
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 635 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 634 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 633 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 632 transition count 1652
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 632 transition count 1644
Applied a total of 170 rules in 429 ms. Remains 632 /711 variables (removed 79) and now considering 1644/1846 (removed 202) transitions.
[2024-05-23 04:50:56] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2024-05-23 04:50:56] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 04:50:57] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-23 04:50:57] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 04:50:57] [INFO ] Invariant cache hit.
[2024-05-23 04:50:57] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:50:59] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2024-05-23 04:50:59] [INFO ] Redundant transitions in 31 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-23 04:50:59] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 04:50:59] [INFO ] Invariant cache hit.
[2024-05-23 04:50:59] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/632 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 3 (OVERLAPS) 1099/1731 variables, 632/634 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1731 variables, 271/905 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 2547 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 31561 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
After SMT, in 69528ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 69542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 632/711 places, 1644/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72128 ms. Remains : 632/711 places, 1644/1846 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-12
Product exploration explored 100000 steps with 3 reset in 451 ms.
Stack based approach found an accepted trace after 207 steps with 0 reset with depth 208 and stack size 208 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-12 finished in 72778 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||G(p1)))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 700 transition count 1822
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 700 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 700 transition count 1818
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 689 transition count 1792
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 689 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 680 transition count 1760
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 680 transition count 1760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 75 place count 671 transition count 1728
Iterating global reduction 1 with 9 rules applied. Total rules applied 84 place count 671 transition count 1728
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 93 place count 662 transition count 1708
Iterating global reduction 1 with 9 rules applied. Total rules applied 102 place count 662 transition count 1708
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 653 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 653 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 129 place count 644 transition count 1672
Iterating global reduction 1 with 9 rules applied. Total rules applied 138 place count 644 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 146 place count 636 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 154 place count 636 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 161 place count 629 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 168 place count 629 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 628 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 628 transition count 1640
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 176 place count 628 transition count 1634
Applied a total of 176 rules in 343 ms. Remains 628 /711 variables (removed 83) and now considering 1634/1846 (removed 212) transitions.
[2024-05-23 04:52:09] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-23 04:52:09] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:52:09] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-23 04:52:09] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:52:09] [INFO ] Invariant cache hit.
[2024-05-23 04:52:10] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 04:52:11] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2024-05-23 04:52:11] [INFO ] Redundant transitions in 34 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 04:52:11] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:52:11] [INFO ] Invariant cache hit.
[2024-05-23 04:52:11] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31516 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 70027ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 70044ms
Starting structural reductions in SI_LTL mode, iteration 1 : 628/711 places, 1634/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72381 ms. Remains : 628/711 places, 1634/1846 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 522 ms.
Product exploration explored 100000 steps with 0 reset in 620 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40010 steps (8 resets) in 332 ms. (120 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2024-05-23 04:53:23] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:53:23] [INFO ] Invariant cache hit.
[2024-05-23 04:53:23] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:53:24] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2375ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 200 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 84 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 628/628 places, 1634/1634 transitions.
RANDOM walk for 40000 steps (8 resets) in 458 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 267134 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 267134 steps, saw 173401 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-23 04:53:29] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:53:29] [INFO ] Invariant cache hit.
[2024-05-23 04:53:29] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:53:30] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2455ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 184 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 78 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 80 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 04:53:32] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:53:32] [INFO ] Invariant cache hit.
[2024-05-23 04:53:32] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 04:53:32] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:53:32] [INFO ] Invariant cache hit.
[2024-05-23 04:53:32] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 04:53:33] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2024-05-23 04:53:34] [INFO ] Redundant transitions in 34 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 04:53:34] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:53:34] [INFO ] Invariant cache hit.
[2024-05-23 04:53:34] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69779ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71839 ms. Remains : 628/628 places, 1634/1634 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 46 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2024-05-23 04:54:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 04:54:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:54:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:54:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 04:54:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:54:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:54:43] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 04:54:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:54:43] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 04:54:43] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 04:54:44] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 102 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 04:54:44] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-23 04:54:44] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:54:44] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-23 04:54:44] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:54:44] [INFO ] Invariant cache hit.
[2024-05-23 04:54:45] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 04:54:46] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-05-23 04:54:46] [INFO ] Redundant transitions in 31 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 04:54:46] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:54:46] [INFO ] Invariant cache hit.
[2024-05-23 04:54:46] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69639ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69652ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71715 ms. Remains : 628/628 places, 1634/1634 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40002 steps (8 resets) in 911 ms. (43 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2024-05-23 04:55:56] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:55:56] [INFO ] Invariant cache hit.
[2024-05-23 04:55:56] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:55:58] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2897ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 76 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 628/628 places, 1634/1634 transitions.
RANDOM walk for 40003 steps (8 resets) in 420 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 259506 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 259506 steps, saw 168451 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-23 04:56:03] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:56:03] [INFO ] Invariant cache hit.
[2024-05-23 04:56:03] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 04:56:04] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2455ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 205 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 75 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 76 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 04:56:05] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:56:05] [INFO ] Invariant cache hit.
[2024-05-23 04:56:06] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 04:56:06] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:56:06] [INFO ] Invariant cache hit.
[2024-05-23 04:56:06] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 04:56:07] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
[2024-05-23 04:56:07] [INFO ] Redundant transitions in 32 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 04:56:07] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:56:07] [INFO ] Invariant cache hit.
[2024-05-23 04:56:07] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69398ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71398 ms. Remains : 628/628 places, 1634/1634 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 33 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2024-05-23 04:57:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:57:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:57:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:57:17] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 04:57:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:57:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:57:17] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 04:57:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:57:17] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 04:57:17] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 04:57:17] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 437 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 92 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 04:57:18] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-23 04:57:18] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:57:19] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-23 04:57:19] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:57:19] [INFO ] Invariant cache hit.
[2024-05-23 04:57:19] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 04:57:20] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2024-05-23 04:57:20] [INFO ] Redundant transitions in 27 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 04:57:20] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 04:57:20] [INFO ] Invariant cache hit.
[2024-05-23 04:57:20] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31746 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 70154ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 70169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72174 ms. Remains : 628/628 places, 1634/1634 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 381699 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(X(G(p0))))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1822
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1818
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1792
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 627 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 627 transition count 1636
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 618 transition count 1616
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 192 place count 616 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 612 transition count 1604
Applied a total of 202 rules in 216 ms. Remains 612 /711 variables (removed 99) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 04:58:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-23 04:58:31] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:58:31] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 04:58:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:58:31] [INFO ] Invariant cache hit.
[2024-05-23 04:58:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:58:33] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:58:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:58:33] [INFO ] Invariant cache hit.
[2024-05-23 04:58:33] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69495ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69511ms
Starting structural reductions in LTL mode, iteration 1 : 612/711 places, 1604/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71758 ms. Remains : 612/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 501 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40008 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 534546 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 534546 steps, saw 346953 distinct states, run finished after 3003 ms. (steps per millisecond=178 ) properties seen :0
[2024-05-23 04:59:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:59:47] [INFO ] Invariant cache hit.
[2024-05-23 04:59:47] [INFO ] State equation strengthened by 265 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/1677 variables, 71/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:59:48] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1683 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1597ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5573 steps, including 86 resets, run visited all 1 properties in 20 ms. (steps per millisecond=278 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 15 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:59:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:59:49] [INFO ] Invariant cache hit.
[2024-05-23 04:59:50] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 04:59:50] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:59:50] [INFO ] Invariant cache hit.
[2024-05-23 04:59:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:59:51] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:59:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:59:51] [INFO ] Invariant cache hit.
[2024-05-23 04:59:51] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69570ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69588ms
Finished structural reductions in LTL mode , in 1 iterations and 71659 ms. Remains : 612/612 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523581 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523581 steps, saw 339838 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 05:01:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:01:04] [INFO ] Invariant cache hit.
[2024-05-23 05:01:04] [INFO ] State equation strengthened by 265 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/1677 variables, 71/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:01:05] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1683 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1562ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4730 steps, including 71 resets, run visited all 1 properties in 24 ms. (steps per millisecond=197 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 504 ms.
Entered a terminal (fully accepting) state of product in 181 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-15 finished in 156633 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((X(F(p1))||p0))))'
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((G(p0)||X(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' '!(G(F((p0||G(p1)))))'
[2024-05-23 05:01:07] [INFO ] Flatten gal took : 64 ms
[2024-05-23 05:01:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 05:01:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 711 places, 1846 transitions and 7510 arcs took 16 ms.
Total runtime 1840804 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c008

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 711
TRANSITIONS: 1846
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.007s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1862
MODEL NAME: /home/mcc/execution/411/model
711 places, 1846 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="FunctionPointer-PT-c008"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-c008, 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 r179-tall-171640601200292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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